Regularity/Controllability/Observability of an NDS with Descriptor Form Subsystems and Generalized LFTs
For control theorists and engineers working on large-scale networked systems, this work provides a decentralized analysis framework, but the results are incremental as they extend existing Kronecker-based methods to a specific descriptor-LFT setting.
This paper establishes necessary and sufficient conditions for regularity, controllability, and observability of networked dynamic systems with descriptor form subsystems and generalized LFTs, using matrix rank tests based on Kronecker canonical forms. The conditions are decentralized, allowing independent subsystem computations.
This paper investigates regularity, controllability and observability for a networked dynamic system (NDS) with its subsystems being described in a descriptor form and system matrices of each subsystem being represented by a generalized linear fractional transformation (GLFT) of its parameters. Except a well-posedness condition, no any other constraints are put on either parameters or connections of a subsystem. Based on the Kronecker canonical form (KCF) of a matrix pencil, some matrix rank based necessary and sufficient conditions are established respectively for the regularity and complete controllability/observability of the NDS, in which the associated matrix depends affinely on both subsystem parameters and subsystem connections. These conditions keep the property that all the involved numerical computations are performed on each subsystem independently, which is attractive in the analysis and synthesis of a large scale NDS. Moreover, some explicit and easily checkable requirements are derived for subsystem dynamics/parameters with which a completely controllable/observable NDS can be constructed more easily.