Gathering of Opaque Robots in 3D Space
作者： Subhash Bhagat , Sruti Gan Chaudhuri , Krishnendu Mukhopadyaya
关键词: Euclidean space 、 Swarm robotics 、 Distributed computing 、 Fault model 、 Mobile robot 、 Asynchronous communication 、 Robot 、 Distributed algorithm 、 Computer science 、 Visibility (geometry)
摘要: Gathering is a fundamental coordination problem for multi-robot systems. This paper presents study of the gathering set oblivious, autonomous mobile robots in three dimensional Euclidean space, under obstructed visibility model. In this model, are considered to be opaque. Robots may not have complete view configuration. assumes only an agreement on direction and orientation one coordinate axis. A distributed algorithm proposed solve asynchronous robots, when system does contain any faulty robot. Another presented semi-synchronous crash fault The can tolerate arbitrary number faults. Both algorithms work initial robot
acm.org
sci-hub.se 参考文章(28)
Paola Flocchini, Federico Poloni, Giovanni Viglietta, Nicola Santoro, Giuseppe Antonio Di Luna, The Mutual Visibility Problem for Oblivious Robots canadian conference on computational geometry. pp. 348- 354 ,(2014)
S. Bhagat, S. Gan Chaudhuri, K. Mukhopadhyaya, Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement Journal of Discrete Algorithms. ,vol. 36, pp. 50- 62 ,(2016) , 10.1016/J.JDA.2015.10.005
Andrzej Pelc, DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results Lecture Notes in Computer Science. pp. 1- 15 ,(2011) , 10.1007/978-3-642-24100-0_1
David Peleg, Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges Distributed Computing – IWDC 2005. pp. 1- 12 ,(2005) , 10.1007/11603771_1
Xavier Défago, Maria Gradinariu, Stéphane Messika, Philippe Raipin-Parvédy, Fault-Tolerant and Self-stabilizing Mobile Robots Gathering Lecture Notes in Computer Science. ,vol. 4167, pp. 46- 60 ,(2006) , 10.1007/11864219_4
Shuji Kijima, Masafumi Yamashita, Yukiko Yamauchi, Taichi Uehara, Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space Journal of the ACM. ,vol. 64, pp. 16- ,(2017) , 10.1145/3060272
Jurek Czyzowicz, Leszek Ga̧sieniec, Andrzej Pelc, Gathering few fat mobile robots in the plane Theoretical Computer Science. ,vol. 410, pp. 481- 499 ,(2009) , 10.1016/J.TCS.2008.10.005
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Distributed Computing by Oblivious Mobile Robots ,(2012)
Noa Agmon, David Peleg, Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots SIAM Journal on Computing. ,vol. 36, pp. 56- 82 ,(2006) , 10.1137/050645221
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra, Gathering of robots on anonymous grids and trees without multiplicity detection Theoretical Computer Science. ,vol. 610, pp. 158- 168 ,(2016) , 10.1016/J.TCS.2014.06.045