A simple algorithm for computing the smallest enclosing circle
Information Processing Letters
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Self-stabilization
Cooperative Mobile Robotics: Antecedents and Directions
Autonomous Robots
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]
Flocking by a Set of Autonomous Mobile Robots
Flocking by a Set of Autonomous Mobile Robots
Communications of the ACM
Decomposition of Fundamental Problems for Cooperative Autonomous Mobile Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Circle formation of weak robots and Lyndon words
Information Processing Letters
Theoretical Computer Science
Local spreading algorithms for autonomous robot systems
Theoretical Computer Science
Self-deployment of mobile sensors on a ring
Theoretical Computer Science
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
Circle formation of weak mobile robots
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A geometric approach to deploying robot swarms
Annals of Mathematics and Artificial Intelligence
Self-stabilizing robot formations over unreliable networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Theoretical Computer Science
Deaf, Dumb, and Chatting Asynchronous Robots
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Circle formation of weak mobile robots
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Robots and demons: the code of the origins
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Swing words to make circle formation quiescent
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A distributed formation algorithm to organize agents with no coordinate agreement
ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Deterministic leader election in anonymous sensor networks without common coordinated system
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Leader election problem versus pattern formation problem
DISC'10 Proceedings of the 24th international conference on Distributed computing
RoboCast: asynchronous communication in robot networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Energy-efficient strategies for building short chains of mobile robots locally
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Convergence of autonomous mobile robots with inaccurate sensors and movements
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Local algorithms for autonomous robot systems
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed coordination algorithms for mobile robot swarms: new directions and challenges
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Biangular circle formation by asynchronous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Self-stabilizing gathering with strong multiplicity detection
Theoretical Computer Science
Self-deployment algorithms for mobile sensors on a ring
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Local, self-organizing strategies for robotic formation problems
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Circle formation by asynchronous fat robots with limited visibility
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Survey: A survey on relay placement with runtime and approximation guarantees
Computer Science Review
Continuous local strategies for robotic formation problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Deterministic geoleader election in disoriented anonymous systems
Theoretical Computer Science
Energy-efficient strategies for building short chains of mobile robots locally
Theoretical Computer Science
| Hi-index | 0.01 |
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.