Circle formation by asynchronous fat robots with limited visibility

Authors:
Ayan Dutta;Sruti Gan Chaudhuri;Suparno Datta;Krishnendu Mukhopadhyaya
Affiliations:
Computer Science and Engineering Department, Heritage Institute of Technology, Kolkata, India;Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata, India;Computer Science and Engineering Department, Heritage Institute of Technology, Kolkata, India;Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata, India
Venue:
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Year:
2012

Citing 12
Cited 1

Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

SIAM Journal on Computing
Circle formation for oblivious anonymous mobile robots with no common sense of orientation

Proceedings of the second ACM international workshop on Principles of mobile computing
Cooperative Mobile Robotics: Antecedents and Directions

Autonomous Robots
Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Set of Autonomous Mobile Robots

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Gathering of Asynchronous Oblivious Robots with Limited Visibility

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity

Theoretical Computer Science
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Gathering few fat mobile robots in the plane

Theoretical Computer Science
Distributed algorithms for partitioning a swarm of autonomous mobile robots

Theoretical Computer Science
Gathering asynchronous transparent fat robots

ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Pheromone robotics and the logic of virtual pheromones

SAB'04 Proceedings of the 2004 international conference on Swarm Robotics
Biangular circle formation by asynchronous mobile robots

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity

A distributed algorithm for gathering many fat mobile robots in the plane

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a distributed algorithm for circle formation by multiple autonomous mobile robots. The vision of each robot is limited to a maximum distance. The robots do not store past actions or records of past data. They are anonymous and cannot be distinguished by their appearances. All robots agree on a common origin and axes. Earlier works report algorithms for gathering of multiple autonomous mobile robots in limited visibility considering the robots to be dimensionless or points. This paper models a robot as a unit disc (fat robot). The algorithm presented in this paper also assures that there is no collision among the robots. The robots do not share a common clock. They execute the algorithm asynchronously.