Surrounding Problem of Multi‐agent Systems Under Arbitrary Topology
Author(s) -
LIU Weifeng,
RU Xinfeng,
WEN Chenglin,
DONG Lijing
Publication year - 2020
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2020.06.002
Subject(s) - algebraic graph theory , integrator , containment (computer programming) , topology (electrical circuits) , multi agent system , computer science , network topology , lyapunov function , graph theory , control theory (sociology) , nonlinear system , lyapunov stability , stability theory , mathematics , control (management) , combinatorics , artificial intelligence , computer network , physics , bandwidth (computing) , quantum mechanics , programming language , operating system
This paper studies surrounding dynamically multi‐targets with second‐order integrator/nonlinear systems and continuous time‐varying topology. The continuous time‐varying topology refers to the continuous change of the topology rather than switching in several fixed topologies. Surrounding multi‐targets is an extension of containment control. The distributed control algorithm is designed based on the containment control theory. By transforming the system of containment control into error stability, the condition that the error between multi‐agent systems and multi‐targets to be constant can be obtained by using the algebraic graph theory, matrix theory and Lyapunov function stability analysis. The multiagent systems can dynamically surround multi‐targets by designing the deviation vector. Finally, simulation experiments verify the effectiveness of the proposed algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom