Title :
Modeling and Analysis of Multi-agent Coordination Using Nearest Neighbor Rules
Author :
Chen Xuesong ; Yang Yimin ; Cai Shuting ; Chen Jianping
Author_Institution :
Fac. of Appl. Math., Guangdong Univ. of Technol., Guangzhou
Abstract :
In a recent IEEE Transactions on Automatic Control article, Jadbabaie et al. provides a theoretical explanation of the discrete-time model of groups of mobile autonomous agents raised by Vicsek et al. in 1995. In their paper, Jadbabaie et al. established conditions given in terms of neighbor graphs for coordination of agents and provided that these agents are periodically linked together. This paper sharpens this result by showing that coordination will be reached under a very weak condition that requires all agents are finally linked together. The theorems in this paper show that convergence will be attained if these neighbor graphs are finally linked together. This condition is also strictly weaker than the one Jadbabaie et al. desired. An example is provided that illustrates the soundness of the theorem.
Keywords :
control system analysis; discrete time systems; graph theory; mobile robots; multi-agent systems; multi-robot systems; discrete-time model; mobile autonomous agent; mobile multi robot; multiagent coordination analysis; multiagent coordination modeling; nearest neighbor graph rule; Asia; Autonomous agents; Computational modeling; Informatics; Mathematical model; Nearest neighbor searches; Robot control; Robot kinematics; Robotics and automation; Sufficient conditions;
Conference_Titel :
Informatics in Control, Automation and Robotics, 2009. CAR '09. International Asia Conference on
Conference_Location :
Bangkok
Print_ISBN :
978-1-4244-3331-5
DOI :
10.1109/CAR.2009.18