Abstract
The distributed coordination and control of a team of autonomous mobile robots is a problem widely studied in a variety of fields, such as engineering, artificial intelligence, artificial life, robotics. Generally, in these areas, the problem is studied mostly from an empirical point of view. Recently, a significant research effort has been and continues to be spent on understanding the fundamental algorithmic limitations on what a set of autonomous mobile robots can achieve. In particular, the focus is to identify the minimal robot capabilities (sensorial, motorial, computational) that allow a problem to be solvable and a task to be performed. In this talk we describe the current investigations on the inter-play between robots capabilities, computability, and algorithmic solutions of coordination problems by autonomous mobile robots.
Please use the following format when citing this chapter: Santoro, N., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), p. 11.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Santoro, N. (2006). Distributed Algorithms for Autonomous Mobile Robots. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)