×

zbMATH — the first resource for mathematics

Necessary and sufficient conditions for containment control of networked multi-agent systems. (English) Zbl 1246.93008
Summary: In this paper, containment control problems for networked multi-agent systems with multiple stationary or dynamic leaders are investigated. The topologies that characterize the interaction among the leaders and the followers are directed graphs. Necessary and sufficient criteria which guarantee the achievement of containment control are established for both continuous-time and sampled-data based protocols. When the leaders are stationary, the convergence for continuous-time protocol (sampled-data based protocol) is completely dependent on the topology structure (both the topology structure and the size of sampling period). When the leaders are dynamic, the convergence for continuous-time protocol (sampled-data based protocol) is completely dependent on the topology structure and the gain parameters (the topology structure, the gain parameters, and the size of sampling period). Moreover, the final states of all the followers are exclusively determined by the initial values of the leaders and the topology structure. In the stationary leaders case, all the followers will move into the convex hull spanned by the leaders, while in the dynamic leaders case, the followers will not only move into the convex hull but also move with the leaders with the same velocity. Finally, all the theoretical results are illustrated by numerical simulations.

MSC:
93A14 Decentralized systems
68T45 Machine vision and scene understanding
93C57 Sampled-data control/observation systems
PDF BibTeX Cite
Full Text: DOI
References:
[1] Biggs, N., Algebraic graph theory, (1974), Cambridge Univ. Press Cambridge, UK · Zbl 0284.05101
[2] Cao, Y., & Ren, W. 2009. Containment control with multiple stationary or dynamic leaders under a directed interaction graph. In Joint 48th IEEE conference on decision and control and 28th Chinese control conference, pp. 3014-3019.
[3] Cao, Y., Stuart, D., Ren, W., & Meng, Z. 2010. Distributed containment control for double-integrator dynamics: algorithms and experiments. In 2010 American control conference, pp. 3830-3835.
[4] Cortes, J.; Martinez, S.; Bullo, F., Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions, IEEE transactions on automatic control, 51, 8, 1289-1298, (2006) · Zbl 1366.93400
[5] Dimarogonas, D.V., Egerstedt, M., & Kyriakopoulos, K.J. 2006. A leader-based containment control strategy for multiple unicycles. In Proceedings of the 45th IEEE conference on decision and control pp. 5968-5973.
[6] Dimarogonas, D.V.; Kyriakopoulos, K.J., On the rendezvous problem for multiple nonholonomic agents, IEEE transactions on automatic control, 52, 5, 916-922, (2007) · Zbl 1366.93401
[7] Egerstedt, M.; Hu, X., Formation constrained multi-agent control, IEEE transactions on robotics and automation, 17, 6, 947-951, (2001)
[8] Gupta, P., & Kumar, P.R. 1998. Critical power for asymptotic connectivity in wireless networks, Stochastic analysis, control, optimization and applications.
[9] Horn, R.A.; Johnson, C.R., Matrix analysis, (1987), Cambridge Univ. Press Cambridge, UK
[10] Jadbabaie, A.; Lin, J.; Morse, A.S., Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE transactions on automatic control, 48, 6, 988-1001, (2003) · Zbl 1364.93514
[11] Ji, M.; Ferrari-Trecate, G.; Egerstedt, M.; Buffa, A., Containment control in mobile networks, IEEE transactions on automatic control, 53, 8, 1972-1975, (2008) · Zbl 1367.93398
[12] Lin, Z.; Francis, B.; Maggiore, M., Necessary and sufficient graphical conditions for formation control of unicycles, IEEE transactions on automatic control, 50, 1, 121-127, (2005) · Zbl 1365.93324
[13] McNew, J.M.; Klavins, E.; Egerstedt, M., Solving coverage problems with embedded graph grammars, (), 413-427 · Zbl 1221.68246
[14] Moreau, L., Stability of multiagent systems with time-dependent communication links, IEEE transactions on automatic control, 50, 2, 169-182, (2005) · Zbl 1365.93268
[15] Notarstefano, G., Egerstedt, M., & Haque, M. 2009. Rendezvous with multiple, intermittent leaders. In Joint 48th IEEE conference on decision and control and 28th Chinese control conference, pp. 2733-2738.
[16] Notarstefano, G.; Egerstedt, M.; Haque, M., Containment in leader-follower networks with switching communication topologies, Automatica, 47, 1035-1040, (2011) · Zbl 1233.93009
[17] Ogata, K., Discrete-time control systems, (1995), Prentice-Hall Englewood Cliffs, NJ
[18] Olfati-Saber, R., Flocking for multi-agent dynamic systems: algorithms and theory, IEEE transactions on automatic control, 51, 3, 401-420, (2006) · Zbl 1366.93391
[19] Olfati-Saber, R.; Murray, R.M., Consensus problems in networks of agents with switching topology and time-delays, IEEE transactions on automatic control, 49, 9, 1520-1533, (2004) · Zbl 1365.93301
[20] Porfiri, M.; Roberson, D.G.; Stilwell, D.J., Tracking and formation control of multiple autonomous agents: a two-level consensus approach, Automatica, 43, 1318-1328, (2007) · Zbl 1130.93349
[21] Ren, W.; Beard, R.W., Consensus seeking in multiagent systems under dynamically changing integration topologies, IEEE transactions on automatic control, 50, 5, 655-661, (2005) · Zbl 1365.93302
[22] Rockafellar, R.T., Convex analysis, (1972), Princeton University Press New Jersey · Zbl 0224.49003
[23] Tanner, H.G.; Jadbabaie, A.; Pappas, G.J., Flocking in fixed and switching networks, IEEE transactions on automatic control, 52, 5, 863-868, (2007) · Zbl 1366.93414
[24] Taussky, O., A recurring theorem on determinants, American mathematical monthly, 10, 672-676, (1949) · Zbl 0036.01301
[25] Xiao, F., & Wang, L. 2006. Consensus behavior of agents in networked systems under general communication topologies. In Proceedings of the 2006 IEEE international symposium on intelligent control. pp. 862-867.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.