Combination framework of rendezvous algorithm for multi-agent systems with limited sensing ranges

Asian Journal of Control

Volumn 13, Issue 2, 2011, Pages 283-294

  Fan, Yuan ^a   Feng, Gang ^b   Wang, Yong ^c  

^a University of Science and Technology of China   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Convex combination; Cooperative control; Decentralized rendezvous algorithms; Graph theory; Multi agent systems

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; GRAPH ALGORITHMS; GRAPH THEORY; SOFTWARE AGENTS;

ALGORITHM FRAMEWORK; CO-OPERATIVE CONTROL; CONVEX COMBINATIONS; NETWORKED MULTI-AGENT SYSTEMS; SENSING RANGES;

MULTI AGENT SYSTEMS;

EID: 77958121467     PISSN: 15618625     EISSN: None     Source Type: Journal    
DOI: 10.1002/asjc.178     Document Type: Article

References (26)

1. Ji, M. and M. Egerstedt, "Distributed formation control while preserving connectedness," Proc. 45th IEEE Conf. Decis. Control, San Diego, CA, U.S.A., pp. 5962-5967 (2006).
2. Hendrickx, J. M., B. Fidan, C. Yu, B. D. O. Anderson, and V. D. Blondel, "Formation reorganization by primitive operations on directed graphs," IEEE Trans. Autom. Control, Vol. 53, No. 4, pp. 968-979 (2008).
3. Hu, J., Y. G. Hong, and G. Feng, "Distributed dynamic control for leaderless multi-agent consensus with star-like topology," Asian J. Control, Vol. 10, No. 2, pp. 233-237 (2008).
4. Lin, Z., M. Broucke, and B. Francis, "Local control strategies for groups of mo-bile autonomous agents," IEEE Trans. Autom. Control, Vol. 49, No. 4, pp. 622-629 (2004).
5. Liu, Y, K. M. Passino, and M. M. Polycarpou, "Stability analysis of m-dimensional asynchronous swarms with a fixed communication topology," IEEE Trans. Autom. Control, Vol. 48, No. 1, pp. 76-95 (2003).
6. Su, H., X. Wang, and G. Chen, "A connectivitypreserving flocking algorithm for multi-agent systems based only on position measurements," Int. J. Control, Vol. 82, No. 7, pp. 1334-1343 (2009).
7. Tanner, H. G., A. Jadbabaie, and G. J. Pappas, "Flocking in fixed and switching networks," IEEE Trans. Autom. Control, Vol. 52, No. 5, pp. 863-868 (2007).
8. Jadbabaie, A., J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, Vol. 48, No. 6, pp. 988-1001 (2003).
9. Cortés, J., S. Martinez, and F. Bullo, "Spatiallydistributed coverage optimization and control with limited-range interactions," ESAIM. Control, Optim. Calculus Van., Vol. 11, pp. 691-719 (2005).
10. Cortés, J., S. Martinez, and F. Bullo, "Robust rendezvous for mobile autonomous agents via proximity graph in arbitrary dimensions," IEEE Trans. Autom. Control, Vol. 51, No. 8, pp. 1289-1298 (2006).
11. Smith, S. L., M. E. Brouche, and B. A. Francis, "Curve shortening and the rendez-vous problem for mobile autonomous robots," IEEE Trans. Autom. Control, Vol. 52, No. 6, pp. 1154-1159 (2007).
12. Dimarogonas, D. V. and K. J. Kyriakopoulos, "On the rendezvous problem for multiple nonholonomic agents," IEEE Trans. Autom. Control, Vol. 52, No. 5, pp. 916-922 (2007).
13. Lin, J., A. S. Morse, and B. D. O. Anderson, "The multi-agent rendezvous problem - part 1 the synchronous case," SIAM J. Control Optim., Vol. 46, No. 6, pp. 2096-2119 (2007).
14. Lin, J., A. S. Morse, and B. D. O. Anderson, "The multi-agent rendezvous problem," Proc. 42nd IEEE Conf. Decis. Control, Maui, Hawaii, U.S.A., pp. 1508-1513 (2003).
15. Conte, G. and P. Pennesi, "On convergence conditions for rendezvous," Proc. 46th IEEE Conf. Decis. Control, New Orleans, LA, U.S.A., pp. 2375-2378 (2007).
16. Ando, H., Y. Oasa, I. Suzuki, and M. Yamashita, "Distributed memoryless point convergence algorithm for mobile robots with limited visibility," IEEE Trans. Robot. Autom., Vol. 15, No. 5, pp. 818-828 (1999).
17. Ren, W. and R. W. Beard, "Consensus seeking in multiagent systems under dynamically changing interaction topologies," IEEE Trans. Autom. Control, Vol. 50, No. 5, pp. 655-661 (2005).
18. Cao, M., A. S. Morse, and B. D. O. Anderson, "Reaching a consensus in a dynamically changing environment: a graphical approach," SIAM J. Control Optim., Vol. 47, No. 2, pp. 575-600 (2008).
19. Xiao, F. and L. Wang, "Asynchronous consensus in continuous-time multi-agent systems withswitching topology and time-varying delays," IEEE Trans. Autom. Control, Vol. 53, No. 8, pp. 1804-1816 (2008).
20. Li, Q. and Z. P. Jiang, "Two decentralized heading consensus algorithms for nonlinear multi-agent systems," Asian J. Control, Vol. 10, No. 2, pp. 187-200 (2008).
21. Xiao, L. and S. Boyd, "Fast linear iterations for distributed averaging," Syst. Control Lett., Vol. 53, No. 1, pp. 65-78 (2004).
22. Kim, Y and M. Mesbahi, "On maximizing the second smallest eigenvalue of a state-dependent graph laplacian," IEEE Trans. Autom. Control, Vol. 51, No. l, pp. 116-120 (2006).
23. Zavlanos, M. M. and G. J. Pappas, "Potential field for maintaining connectivity of mobile networks," IEEE Trans. Robot., Vol. 23, No. 4, pp. 812-816 (2007).
24. Cao, M., A. S. Morse, and B. D. O. Anderson, "Agreeing asynchronously," IEEE Trans. Autom. Control, Vol. 53, No. 8, pp. 1826-1838 (2008).
25. Saber, R. O., J. A. Fax, and R. M. Murray, "Consensus and cooperation in networked multiagent systems," Proc. IEEE, Vol. 95, No. 1, pp. 215-233 (2007).
26. Diestel, R., Graph Theory, Graduate Texts in Mathematics, Vol. 173 (3rd edn). Springer, Berlin, Germany (2006).