A New Approach for Analyzing Convergence Algorithms for Mobile Robots
暂无分享,去创建一个
Friedhelm Meyer auf der Heide | Matthias Fischer | Sven Kurras | Peter Kling | Marcus Märtens | Daniel Wonisch | Bastian Degener | Barbara Kempkes | Alexander Klaas | Andreas Cord-Landwehr | Martina Eikel | Christoph Raupach | Kamil Swierkot | Daniel Warner | Christoph Weddemann
[1] Reuven Cohen,et al. Robot Convergence via Center-of-Gravity Algorithms , 2004, SIROCCO.
[2] Sonia Mart́ınez. Practical multiagent rendezvous through modified circumcenter algorithms , 2009, Autom..
[3] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[4] Friedhelm Meyer auf der Heide,et al. Collisionless Gathering of Robots with an Extent , 2011, SOFSEM.
[5] Masafumi Yamashita,et al. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 1999, SIAM J. Comput..
[6] Sayaka Kamei,et al. Randomized Gathering of Mobile Robots with Local-Multiplicity Detection , 2009, SSS.
[7] Yoshiaki Katayama,et al. Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result , 2007, DISC.
[8] Noa Agmon,et al. Fault-tolerant gathering algorithms for autonomous mobile robots , 2004, SODA '04.
[9] Reuven Cohen,et al. Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems , 2005, SIAM J. Comput..
[10] Alan M. Frieze,et al. The Cover Times of Random Walks on Hypergraphs , 2011, SIROCCO.
[11] Reuven Cohen,et al. Local spreading algorithms for autonomous robot systems , 2008, Theor. Comput. Sci..
[12] Giuseppe Prencipe,et al. CORDA : distributed coordination of a set of autonomous mobile robots , 2001 .
[13] Marko Vukolic,et al. SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings , 2011, SOFSEM.
[14] Friedhelm Meyer auf der Heide,et al. A local O(n2) gathering algorithm , 2010, SPAA '10.
[15] Masafumi Yamashita,et al. A Theory of Distributed Anonymous Mobile Robots Formation and Agreement Problems. , 1994 .
[16] Euripides Markou,et al. Gathering asynchronous oblivious mobile robots in a ring , 2008, Theor. Comput. Sci..
[17] Giuseppe Prencipe,et al. Impossibility of gathering by a set of autonomous mobile robots , 2007, Theor. Comput. Sci..
[18] Andrzej Pelc,et al. Gathering few fat mobile robots in the plane , 2009, Theor. Comput. Sci..
[19] Nicola Santoro,et al. Gathering of Asynchronous Oblivious Robots with Limited Visibility , 2001, STACS.
[20] Masafumi Yamashita,et al. Formation and agreement problems for synchronous mobile robots with limited visibility , 1995, Proceedings of Tenth International Symposium on Intelligent Control.
[21] Franck Petit,et al. Self-stabilizing Deterministic Gathering , 2009, ALGOSENSORS.
[22] Christian Scheideler,et al. Stabilization, Safety, and Security of Distributed Systems , 2012, Lecture Notes in Computer Science.
[23] Xavier Défago,et al. Gathering Asynchronous Mobile Robots with Inaccurate Compasses , 2006, OPODIS.
[24] Nicola Santoro,et al. Solving the Robots Gathering Problem , 2003, ICALP.