On robust rendezvous for mobile autonomous agents

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 16, Issue , 2005, Pages 115-120

  Martínez, Sonia ^a   Cortés, Jorge ^b   Bullo, Francesco ^a  

^a University of California   (United States)

^b University of California Santa Cruz   (United States)

Author keywords

Networked control systems; Non deterministic discrete time dynamical systems; Proximity graphs; Rendezvous

Indexed keywords

DIGITAL CONTROL SYSTEMS; DISCRETE TIME CONTROL SYSTEMS; DYNAMICAL SYSTEMS; MOBILE AGENTS; MULTI AGENT SYSTEMS; NETWORKED CONTROL SYSTEMS;

COMMUNICATION TOPOLOGIES; COORDINATION ALGORITHMS; DISCRETE - TIME SYSTEMS; DISCRETE-TIME DYNAMICAL SYSTEMS; LASALLE INVARIANCE PRINCIPLE; MOBILE AUTONOMOUS AGENTS; PROXIMITY GRAPHS; RENDEZVOUS;

AUTONOMOUS AGENTS;

EID: 79960727127     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20050703-6-cz-1902.02071     Document Type: Conference Paper

References (15)

1. Ando, H., Y. Oasa, I. Suzuki and M. Yamashita (1999). Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation 15(5), 818-828.
2. Cortés, J., S. Martínez and F. Bullo (2004a). Robust rendezvous for mobile autonomous agents via proximity graphs in d dimensions. IEEE Transactions on Automatic Control. Submitted. Electronic version available at http://www.me.ucsb.edu/bullo.
3. Cortés, J., S. Martínez and F. Bullo (2004b). Spatially-distributed coverage optimization and control with limited-range interactions. ESAIM. Control, Optimisation & Calculus of Variations. Electronic version available at http://www.me.ucsb.edu/bullo. To appear.
4. de Berg, M., M. van Kreveld and M. Overmars (1997). Computational Geometry: Algorithms and Applications. Springer Verlag. New York.
5. Diestel, R. (2000). Graph Theory. Vol. 173 of Graduate Texts in Mathematics. second ed.. Springer Verlag. New York.
6. Flocchini, P., G. Prencipe, N. Santoro and P. Widmayer (2001). Gathering of asynchronous oblivious robots with limited visibility. In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science (Dresden, Germany) (A. Ferreira and H. Reichel, Eds.). Vol. 2010 of Lecture Notes in Computer Science. pp. 247-258. Springer Verlag. New York.
7. Jaromczyk, J. W. and G. T. Toussaint (1992). Relative neighborhood graphs and their relatives. Proceedings of the IEEE 80(9), 1502- 1517.
8. Justh, E. W. and P. S. Krishnaprasad (2004). Equilibria and steering laws for planar formations. Systems & Control Letters 52(1), 25- 38.
9. Klavins, E., R. Ghrist and D. Lipsky (2004). A grammatical approach to self-organizing robotic systems. IEEE Transactions on Automatic Control. Submitted.
10. Li, X.-Y. (2003). Algorithmic, geometric and graphs issues in wireless networks. Wireless Communications and Mobile Computing 3(2), 119-140.
11. Lin, J., A. S. Morse and B. D. O. Anderson (2004a). The multi-agent rendezvous problem - the asynchronous case. In: IEEE Conf. on Decision and Control. Paradise Island, Bahamas. pp. 1926-1931.
12. Lin, J., A. S. Morse and B. D. O. Anderson (2004b). The multi-agent rendezvous problem: an extended summary. In: Proceedings of the 2003 Block Island Workshop on Co-operative Control (V. Kumar, N. E. Leonard and A. S. Morse, Eds.). Vol. 309 of Lecture Notes in Control and Information Sciences. pp. 257-282. Springer Verlag. New York.
13. Lin, Z., M. Broucke and B. Francis (2004c). Local control strategies for groups of mobile autonomous agents. IEEE Transactions on Automatic Control 49(4), 622-629.
14. Liu, Y. and K. M. Passino (2004). Stable social foraging swarms in a noisy environment. IEEE Transactions on Automatic Control 49(1), 30-44.
15. Suzuki, I. and M. Yamashita (1999). Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing 28(4), 1347-1363.