Structural approximate controllability of linear systems: a pure graph theoretical approach. Part I: Linear systems associated to simple CACTI.

• Autorzy: Hahn H. , Sommer H.-J.
• Języki publikacji: EN

Abstrakty

EN

In a well known theorem of C. T. Lin the structural controllability of linear systems has been derived from special pattern (cacti) of associated graphs. This statement will be proved by pure graph theoretical arguments in this paper. The proof will be carried out by introducing three different types of cacti (simple cacti, chain bud cacti and general cacti) and two different order relations on the set of buds of the cacti, and by constructing special input control sequences for each of these systems. In Part I of this paper, the theorem will be proved for systems that are associated to simple cacti. In Part II of this paper, the theorem will be proved for systems associated to chain bud cacti or to general cacti. The theoretical results will be illustrated by two examples, including a simple cactus and general cactus. The results obtained provide a basis for deriving global controllability criteria of polynomial nonlinear sampled data systems based on nonlinear bundle graphs. These latter results will be published in a subsequent paper.

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 1998
• Tom: Vol. 24, nr 1
• Strony: 5--31
• Opis fizyczny: Bibliogr. 10 poz., rys. 8

Twórcy

autor

Hahn H.

autor

Sommer H.-J.

• University of Kassel, Department of Mechanical Engineering (FB 15), Laboratory of Control Engineering and System Dynamics, Moenchebergstr. 7, 34109 Kassel, Germany