Distributed Computing by Oblivious Mobile Robots
Authors:
- Paola FlocchiniPFPaola Flocchini
- Giuseppe PrencipeGPGiuseppe Prencipe
- Nicola SantoroNSNicola Santoro
Top Cited Papers
- 27 August 2012
- journal article
- Published by Springer Nature in Synthesis Lectures on Distributed Computing Theory
- Vol. 3 (2) , 1-185
Abstract
The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed compu...Keywords
This publication has 114 references indexed in Scilit:
- Self-stabilizing gathering with strong multiplicity detectionTheoretical Computer Science, 2012
- Computing Without Communicating: Ring Exploration by Asynchronous Oblivious RobotsAlgorithmica, 2012
- Fault-tolerant flocking for a group of autonomous mobile robotsJournal of Systems and Software, 2011
- The projection median of a set of pointsComputational Geometry, 2009
- Gathering few fat mobile robots in the planeTheoretical Computer Science, 2009
- Circle formation of weak mobile robotsACM Transactions on Autonomous and Adaptive Systems, 2008
- Local spreading algorithms for autonomous robot systemsTheoretical Computer Science, 2008
- Gathering asynchronous oblivious mobile robots in a ringTheoretical Computer Science, 2008
- Impossibility of gathering by a set of autonomous mobile robotsTheoretical Computer Science, 2007
- Experiments in automatic flock controlRobotics and Autonomous Systems, 2000