Mutual Visibility by Robots with Persistent Memory

Preprint English OPEN
Bhagat, Subhash; Mukhopadhyaya, Krishnendu;
(2017)
  • Subject: Computer Science - Distributed, Parallel, and Cluster Computing
    arxiv: Computer Science::Robotics

This paper addresses the mutual visibility problem for a set of semi-synchronous, opaque robots occupying distinct positions in the Euclidean plane. Since robots are opaque, if three robots lie on a line, the middle robot obstructs the visions of the two other robots. T... View more
  • References (24)
    24 references, page 1 of 3

    [1] G. Prencipe. Instantaneous actions vs. full asynchronicity: Controlling and coordinating a set of autonomous mobile robots. In Proc. 7th Italian Conference on Theoretical Computer Science, pages 154-171, 2001.

    [2] I. Suzuki and M. Yamashita. Formation and agreement problems for anonymous mobile robots. In Proc. 31st Annual Conference on Communication, Control and Computing, pages 93-102, 1993.

    [3] X. Defago, M. Gradinariu, S. Messika and P. RaipinParvedy. Fault-tolerant and self-stabilizing mobile robots gathering. In Proc. 20th International Symposium on Distributed Computing, pages 46-60. 2006.

    [4] S. Das, P. Flocchini, G. Prencipe, N. Santoro, M. Yamashita. The power of lights: synchronizing asynchronous robots using visible bits. In Proc. 32nd International Conference on Distributed Computing Systems (ICDCS), pages 506-515, 2012.

    [5] C. Agathangelou, C. Georgiou, and M. Mavronicolas. A distributed algorithm for gathering many fat mobile robots in the plane. In Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC), pages 250-259, 2013.

    [6] G. Antonio Di Luna, P. Flocchini, S. Gan Chaudhuri, N. Santoro, and G. Viglietta. Robots with Lights: Overcoming Obstructed Visibility Without Colliding. In Proc. 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'14), pages 150-164, 2014.

    [7] G. Antonio Di Luna, P. Flocchini, F. Poloni,, N. Santoro, and G. Viglietta. The Mutual Visibility Problem for Oblivious Robots. In Proc. 26th Canadian Conference on Computational Geometry (CCCG'14), 2014.

    [8] H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita, Distributed memoryless point convergence algorithm for mobile robots with limited visibility. In Robotics and Automation, IEEE Transactions, vol.15, pages 818-828, 1999.

    [9] K. Bolla, T. Kovacs, and G.Fazekas. Gathering of fat robots with limited visibility and without global navigation. In Int. Symp. on Swarm and Evolutionary Comp., pages 30-38, 2012.

    [10] R.Cohen and D.Peleg. Local spreading algorithms for autonomous robot systems. Theoretical Computer Science, 399: pages 71-82, 2008.

  • Metrics
Share - Bookmark