Maintaining limited-range connectivity among second-order agents

SIAM Journal on Control and Optimization

Volumn 48, Issue 1, 2009, Pages 187-205

  Savla, Ketan ^a   Notarstefano, Giuseppe ^b   Bullo, Francesco ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF SALENTO   (Italy)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Admissible sets; Connectivity maintenance; Distributed computation; Multi agent systems; Proximity graphs; Solvability of linear inequalities

Indexed keywords

AD HOC NETWORKS; COMPUTATION THEORY; MAINTENANCE; MULTI AGENT SYSTEMS; SET THEORY; TREES (MATHEMATICS);

ADMISSIBLE SET; CONNECTIVITY MAINTENANCE; DISTRIBUTED COMPUTATIONS; LINEAR INEQUALITIES; PROXIMITY GRAPHS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 60349105375     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/060674971     Document Type: Article

References (12)

1. G. NOTARSTEFANO, K. SAVLA, F. BULLO, AND A. JADBABAIE, Maintaining limited-range connectivity among second-order agents, in Proceedings of the IEEE American Control Conference (Minneapolis, MN), 2006, pp. 2124-2129.
2. H. ANDO, Y. OASA, I. SUZUKI, AND M. YAMASHITA, Distributed memoryless point convergence algorithm for mobile robots with limited visibility, IEEE Trans. Robotics Automat., 15 (1999), pp. 818-828.
3. J. LIN, A. S. MORSE, AND B. D. O. ANDERSON, The multi-agent rendezvous problem, in Proceedings of the 42nd IEEE Conference on Decision and Control (Maui, HI), 2003, pp. 1508-1513.
4. J. CORTÉS, S. MARTÍNEZ, AND F. BULLO, Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions, IEEE Trans. Automat. Control, 51 (2006), pp. 1289-1298.
5. A. GANGULI, J. CORTÉS, AND F. BULLO, On rendezvous for visually-guided agents in a nonconvex polygon, in Proceedings of the 44th IEEE Conference on Decision and Control and European Control Conference (Seville, Spain), 2005, pp. 5686-5691.
6. D. P. SPANOS AND R. M. MURRAY, Motion planning with wireless network constraints, in Proceedings of the IEEE American Control Conference (Portland, OR), 2005, pp. 87-92.
7. M. M. ZAVLANOS AND G. J. PAPPAS, Controlling connectivity of dynamic graphs, in Proceedings of the 44th IEEE Conference on Decision and Control and European Control Conference (Seville, Spain), 2005, pp. 6388-6393.
8. H. G. TANNER, A. JADBABAIE, AND G. J. PAPPAS, Flocking in fixed and switching networks, IEEE Trans. Automat. Control, 52 (2007), pp. 863-868.
9. Z. GAO, On discrete time optimal control: A closed-form solution, in Proceedings of the IEEE American Control Conference (Boston, MA), 2004, pp. 52-58.
10. B. ASPVALL AND Y. SHILOACH, A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality, SIAM J. Comput., 9 (1980), pp. 827-845.
11. M. BUI, F. BUTELLE, AND C. LAVAULT, A distributed algorithm for constructing a minimum diameter spanning tree, J. Parallel Distrib. Comput., 64 (2004), pp. 571-577.
12. D. P. BERTSEKAS AND J. N. TSITSIKLIS, Parallel and Distributed Computation: Numerical Methods, Athena Scientific, Belmont, MA, 1997.