Robust rendezvous for mobile autonomous agents
via proximity graphs in d dimensions

Jorge Cortés, Sonia Martínez and Francesco Bullo
IEEE Transactions on Automatic Control, 51 (8) (2006), 1289-1298

Abstract:

his 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.

File: main.pdf

Bib-tex entry:

@article{JC-SM-FB:06,
author = {J. Cort\'es and S. Mart{\'\i}nez and F. Bullo},
title = {Robust rendezvous for mobile autonomous agents via proximity graphs in d dimensions},
journal= {IEEE Transactions on Automatic Control},
volume = 51,
number = 8,
year = 2006,
pages = {1289--1298}
}