Title: Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
Abstract: This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multiagent networks in arbitrary dimensions under weak requirements on the switching and failing communication topology. The novel correctness proof relies on proximity graphs and their properties and on a general LaSalle invariance principle for nondeterministic discrete-time dynamical systems
Publication Year: 2006
Publication Date: 2006-08-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 698
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot