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

@article{Corts2006RobustRF,
  title={Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions},
  author={Jorge Cort{\'e}s and Sonia Mart{\'i}nez and Francesco Bullo},
  journal={IEEE Transactions on Automatic Control},
  year={2006},
  volume={51},
  pages={1289-1298}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 619 citations. REVIEW CITATIONS
379 Citations
21 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 379 extracted citations

619 Citations

020406080'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 619 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

The multi-agent rendezvous problem: an extended summary

  • J. Lin, A. S. Morse, B.D.O. Anderson
  • Proceedings of the 2003 Block Island Workshop on…
  • 2003
Highly Influential
4 Excerpts

Cooperative controlof mobile sensor networks : adaptive gradient climbing in a distribu ed environment

  • E. Fiorelli P. Ögren, N. E. Leonard
  • IEEE Transactions on Automatic Control
  • 2004

Similar Papers

Loading similar papers…