Ring Exploration by Oblivious Agents with Local Vision

  title={Ring Exploration by Oblivious Agents with Local Vision},
  author={Ajoy Kumar Datta and Anissa Lamani and Lawrence L. Larmore and Franck Petit},
  journal={2013 IEEE 33rd International Conference on Distributed Computing Systems},
The problem of exploring a discrete environment by identical oblivious asynchronous agents (or robots) devoid of direct means of communication has been well investigated so far. The (terminating) exploration requires that starting from a configuration where no two agents occupy the same node, every node needs to be visited by at least one agent, with the additional constraint that all agents eventually stop moving. Agents have sensors that allow them to see their environment and move… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-7 of 7 extracted citations

Enabling Ring Exploration with Myopic Oblivious Robots

2015 IEEE International Parallel and Distributed Processing Symposium Workshop • 2015
View 5 Excerpts
Highly Influenced

Asynchronous Ring Gathering by Oblivious Robots with Limited Vision

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops • 2014
View 5 Excerpts
Method Support
Highly Influenced

"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems

2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS) • 2018

Characterizing the Computational Power of Anonymous Mobile Robots

2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS) • 2016


Publications referenced by this paper.
Showing 1-10 of 19 references

Distributed Computing by Oblivious Mobile Robots

Synthesis Lectures on Distributed Computing Theory • 2012
View 1 Excerpt