REVIEW 2 cited by
Controllability and observability of linear multi-agent systems over matrix-weighted signed networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Controllability and observability of linear multi-agent systems over matrix-weighted signed networks
read the original abstract
In this paper, the controllability and observability of linear multi-agent systems over matrix-weighted signed networks are analyzed. Firstly, the definition of equitable partition of matrix-weighted signed multi-agent system is given, and the upper bound of controllable subspace and a necessary condition of controllability are obtained by combining the restriction conditions of the coefficient matrix and matrix weight for the case of fixed and switching topologies, respectively.The influence of different selection methods of coefficient matrices on the results is discussed. Secondly, for the case of heterogeneous systems, the upper bound of controllable subspace and the necessary condition of controllability are obtained when the dynamics of individuals in the same cell are the same. Thirdly, sufficient conditions for controllable and uncontrollable union graphs are obtained by taking advantage of the concept of switched systems and equitable partitions, respectively. Finally, necessary condition of observability is obtained in terms of the dual system and the constraints of the coefficient matrix, and the relationship between the observability and the controllability of the matrix-weighted signed multi-agent systems is discussed.
Forward citations
Cited by 2 Pith papers
-
On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks
Minimal leaders for strong structural controllability in matrix-weighted networks are obtained by seeding every layer-specific source component, then breaking equitable symmetries via WL greedy, EP-bound greedy, or pa...
-
On the Strong Structural Controllability of Matrix-Weighted Networks
The strong structural controllable subspace of a matrix-weighted network is claimed to lie between the sum of layer-specific distance partitions and the minimal equitable partition bound.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.