Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
作者： Yoshiaki Katayama , Yuichi Tomida , Hiroyuki Imazu , Nobuhiro Inuzuka , Koichi Wada
DOI: 10.1007/978-3-540-72951-8_22
关键词: Point (geometry) 、 Mobile robot 、 Robot 、 Asynchronous communication 、 Single point 、 Computer science 、 Algorithm 、 Compass
摘要: This paper studies a gathering problem for system of asynchronous autonomous mobile robots that can move freely in two-dimensional plane. We consider equipped with inaccurate (incorrect) compasses which may point different direction from other robots' compasses. A is the are required to eventually gather at single not given advance any initial configuration. In this paper, we propose several compass models and give two algorithms solve on these models. One algorithm first result dealing whose indicated change every beginning execution cycles robots. It solves when most π/8 (absolute) north. The one never its pointed their difference π/3 among
springer.com
sci-hub.st 参考文章(15)
Xavier Defago, Stéphane Messika, Philippe Raipin-Parvedy, Maria Gradinariu, Fault-tolerant and Self-stabilizing Mobile Robots Gathering - Feasibility Study - Lecture Notes in Computer Science. ,vol. 4167, pp. 46- 60 ,(2006)
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
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
Samia Souissi, Xavier Défago, Masafumi Yamashita, Using eventually consistent compasses to gather oblivious mobile robots with limited visibility international conference on stabilization safety and security of distributed systems. pp. 484- 500 ,(2006) , 10.1007/978-3-540-49823-0_34
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Gathering of Asynchronous Oblivious Robots with Limited Visibility symposium on theoretical aspects of computer science. pp. 247- 258 ,(2001) , 10.1007/3-540-44693-1_22
Giuseppe Prencipe, On the Feasibility of Gathering by Autonomous Mobile Robots Structural Information and Communication Complexity. pp. 246- 261 ,(2005) , 10.1007/11429647_20
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
David Peleg, Noa Agmon, Fault-tolerant gathering algorithms for autonomous mobile robots symposium on discrete algorithms. pp. 1070- 1078 ,(2004) , 10.5555/982792.982951
Ichiro Suzuki, Masafumi Yamashita, Distributed Anonymous Mobile Robots: Formation of Geometric Patterns SIAM Journal on Computing. ,vol. 36, pp. 279- 280 ,(2006) , 10.1137/050631562