Characterizing the Computational Power of Anonymous Mobile Robots
暂无分享,去创建一个
[1] Nicola Santoro,et al. Exploring an unknown dangerous graph using tokens , 2013, Theor. Comput. Sci..
[2] Masafumi Yamashita,et al. Pattern Formation through Optimum Matching by Oblivious CORDA Robots , 2010, OPODIS.
[3] Alfredo Navarra,et al. Gathering on rings under the Look–Compute–Move model , 2014, Distributed Computing.
[4] Alfredo Navarra,et al. Optimal Gathering of Oblivious Robots in Anonymous Graphs , 2013, SIROCCO.
[5] Avik Chatterjee,et al. Gathering Asynchronous Swarm Robots under Nonuniform Limited Visibility , 2015, ICDCIT.
[6] Paola Flocchini. Computations by Luminous Robots , 2015, ADHOC-NOW.
[7] Paola Flocchini,et al. Remembering without memory: Tree exploration by asynchronous oblivious robots , 2010, Theor. Comput. Sci..
[8] Nicola Santoro,et al. Gathering of asynchronous robots with limited visibility , 2005, Theor. Comput. Sci..
[9] Nicola Santoro,et al. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots , 2008, Theor. Comput. Sci..
[10] David Peleg,et al. Distributed Models and Algorithms for Mobile Robot Systems , 2007, SOFSEM.
[11] Mattia D'Emidio,et al. Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs , 2016, ICTCS.
[12] Alfredo Navarra,et al. Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points , 2014, ALGOSENSORS.
[13] Sayaka Kamei,et al. Randomized Gathering of Mobile Robots with Local-Multiplicity Detection , 2009, SSS.
[14] Nicola Santoro,et al. On the computational power of oblivious robots: forming a series of geometric patterns , 2010, PODC '10.
[15] Friedhelm Meyer auf der Heide,et al. A tight runtime bound for synchronous gathering of autonomous robots with limited visibility , 2011, SPAA '11.
[16] Nicola Santoro,et al. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots , 2007, Algorithmica.
[17] Nicola Santoro,et al. Decontaminating a Network from a Black Virus , 2014, Int. J. Netw. Comput..
[18] Franck Petit,et al. Leader Election Problem versus Pattern Formation Problem , 2010, DISC.
[19] Ajoy Kumar Datta,et al. Ring Exploration by Oblivious Agents with Local Vision , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.
[20] Alfredo Navarra,et al. Optimal Gathering on Infinite Grids , 2014, SSS.
[21] Yukiko Yamauchi,et al. Pattern Formation by Oblivious Asynchronous Mobile Robots , 2015, SIAM J. Comput..
[22] David Peleg,et al. Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges , 2005, IWDC.
[23] Nicola Santoro,et al. Autonomous mobile robots with lights , 2016, Theor. Comput. Sci..
[24] Yukiko Yamauchi,et al. Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots , 2012, DISC.
[25] Alfredo Navarra,et al. Graph Decomposition for Memoryless Periodic Exploration , 2011, Algorithmica.
[26] Andrzej Pelc,et al. How to meet when you forget: log-space rendezvous in arbitrary graphs , 2010, Distributed Computing.
[27] Alfredo Navarra,et al. MinMax-Distance Gathering on Given Meeting Points , 2015, CIAC.
[28] Jérémie Chalopin,et al. Anonymous Graph Exploration with Binoculars , 2015, DISC.
[29] Mattia D'Emidio,et al. Explore and repair graphs with black holes using mobile entities , 2015, Theor. Comput. Sci..
[30] Nicola Santoro,et al. Distributed Computing by Oblivious Mobile Robots , 2012, Synthesis Lectures on Distributed Computing Theory.
[31] Sébastien Tixeuil,et al. Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection , 2012, MFCS.
[32] Sébastien Tixeuil,et al. Gathering of Mobile Robots Tolerating Multiple Crash Faults , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.
[33] Sébastien Tixeuil,et al. Optimal probabilistic ring exploration by semi-synchronous oblivious robots , 2013, Theor. Comput. Sci..
[34] Evangelos Kranakis,et al. Rendezvous of Many Agents with Different Speeds in a Cycle , 2015, ADHOC-NOW.
[35] Alfredo Navarra,et al. About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings , 2015, IWOCA.
[36] Colin Cooper,et al. Locating and Repairing Faults in a Network with Mobile Agents , 2008, SIROCCO.
[37] Euripides Markou,et al. Gathering asynchronous oblivious mobile robots in a ring , 2008, Theor. Comput. Sci..
[38] Paul A. Beardsley,et al. Collision avoidance for aerial vehicles in multi-agent scenarios , 2015, Auton. Robots.