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 multi-agent 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. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1109/TAC.2006.878713 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Robustness,Autonomous agents,Communication system control,Algorithm design and analysis,Communication switching,Mobile communication,Network topology,Robust control,Ad hoc networks,Motion control | Autonomous agent,Motion control,Nondeterministic algorithm,Control theory,Computer science,Robustness (computer science),Dynamical systems theory,Rendezvous,Robust control,Mobile robot,Distributed computing | Journal |
Volume | Issue | ISSN |
51 | 8 | 0018-9286 |
Citations | PageRank | References |
270 | 22.45 | 12 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jorge Cortes | 1 | 1452 | 128.75 |
Sonia Mart ´ inez | 2 | 856 | 58.27 |
Francesco Bullo | 3 | 4989 | 415.53 |