Circle formation for oblivious anonymous mobile robots with no common sense of orientation
Authors:
Open Access
- 30 October 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 97-104
Abstract
This paper proposes a distributed algorithm by which a collection of mobile robots roaming on a plane move to form a circle. The algorithm operates under the premises that robots (1) are unable to recall past actions and observations (i.e., oblivious), (2) cannot be distinguished from each others (i.e., anonymous), (3) share no common sense of direction, and (4) are unable to communicate in any other ways than by observing each others position.Keywords
This publication has 9 references indexed in Scilit:
- Ant-like task allocation and recruitment in cooperative robotsNature, 2000
- Self-Stabilization2000
- Distributed Anonymous Mobile Robots: Formation of Geometric PatternsSIAM Journal on Computing, 1999
- Distributed memoryless point convergence algorithm for mobile robots with limited visibilityIEEE Transactions on Robotics and Automation, 1999
- Cooperative Mobile Robotics: Antecedents and DirectionsAutonomous Robots, 1997
- Distributed algorithms for formation of geometric patterns with many mobile robotsJournal of Robotic Systems, 1996
- Technical correspondenceCommunications of the ACM, 1995
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- A simple algorithm for computing the smallest enclosing circleInformation Processing Letters, 1991