Distributed Algorithms for Autonomous Mobile Robots

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 paper we describe the current investigations on the interplay between robots capabilities, computability, and algorithmic solutions of coordination problems by autonomous mobile robots.

DOI: 10.1007/978-0-387-34735-6_5

Extracted Key Phrases

4 Figures and Tables

Statistics

0102030'04'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

196 Citations

Semantic Scholar estimates that this publication has 196 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Santoro2006DistributedAF, title={Distributed Algorithms for Autonomous Mobile Robots}, author={Nicola Santoro}, booktitle={IFIP TCS}, year={2006} }