publication . Part of book or chapter of book . Preprint . 2017

mutual visibility by robots with persistent memory

Bhagat, Subhash; Mukhopadhyaya, Krishnendu;
Open Access
  • Published: 09 Aug 2017
  • Publisher: Springer International Publishing
Abstract
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. The mutual visibility problem asks the robots to coordinate their movements to form a configuration, within finite time and without collision, in which no three robots are collinear. Robots are endowed with a constant bits of persistent memory. In this work, we consider the FSTATE computational model in which the persistent memory is used by the robots only to remember their previous internal state...
Subjects
arXiv: Computer Science::Robotics
free text keywords: Finite time, Euclidean geometry, Collision, Artificial intelligence, business.industry, business, Computer vision, Swarm robotics, Robot, Distributed algorithm, Computer science, Visibility, Computer Science - Distributed, Parallel, and Cluster Computing
Related Organizations
Download fromView all 2 versions
http://arxiv.org/pdf/1708.0282...
Part of book or chapter of book
Provider: UnpayWall
http://link.springer.com/conte...
Part of book or chapter of book
Provider: Crossref
24 references, page 1 of 2

[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. [OpenAIRE]

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

[11] J. Czyzowicz, L. Gasieniec, and A. Pelc. Gathering few fat mobile robots in the plane. Theoretical Computer Science, 410(67): pages 481-499, 2009. [OpenAIRE]

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

[13] S. Das, P. Flocchini, G. Prencipe, N. Santoro, and M. Yamashita. Synchronized dancing of oblivious chameleons. In Proc. 7th Int. Conf. on FUN with Algorithms (FUN), 2014. [OpenAIRE]

[14] S. Bhagat, S. Gan Chaudhuri and K. Mukhopadhyaya. Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement. In Proc. 10th International Workshop on Algorithms and Computation (WALCOM), pages 80-91, 2016.

[15] R. Vaidyanathan, C. Busch, J. L. Trahan, G. Sharma and S. Rai. Logarithmic-time complete visibility for robots with lights. In Proc. Parallel and Distributed Processing Symposium (IPDPS), pages 375-384, 2015.

24 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue