Abstract
SummaryIn this article, the target controllability of multiagent systems under fixed and switching topologies is investigated, respectively. In the fixed topology setting, some necessary and/or sufficient algebraic and graph‐theoretic conditions are proposed, and the target controllable subspace is quantitatively studied by virtue of almost equitable graph vertex partitions. In the switching topology setting, based on the concepts of the invariant subspace and the target controllable state set, some necessary and sufficient algebraic conditions are obtained. Moreover, the target controllability is studied from the union graph perspective. The results show that when the union graph of all the possible topologies is target controllable, the multiagent system would be target controllable even if each of its subsystems is not. Numerical simulations are provided finally to verify the effectiveness of the theoretical results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Robust and Nonlinear Control
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
