Self-stabilizing Deterministic Gathering
作者： Yoann Dieudonné , Franck Petit
DOI: 10.1007/978-3-642-05434-1_23
关键词:
摘要: In this paper, we investigate the possibility to deterministically solve gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, oblivious, deaf, and dumb). We introduce strong multiplicity detection as ability for detect exact number of located at a given position. show that detection, there exists deterministic self-stabilizing algorithm solving GP n if, only is odd.
harvard.edu
springer.com
archives-ouvertes.fr
sci-hub.st 参考文章(24)
Masafumi Yamashita, Ichiro Suzuki, Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]. pp. 305- 321 ,(1996)
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
Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Nicola Santoro, Cindy Sawchuk, Multiple Mobile Agent Rendezvous in a Ring latin american symposium on theoretical informatics. pp. 599- 608 ,(2004) , 10.1007/978-3-540-24698-5_62
Mark Cieliebak, Gathering Non-oblivious Mobile Robots latin american symposium on theoretical informatics. pp. 577- 588 ,(2004) , 10.1007/978-3-540-24698-5_60
Matthew Hennessy, Robin Milner, On Observing Nondeterminism and Concurrency international colloquium on automata, languages and programming. pp. 299- 309 ,(1980) , 10.1007/3-540-10003-2_79
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Solving the robots gathering problem international colloquium on automata languages and programming. pp. 1181- 1196 ,(2003) , 10.1007/3-540-45061-0_90
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
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Gathering of asynchronous robots with limited visibility Theoretical Computer Science. ,vol. 337, pp. 147- 168 ,(2005) , 10.1016/J.TCS.2005.01.001
Samia Souissi, Xavier Défago, Masafumi Yamashita, Using eventually consistent compasses to gather memory-less mobile robots with limited visibility ACM Transactions on Autonomous and Adaptive Systems. ,vol. 4, pp. 1- 27 ,(2009) , 10.1145/1462187.1462196
Chrystal, On the problem to construct the minimum circle enclosing n given points in a plane Proceedings of the Edinburgh Mathematical Society. ,vol. 3, pp. 30- 33 ,(1884) , 10.1017/S0013091500037238