Distributed algorithms for autonomous mobile robots
The distributed coordination and control of a team of autonomous mobile robots is a problem widely studied in a variety of elds, such as engineering, arti cial intelligence, arti cial life, robotics. Generally, in these areas, the problem is studied mostly from an empirical point of view. Recently...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/24373 |
| Aporte de: |
| Sumario: | The distributed coordination and control of a team of autonomous mobile robots is a problem widely studied in a variety of elds, such as engineering, arti cial intelligence, arti cial life, robotics.
Generally, in these areas, the problem is studied mostly from an empirical point of view. Recently, a signi cant research e ort 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.
robots. |
|---|