TY - JOUR
T1 - Cooperative containment control in time-delayed multi-agent systems with discrete-time high-order dynamics under dynamically changing topologies
AU - Shao, Jinliang
AU - Shi, Lei
AU - Zheng, Wei Xing
AU - Cheng, Yuhua
PY - 2019
Y1 - 2019
N2 - This paper addresses the containment control problem for discrete-time high-order multi-agent systems (MASs) with dynamically changing topologies and time-varying delays. By considering the influence of switching topologies, a distributed containment control protocol that only involves the agent's own information and its neighbors’ partial information is given to make all the followers enter and keep moving in the convex hull formed by the static leaders. A novel technique is employed to transform the high-order MAS with dynamically changing topologies into a switched augmented system with nonnegative coefficient matrices, and then convert the convergence problem of the switched augmented system to a product problem of infinite time-varying row stochastic matrices. With the help of graph theory and the properties of stochastic indecomposable and aperiodic (SIA) matrices, a sufficient condition in terms of communication topologies is derived, that is, the high-order containment control with dynamically changing topologies and time-varying delays can be achieved if the union of the effective communication topologies across any time intervals with some given length contains a spanning forest rooted at the leaders. Finally, computer simulations are conducted to illustrate the efficiency of the theoretical findings.
AB - This paper addresses the containment control problem for discrete-time high-order multi-agent systems (MASs) with dynamically changing topologies and time-varying delays. By considering the influence of switching topologies, a distributed containment control protocol that only involves the agent's own information and its neighbors’ partial information is given to make all the followers enter and keep moving in the convex hull formed by the static leaders. A novel technique is employed to transform the high-order MAS with dynamically changing topologies into a switched augmented system with nonnegative coefficient matrices, and then convert the convergence problem of the switched augmented system to a product problem of infinite time-varying row stochastic matrices. With the help of graph theory and the properties of stochastic indecomposable and aperiodic (SIA) matrices, a sufficient condition in terms of communication topologies is derived, that is, the high-order containment control with dynamically changing topologies and time-varying delays can be achieved if the union of the effective communication topologies across any time intervals with some given length contains a spanning forest rooted at the leaders. Finally, computer simulations are conducted to illustrate the efficiency of the theoretical findings.
KW - graph theory
KW - multiagent systems
KW - stochastic systems
UR - http://handle.westernsydney.edu.au:8081/1959.7/uws:51106
U2 - 10.1016/j.jfranklin.2018.11.014
DO - 10.1016/j.jfranklin.2018.11.014
M3 - Article
VL - 356
SP - 2441
EP - 2462
JO - Journal of the Franklin Institute
JF - Journal of the Franklin Institute
IS - 5
ER -