Consensus for Damaged Multi-agent System
-
摘要: 针对受损多智能体系统的信息一致性问题, 基于代数图论提出了联合r连通概念, 给出了当系统中的部分成员受损或离开后不能继续原有工作时, 其余成员仍可实现一致性的充要条件. 研究结果表明, 在此条件下系统可失去成员的数量取决于系统的通信能力. 仿真实例验证了理论分析结果的正确性和有效性.Abstract: In this paper, a theoretical framework for information consensus problem was presented for damaged multi-agent networked systems with an emphasis on the dynamically changing topology. Based on the algebraic graph theory, a new concept of jointly r-connected for digraph was proposed, and a sufficient and necessary condition for the consensus problem was established when some members of the system were damaged or left the system for other missions. It was shown that the number of the members which can be lost depends on the communication ability of the system. Finally, simulation results were used to demonstrate the effectiveness and correctness of the theoretical work.
-
Key words:
- Damaged system /
- multi-agent /
- consensus /
- switching topology /
- jointly r-connected
-
[1] Vicsek T, Czirók A, Ben-Jacob E, Cohen I, Schochet O. Novel type of phase transition in a system of self-driven particles. Physical Review Letters, 1995, 75(6): 1226-1229[2] Jadbabaie A, Lin J, Morse S A. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 2003, 48(6): 988-1001[3] Olfati-Saber R, Murray R M. Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control, 2004, 49(9): 1520-1533[4] Ren W, Beard R W. Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Transactions on Automatic Control, 2005, 50(5): 655-661[5] Ren W. Consensus tracking under directed interaction topologies: algorithms and experiments. IEEE Transactions on Control Systems Technology, 2010, 18(1): 230-237[6] Tahbaz-Salehi A, Jadbabaie A. A necessary and sufficient condition for consensus over random networks. IEEE Transactions on Automatic Control, 2008, 53(3): 791-795[7] Tahbaz-Salehi A, Jadbabaie A. Consensus over ergodic stationary graph processes. IEEE Transactions on Automatic Control, 2010, 55(1): 225-230[8] Wang L, Xiao F. Finite-time consensus problems for networks of dynamic agents. IEEE Transactions on Automatic Control, 2010, 55(4): 950-955[9] Sun Y G, Wang L. Consensus of multi-agent systems in directed networks with nonuniform time-varying delays. IEEE Transactions on Automatic Control, 2009, 54(7): 1607-1613[10] Xiao F, Wang L. Asynchronous consensus in continuous-time multi-agent systems with switching topology and time-varying delays. IEEE Transactions on Automatic Control, 2008, 53(8): 1804-1816[11] Fax J A, Murray R M. Information flow and cooperative control of vehicle formations. IEEE Transaction on Automatic Control, 2004, 49(9): 1465-1476[12] Huang Qin-Zhen. Consensus analysis of multi-agent discrete-time systems. Acta Automatica Sinica, 2012, 38(7): 1127-1133(黄勤珍. 离散时间多智能体系统的一致性. 自动化学报. 2012, 38(7): 1127-1133)[13] Yan Jing, Guan Xin-Ping, Luo Xiao-Yuan, Yang Xian. Consensus and trajectory planning with input constraints for multi-agent systems. Acta Automatica Sinica, 2012, 38(7): 1074-1082(闫敬, 关新平, 罗小元, 杨晛. 多智能体系统输入约束下的一致性与轨迹规划研究. 自动化学报. 2012, 38(7): 1074-1082)[14] Diestel R. Graph Theory. New York: Springer-Verlag, 2005[15] Horn R A, Johnson C R. Matrix Analysis. Cambridge: Cambridge University Press, 1987[16] Godsil C, Royle G F. Algebraic Graph Theory. New York: Springer-Verlag, 2001[17] Wolfowitz J. Products of indecomposable, aperiodic, stochastic matrices. Proceedings of the American Mathematical Society, 1963, 14(5): 733-736
点击查看大图
计量
- 文章访问数: 1799
- HTML全文浏览量: 76
- PDF下载量: 952
- 被引次数: 0