Controllability of multiagent systems based on path and cycle graphs. (30th June 2017)

• Record Type: Journal Article
• Authors: Liu, Xianzhu; Ji, Zhijian
• Is Part Of: International journal of robust and nonlinear control. Volume 28:Number 1(2018)
• Page Start: 296
• Page End: 309
• Publication Date: 2017-06-30
• Subjects: controllability -- cycle -- multiagent systems -- path; Automatic control -- Periodicals; Control theory -- Periodicals; Nonlinear systems -- Periodicals; 629.836
• DOI: 10.1002/rnc.3870
• Languages: English
• ISSNs: 1049-8923

Abstract

Summary: This paper studies the controllability of multiagent systems based on path and cycle graphs. For paths or cycles, sufficient and necessary conditions are presented for determining the locations of leaders under which the controllability can be realized. Specifically, the controllability of a path is shown to be determined by a set generated only from its odd factors, and the controllability of a cycle is determined by whether the distance between 2 leaders belongs to a set generated from its even (odd) factors when the number of its nodes is even (odd). For both graphs, the dimension of the controllable subspace is also derived. Moreover, the technique used in the derivation of the above results is further used to get sufficient and necessary conditions for several different types of graphs generated from path and cycle topologies. These types of graphs can be regarded as typical topologies in the study of multiagent controllability, and accordingly the obtained results have meaningful enlightenment for the research in this field.