Practical rendezvous through modified circumcenter algorithms

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2007, Pages 2369-2374

  Martínez, Sonia ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SPURIOUS SIGNAL NOISE;

CIRCUMCENTER ALGORITHMS; NOISY MEASUREMENTS; STOCHASTIC ANALYSIS;

NONLINEAR SYSTEMS;

EID: 62749141585     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4434171     Document Type: Conference Paper

References (14)

1. V. Kummar, N. Leonard, and A. Morse, eds., Proc. of the 2003 Block Island Workshop on Cooperative Control, vol. 309 of Lecture Notes in Control and Information Sciences. Springer-Verlag, 2004.
2. H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita, "Distributed memoryless point convergence algorithm for mobile robots with limited visibility," IEEE Transactions on Robotics and Automation, vol. 15, no. 5, pp. 818-828, 1999.
3. J. Lin, A. Morse, and B. Anderson, "The Multi-Agent Rendezvous Problem - Part 2: The Asynchronous Case," SIAM J. Control and Optimization, 2005. Submitted.
4. J. Lin, A. Morse, and B. Anderson, "The Multi-Agent Rendezvous Problem - Part 1: The Synchronous Case," SIAM J. Control and Optimization, 2005. To appear.
5. J. Cortés, S. Martínez, and F. Bullo, "Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions," IEEE Transactions on Automatic Control, vol. 51, no. 8, pp. 1289-1298, 2006.
6. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, "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. Reichet, eds.), vol. 2010 of Lecture Notes in Computer Science, pp. 247-258, New York: Springer Verlag, 2001.
7. L. Schenato and S. Zampieri, "Optimal rendezvous control for randomized communication topologies," in IEEE Conf. on Decision and Control, (San Diego), pp. 4339-4344, December 2006.
8. L. Xiao, S. Boyd, and S. J. Kim, "Distributed average consensus with least-mean-square deviation," Journal of Parallel and Distributed Computing, vol. 67, no. 1, pp. 33-46, 2007.
9. D. B. Kingston, W. Ren, and R. W. Beard, "Consensus algorithms are input-to-state stable," in American Control Conference, (Portland, OR), pp. 1686-1690, June 2005.
10. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. New York: Springer Verlag, 2 ed., 2000.
11. S. Martínez, F. Bullo, J. Cortés, and E. Frazzoli, "On synchronous robotic networks - Part II: Time complexity of rendezvous and deployment algorithms," IEEE Transactions on Automatic Control, vol. 53, no. 1, 2008. To appear.
12. J. W. Jaromczyk and G. T. Toussaint, "Relative neighborhood graphs and their relatives," Proceedings of the IEEE, vol. 80, no. 9, pp. 1502-1517, 1992.
13. J. Cortés, S. Martínez, and F. Bullo, "Spatially- distributed coverage optimization and control with limited-range interactions," ESAIM. Control, Optimisation & Calculus of Variations, vol. 11, pp. 691-719, 2005.
14. L. Rogers and D. Williams, Diffusions, Markov Processes and Martingales. Cambridge University Press, second ed., 1997.