Distributed Computing by Mobile Robots: Gathering

@article{Cieliebak2012DistributedCB,
  title={Distributed Computing by Mobile Robots: Gathering},
  author={Mark Cieliebak and Paola Flocchini and Giuseppe Prencipe and Nicola Santoro},
  journal={SIAM J. Comput.},
  year={2012},
  volume={41},
  pages={829-879}
}
Consider a set of n > 2 identical mobile computational entities in the plane, called robots, operating in Look-Compute-Move cycles, without any means of direct communication. The Gathering Problem is the primitive task of all entities gathering in finite time at a point not fixed in advance, without any external control. The problem has been extensively studied in the literature under a variety of strong assumptions (e.g., synchronicity of the cycles, instantaneous movements, complete memory of… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 70 extracted citations

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

2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS) • 2018
View 6 Excerpts
Highly Influenced

Distributed Computing and Internet Technology

Lecture Notes in Computer Science • 2015
View 10 Excerpts
Highly Influenced

References

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

Rendezvous Without Coordinates

IEEE Transactions on Automatic Control • 2008
View 7 Excerpts
Highly Influenced

The multi-agent rendezvous problem - the asynchronous case

2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) • 2004
View 10 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…