乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T20:33:59Z","timestamp":1724531639067},"reference-count":129,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Synthesis Lectures on Distributed Computing Theory"],"published-print":{"date-parts":[[2012,8,27]]},"DOI":"10.2200\/s00440ed1v01y201208dct010","type":"journal-article","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T18:21:41Z","timestamp":1346178101000},"page":"1-185","source":"Crossref","is-referenced-by-count":91,"title":["Distributed Computing by Oblivious Mobile Robots"],"prefix":"10.1007","volume":"3","author":[{"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Prencipe","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1137\/050645221"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/70.795787"},{"key":"p_5","doi-asserted-by":"crossref","unstructured":"H. Ando, I. Suzuki, and M. Yamashita. Formation and agreement problems for synchronous mobile robots with limited visibility. InProceedings of the 1995 IEEE Symposium on Intelligent Control, pages453-460, 1995. DOI: 10.1109\/ISIC.1995.525098 Cited on page(s) 38, 65 10.1109\/ISIC.1995.525098","DOI":"10.1109\/ISIC.1995.525098"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1177\/027836498900800406"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187906"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1109\/70.736776"},{"key":"p_9","doi-asserted-by":"crossref","unstructured":"R. Baldoni, F. Bonnet, A. Milani, and M. Raynal. On the solvability of anonymous partial grids exploration by mobile robots. InProceedings of 12thInternational Conference on Principles of Distributed Systems (OPODIS), pages428-445, 2008. DOI: 10.1007\/978-3-540-92221-6_27 Cited on page(s) 152 10.1007\/978-3-540-92221-6_27","DOI":"10.1007\/978-3-540-92221-6_27"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008295"},{"key":"p_11","doi-asserted-by":"crossref","unstructured":"L. Blin, A. Milani, M. Potop-Butucaru, and S. Tixeuil. Exclusive perpetual ring exploration without chirality. InProceedings of 24thInternational Symposium on Distributed Computing (DISC), pages312-327, 2010. DOI: 10.1007\/978-3-642-15763-9_29 Cited on page(s) 151 10.1007\/978-3-642-15763-9_29","DOI":"10.1007\/978-3-642-15763-9_29"},{"key":"p_12","doi-asserted-by":"crossref","unstructured":"F. Bonnet, X. D\u00e9fago, F. Petit, M. Gradinariu Potop-Butucaru, and S. Tixeuil. Brief announcement: Discovering and assessing fine-grained metrics in robot networks protocols. InProceedings of the 14thInternational Conference on Stabilization, Safety, and Security in Distributed Systems (SSS), 2012. Cited on page(s) 152","DOI":"10.1007\/978-3-642-33536-5_28"},{"key":"p_13","doi-asserted-by":"crossref","unstructured":"F. Bonnet, A. Milani, M. Potop-Butucaru, and S. Tixeuil. Asynchronous exclusive perpetual grid exploration without sense of direction. InProceedings of 15thInternational Conference on Principles of Distributed Systems (OPODIS), pages251-265, 2011. DOI: 10.1007\/978-3-642-25873-2_18 Cited on page(s) 152 10.1007\/978-3-642-25873-2_18","DOI":"10.1007\/978-3-642-25873-2_18"},{"key":"p_15","doi-asserted-by":"crossref","unstructured":"Z. Bouzid and A. Lamani. Robot networks with homonyms: The case of patterns formation. InProceedings of 13thInternational Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pages92-107, 2011. DOI: 10.1007\/978-3-642-24550-3_9 Cited on page(s) 101 10.1007\/978-3-642-24550-3_9","DOI":"10.1007\/978-3-642-24550-3_9"},{"key":"p_16","doi-asserted-by":"crossref","unstructured":"Z. Bouzid, M. Gradinariu Potop-Butucaru, and S. Tixeuil. Byzantine convergence in robot networks: The price of asynchrony. InProceedings of 13thInternational Conference Principles of Distributed Systems (OPODIS), pages54-70, 2009. DOI: 10.1007\/978-3-642-10877-8_7 Cited on page(s) 61, 63 10.1007\/978-3-642-10877-8_7","DOI":"10.1007\/978-3-642-10877-8_7"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.006"},{"key":"p_18","doi-asserted-by":"crossref","unstructured":"F. Bullo, J. Cortes, and S. Martinez. Distributed Control of Robotic Networks. Princeton University Press, 2009. Cited on page(s)1","DOI":"10.1515\/9781400831470"},{"key":"p_19","doi-asserted-by":"crossref","unstructured":"D. Canepa and M. Gradinariu Potop-Butucaru. Stabilizing flocking via leader election in robot networks. InProceedings of 9thInternational Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pages52-66, 2007. DOI: 10.1007\/978-3-540-76627-8_7 Cited on page(s) 12, 117, 119, 128, 129, 130, 131, 132 10.1007\/978-3-540-76627-8_7","DOI":"10.1007\/978-3-540-76627-8_7"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1137\/070709906"},{"key":"p_22","doi-asserted-by":"crossref","unstructured":"J. Chalopin, P. Flocchini, B. Mans, and N. Santoro. Network exploration by silent and oblivious robots. InProceedings of 36thInternational Workshop on Graph Theoretic Concepts in Computer Science (WG), pages208-219, 2010. DOI: 10.1007\/978-3-642-16926-7_20 Cited on page(s) 3, 148, 149, 151 10.1007\/978-3-642-16926-7_20","DOI":"10.1007\/978-3-642-16926-7_20"},{"key":"p_23","doi-asserted-by":"crossref","unstructured":"I. Chatzigiannakis, M. Markou, and S. Nikoletseas. Distributed circle formation for anonymous oblivious robots. InProceedings of 3rdInternational Workshop on Experimental and Efficient Algorithms (WEA), pages159 -174, 2004. DOI: 10.1007\/978-3-540-24838-5_12 Cited on page(s) 3, 12, 65, 84 10.1007\/978-3-540-24838-5_12","DOI":"10.1007\/978-3-540-24838-5_12"},{"key":"p_24","doi-asserted-by":"crossref","unstructured":"S. G. Chaudhuri and K. Mukhopadhyaya. Gathering asynchronous transparent fat robots. InProceedings of 6thInternational Conference on Distributed Computing and Internet Technology (ICDCIT), pages170-175, 2010. DOI: 10.1007\/978-3-642-11659-9_17 Cited on page(s) 11, 143 10.1007\/978-3-642-11659-9_17","DOI":"10.1007\/978-3-642-11659-9_17"},{"key":"p_25","doi-asserted-by":"crossref","unstructured":"Q. Chen and J. Y. S. Luh. Coordination and control of a group of small mobile robots. InProceedings of 1994 IEEE International Conference on Robotics and Automation, pages2315-2320, 1994. DOI: 10.1109\/ROBOT.1994.350940 Cited on page(s) 117 10.1109\/ROBOT.1994.350940","DOI":"10.1109\/ROBOT.1994.350940"},{"key":"p_26","doi-asserted-by":"crossref","unstructured":"M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro. Solving the gathering problem. InProceedings of 30thInternational Colloquium on Automata, Languages and Programming (ICALP), pages1181-1196, 2003. Cited on page(s) 21, 25","DOI":"10.1007\/3-540-45061-0_90"},{"key":"p_27","doi-asserted-by":"crossref","unstructured":"M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro. Distributed computing by mobile robots: Gathering. SIAM Journal on Computing, 2012. Citedon page(s)21, 28, 34, 35","DOI":"10.1007\/978-3-031-02008-7"},{"key":"p_28","unstructured":"M. Cieliebak and G. Prencipe. Gathering autonomous mobile robots. InProceedings of 9thInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), pages57-72, 2002. Cited on page(s) 35, 55"},{"key":"p_29","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2006.08.001"},{"key":"p_30","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446475"},{"key":"p_31","doi-asserted-by":"crossref","unstructured":"R. Cohen and D. Peleg. Convergence of autonomous mobile robots with inaccurate sensors and movements. InProceedings of 23rdInternational Symposium on Theoretical Aspects of Computer Science (STACS), pages549-560, 2006. DOI: 10.1007\/11672142_45 Cited on page(s) 51, 52, 53, 54 10.1007\/11672142_45","DOI":"10.1007\/11672142_45"},{"key":"p_32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.007"},{"key":"p_33","doi-asserted-by":"crossref","unstructured":"A. Cord-Landwehr, B. Degener, M. Fischer, M. H\u00fcllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Mrtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, and D. Wonisch. Collision-less gathering of robots with an extent. InProceedings of 37thInternational Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pages178-189, 2011. Cited on page(s) 11, 143","DOI":"10.1007\/978-3-642-18381-2_15"},{"key":"p_34","doi-asserted-by":"crossref","unstructured":"A. Cord-Landwehr, B. Degener, M. Fischer, M. H\u00fcllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Mrtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, and D. Wonisch. A new approach for analyzing convergence algorithms for mobile robots. InProceedings of 38thInternational Colloquium on Automata, Languages and Programming (ICALP), pages650-661. Springer, 2011. DOI: 10.1007\/978-3-642-22012-8_52 Cited on page(s) 2710.1007\/978-3-642-22012-8_52","DOI":"10.1007\/978-3-642-22012-8_52"},{"key":"p_35","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.005"},{"key":"p_36","doi-asserted-by":"crossref","unstructured":"G. D'Angelo, G. Di Stefano, R. Klasing, and A. Navarra. Gathering of robots on anonymous grids without multiplicity detection. InProceedings of 19thInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), pages327-338, 2012. DOI: 10.1007\/978-3-642-31104-8_28 Cited on page(s) 148 10.1007\/978-3-642-31104-8_28","DOI":"10.1007\/978-3-642-31104-8_28"},{"key":"p_37","doi-asserted-by":"crossref","unstructured":"G. D'Angelo, G. Di Stefano, and A. Navarra. Gathering of six robots on anonymous symmetric rings. InProceedings of 18thInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), pages174-185, 2011. DOI: 10.1007\/978-3-642-22212-2_16 Cited on page(s) 147 10.1007\/978-3-642-22212-2_16","DOI":"10.1007\/978-3-642-22212-2_16"},{"key":"p_38","doi-asserted-by":"crossref","unstructured":"G. D'Angelo, G. Di Stefano, and A. Navarra. How to gather asynchronous oblivious robots on anonymous rings. In26thInternational Symposium on Distributed Computing, to appear, 2012. Cited on page(s) 147","DOI":"10.1007\/978-3-642-33651-5_23"},{"key":"p_39","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.011"},{"key":"p_40","doi-asserted-by":"crossref","unstructured":"S. Das, P. Flocchini, G. Prencipe, N. Santoro, and M. Yamashita. The power of lights: Synchronizing asynchronous robots using visible bits. InProceedings of 32ndInternational Conference on Distributed Computing Systems (ICDCS), 2012. (to appear). Cited on page(s) 9, 135, 136, 137, 138","DOI":"10.1109\/ICDCS.2012.71"},{"key":"p_41","doi-asserted-by":"crossref","unstructured":"S. Das, P. Flocchini, N. Santoro, and M. Yamashita. On the computational power of oblivious robots: forming a series of geometric patterns. InProceedings of 29thAnnual ACM Symposium on Principles of Distributed Computing (PODC), pages267-276, 2010. DOI: 10.1145\/1835698.1835761 Cited on page(s) 98, 99, 100, 101 10.1145\/1835698.1835761","DOI":"10.1145\/1835698.1835761"},{"key":"p_42","doi-asserted-by":"crossref","unstructured":"S. Das, E. Mesa-Barrameda, and N. Santoro. Deployment of asynchronous robotic sensors in unknown orthogonal environments. InProceedings of 4thInternational Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSOR), pages25-140, 2008. DOI: 10.1007\/978-3-540-92862-1_11 Cited on page(s) 3, 12, 113, 114, 115 10.1007\/978-3-540-92862-1_11","DOI":"10.1007\/978-3-540-92862-1_11"},{"issue":"38","key":"p_43","first-page":"115","volume":"2","author":"Debest X. A.","year":"1995","journal-title":"Communication of the ACM"},{"key":"p_44","doi-asserted-by":"crossref","unstructured":"X. D\u00e9fago, M. Gradinariu, S. Messika, and P. R. Parv\u00e9dy. Fault-tolerant and self-stabilizing mobile robots gathering. InProceedings of 20thInternational Symposium on Distributed Computing (DISC), pages46-60, 2006. DOI: 10.1007\/11864219_4 Cited on page(s) 9, 21, 25, 55, 59 10.1007\/11864219_4","DOI":"10.1007\/11864219_4"},{"key":"p_45","doi-asserted-by":"crossref","unstructured":"X. D\u00e9fago and A. Konagaya. Circle formation for oblivious anonymous mobile robots with no common sense of orientation. InProceedings of 2ndWorkshop on Principles of Mobile Computing, pages97-104, 2002. DOI: 10.1145\/584490.584509 Cited on page(s) 3, 12, 65, 84, 86 10.1145\/584490.584509","DOI":"10.1145\/584490.584509"},{"key":"p_46","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.050"},{"key":"p_47","doi-asserted-by":"crossref","unstructured":"B. Degener, B. Kempkes,T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and R. Wattenhofer. A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. InProceedings of 23rdACM Symposium on Parallelism in algorithms and architectures (SPAA), pages139-148, 2011. DOI: 10.1145\/1989493.1989515 Cited on page(s) 39 10.1145\/1989493.1989515","DOI":"10.1145\/1989493.1989515"},{"key":"p_48","doi-asserted-by":"crossref","unstructured":"S. Devismes. Optimal exploration of small rings. InProceedings of 3rdInternational Workshop on Reliability, Availability, and Security (WRAS), pages1-9, 2010. DOI: 10.1145\/1953563.1953571 Cited on page(s) 3, 150 10.1145\/1953563.1953571","DOI":"10.1145\/1953563.1953571"},{"key":"p_49","doi-asserted-by":"crossref","unstructured":"S. Devismes, A. Lamani, F. Petit, P. Raymond, and S. Tixeuil. Optimal grid exploration by asynchronous oblivious robots. InProceedings of 14thInternational Conference on Stabilization, Safety, and Security in Distributed Systems (SSS), 2012. (to appear). Cited on page(s) 151","DOI":"10.1007\/978-3-642-33536-5_7"},{"key":"p_50","doi-asserted-by":"crossref","unstructured":"S. Devismes, F. Petit, and S. Tixeuil. Optimal probabilistic ring exploration by semisynchronous oblivious robots. InProceedings of 16thInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), pages95-208, 2009. DOI: 10.1007\/978-3-642-11476-2_16 Cited on page(s) 150 10.1007\/978-3-642-11476-2_16","DOI":"10.1007\/978-3-642-11476-2_16"},{"key":"p_51","doi-asserted-by":"publisher","DOI":"10.1145\/1452001.1452006"},{"key":"p_52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.09.008"},{"key":"p_53","doi-asserted-by":"crossref","unstructured":"Y. Dieudonn\u00e9 and F. Petit. Squaring the circle with weak mobile robots. InProceedings of 19thInternational Symposium on Algorithms and Computation (ISAAC), pages354-365, 2008. DOI: 10.1007\/978-3-540-92182-0_33 Cited on page(s) 94 10.1007\/978-3-540-92182-0_33","DOI":"10.1007\/978-3-540-92182-0_33"},{"issue":"1","key":"p_54","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1142\/S0129626409000146","volume":"19","author":"Dieudonn\u00e9 Y.","year":"2009","journal-title":"Parallel Processing Letters"},{"key":"p_55","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.12.010"},{"key":"p_56","doi-asserted-by":"crossref","unstructured":"Y. Dieudonn\u00e9, F. Petit, and V. Villain. Leader election problem versus pattern formation problem. InProceedings of 24thInternational Symposium on Distributed Computing (DISC), pages267-281, 2010. DOI: 10.1007\/978-3-642-15763-9_26 Cited on page(s) 70, 71 10.1007\/978-3-642-15763-9_26","DOI":"10.1007\/978-3-642-15763-9_26"},{"key":"p_57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5695-3"},{"key":"p_58","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"p_59","doi-asserted-by":"crossref","unstructured":"S. Dolev. Self-Stabilization. The MIT Press, 2000. Citedon page(s)3, 11","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"p_61","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2008.06.006"},{"key":"p_62","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.11.023"},{"key":"p_63","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-010-0038-4"},{"key":"p_64","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.07.018"},{"key":"p_65","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.007"},{"key":"p_66","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9611-5"},{"key":"p_67","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.03.006"},{"key":"p_68","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14849-1"},{"key":"p_69","doi-asserted-by":"crossref","unstructured":"P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots. InProceedings of 10thInternational Symposium on Algorithms and Computation (ISAAC), pages93-102, 1999. DOI: 10.1007\/3-540-46632-0_10 Cited on page(s) 8 10.1007\/3-540-46632-0_10","DOI":"10.1007\/3-540-46632-0_10"},{"key":"p_70","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.01.001"},{"key":"p_71","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.026"},{"key":"p_72","unstructured":"N. Foukia, J. G. Hulaas, and J. Harms. Intrusion Detection with Mobile Agents. In Proceedings of 11thAnnual Conference of the Internet Society (INET 2001), 2001. http:\/\/www.isoc.org. Cited on page(s) 1"},{"key":"p_73","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2002.803458"},{"key":"p_74","doi-asserted-by":"crossref","unstructured":"N. Fujinaga, Y. Yamauchi, S. Kijima, and M. Yamashita. Asynchronous pattern formation by anonymous oblivious mobile robots. In26thInternational Symposium on Distributed Computing, to appear, 2012. Cited on page(s) 84","DOI":"10.1007\/978-3-642-33651-5_22"},{"key":"p_75","doi-asserted-by":"crossref","unstructured":"N. Fujinaga, H. Ono, S. Kijima, and M. Yamashita. Pattern formation through optimum matching by oblivious CORDA robots. InProceedings of 14thInternational Conference on Principles of Distributed Systems (OPODIS), pages1-15, 2010. DOI: 10.1007\/978-3-642-17653-1_1 Cited on page(s) 78, 80 10.1007\/978-3-642-17653-1_1","DOI":"10.1007\/978-3-642-17653-1_1"},{"key":"p_76","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2013493"},{"key":"p_77","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.11.010"},{"key":"p_78","doi-asserted-by":"crossref","unstructured":"V. Gervasi and G. Prencipe. Robotic cops: The intruder problem. InProceedings of the 2003 IEEE International Conference on Systems, Man, and Cybernetics, pages2284-2289, 2003. DOI: 10.1109\/ICSMC.2003.1244224 Cited on page(s) 84, 125, 126, 127 10.1109\/ICSMC.2003.1244224","DOI":"10.1109\/ICSMC.2003.1244224"},{"key":"p_79","unstructured":"V. Gervasi and G. Prencipe. On the efficient capture of dangerous criminals. InProceedings of 3rdInternational Conference on Fun With Algorithms, pages184-196, 2004. Cited on page(s) 126, 127"},{"key":"p_80","doi-asserted-by":"crossref","unstructured":"N. Gordon, Y. Elor, and A. M. Bruckstein. Gathering multiple robotic agents with crude distance sensing capabilities. InProceedings of 6thInternational Conference on Ant Colony Optimizatin and Swarm Intelligence, pages72-83, 2008. DOI: 10.1007\/978-3-540-87527-7_7 Cited on page(s) 51 10.1007\/978-3-540-87527-7_7","DOI":"10.1007\/978-3-540-87527-7_7"},{"key":"p_81","doi-asserted-by":"crossref","unstructured":"N. Gordon, I. A.Wagner, and A. M. Bruckstein. Gathering multiple robotic a(ge)nts with limited sensing capabilities. InProceedings of 2ndInternational Conference on Ant Colony Optimization and Swarm Intelligence, pages142-153, 2004. DOI: 10.1007\/978-3-540-28646-2_13 Cited on page(s) 1, 51 10.1007\/978-3-540-28646-2_13","DOI":"10.1007\/978-3-540-28646-2_13"},{"key":"p_82","doi-asserted-by":"crossref","unstructured":"S. Guilbault and A. Pelc. Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. InProceedings of 18thInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), pages162-173, 2011. DOI: 10.1007\/978-3-642-22212-2_15 Cited on page(s) 148 10.1007\/978-3-642-22212-2_15","DOI":"10.1007\/978-3-642-22212-2_15"},{"key":"p_83","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2004.838486"},{"key":"p_84","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019625207705"},{"key":"p_85","unstructured":"T.R. Hsiang, E. Arkin, M. A. Bender, S. Fekete, and J. Mitchell. Algorithms for rapidly dispersing robot swarms in unknown environments. InProceedings of 5thWorkshop on Algorithmic Foundations of Robotics (WAFR), pages77-94, 2002. Cited on page(s) 3, 12"},{"key":"p_86","doi-asserted-by":"crossref","unstructured":"T. Izumi, Z. Bouzid, S. Tixeuil, and K. Wada. Brief Announcement: The BG-simulation for Byzantine mobile robots. InProceedings of 25thInternational Symposium on Distributed Computing (DISC), pages330-331, 2011. DOI: 10.1007\/978-3-642-24100-0_32 Cited on page(s) 59 10.1007\/978-3-642-24100-0_32","DOI":"10.1007\/978-3-642-24100-0_32"},{"key":"p_87","doi-asserted-by":"crossref","unstructured":"T. Izumi, T. Izumi, S. Kamei, and F. Ooshita. Mobile robots gathering algorithm with local weak multiplicity in rings. InProceedings of 17thInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), pages101-113, 2010. DOI: 10.1007\/978-3-642-13284-1_9 Cited on page(s) 147 10.1007\/978-3-642-13284-1_9","DOI":"10.1007\/978-3-642-13284-1_9"},{"key":"p_88","doi-asserted-by":"crossref","unstructured":"T. Izumi, Y. Katayama, N. Inuzuka, and K. Wada. Gathering autonomous mobile robots with dynamic compasses: An optimal results. InProceedings of 21stInternational Symposium on Distributed Computing (DISC). Springer, 2007. DOI: 10.1007\/978-3-540-75142-7_24 Cited on page(s) 35, 36, 37 10.1007\/978-3-540-75142-7_24","DOI":"10.1007\/978-3-540-75142-7_24"},{"key":"p_89","doi-asserted-by":"crossref","unstructured":"T. Izumi, M. Gradinariu Potop-Butucaru, and S. Tixeuil. Connectivity-preserving scattering of mobile robots with limited visibility. InProceedings of 12thInternational Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pages319-331, 2010. DOI: 10.1007\/978-3-642-16023-3_27 Cited on page(s) 105 10.1007\/978-3-642-16023-3_27","DOI":"10.1007\/978-3-642-16023-3_27"},{"key":"p_90","doi-asserted-by":"publisher","DOI":"10.1137\/100797916"},{"key":"p_91","unstructured":"D. Jung, G. Cheng, and A. Zelinsky. Experiments in realising cooperation between autonomous mobile robots. InProceedings of 5th International Symposium on Experimental Robotics (ISER), pages513-524, 1997. Cited on page(s) 25"},{"key":"p_92","doi-asserted-by":"crossref","unstructured":"S. Kamei, A. Lamani, F. Ooshita, and S. Tixeuil. Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. InProceedings of 18thInt. Colloquium on Structural Information and Communication Complexity (SIROCCO), pages150-161, 2011. DOI: 10.1007\/978-3-642-22212-2_14 Cited on page(s) 147 10.1007\/978-3-642-22212-2_14","DOI":"10.1007\/978-3-642-22212-2_14"},{"key":"p_93","doi-asserted-by":"publisher","DOI":"10.1145\/1281492.1281497"},{"key":"p_94","doi-asserted-by":"publisher","DOI":"10.1002\/scj.20331"},{"key":"p_95","unstructured":"Y. Katayama, Y. Tomida, H. Imazu, N. Inuzuka, and K. Wada. Dynamic compass models and gathering algorithms for autonomous mobile robots. InProceedings of 14thColloquium"},{"key":"p_97","doi-asserted-by":"crossref","unstructured":"DOI: 10.1007\/978-3-540-72951-8_22 Cited on page(s) 1310.1007\/978-3-540-72951-8_22","DOI":"10.1007\/978-3-540-72951-8_22"},{"key":"p_98","doi-asserted-by":"crossref","unstructured":"B. Katreniak. Biangular circle formation by asynchronous mobile robots. InProceedings of 12thInternational Colloquium on Structural and Communication Complexity (SIROCCO), pages185-199, 2005. DOI: 10.1007\/11429647_16 Cited on page(s) 3, 12, 65, 84, 87, 88, 89 10.1007\/11429647_16","DOI":"10.1007\/11429647_16"},{"key":"p_99","doi-asserted-by":"crossref","unstructured":"B. Katreniak. Convergence with limited visibility by asynchronous mobile robots. InProceedings of 18thInt. Colloquium on Structural Information and Communication Complexity (SIROCCO), pages125-137, 2011. DOI: 10.1007\/978-3-642-22212-2_12 Cited on page(s) 41, 42 10.1007\/978-3-642-22212-2_12","DOI":"10.1007\/978-3-642-22212-2_12"},{"key":"p_100","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.020"},{"key":"p_101","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.09.032"},{"key":"p_102","first-page":"55","volume":"6","author":"Kupitz Y.","year":"1997","journal-title":"Intuitive Geometry"},{"key":"p_103","unstructured":"A. Lamani, S. Kamei, F. Ooshita, and S. Tixeuil. Gathering an even number of robots in a symmetric ring without global multiplicity detection. InProceedings of 37thInternational Conference on Mathematical Foundations of Computer Science (MFCS), 2012. (to appear). Cited on page(s) 147"},{"key":"p_104","doi-asserted-by":"crossref","unstructured":"A. Lamani, M. Gradinariu Potop-Butucaru, and S. Tixeuil. Optimal deterministic ring exploration with oblivious asynchronous robots. InProceedings of 17thInt. Colloquium on Structural Information and Communication Complexity (SIROCCO), pages183-196, 2010. DOI: 10.1007\/978-3-642-13284-1_15 Cited on page(s) 3, 151 10.1007\/978-3-642-13284-1_15","DOI":"10.1007\/978-3-642-13284-1_15"},{"key":"p_105","doi-asserted-by":"crossref","unstructured":"X. Li, M. F. Ercan, and Y. F. Fung. Decentralized control for swarm flocking in 3d space. InProceedings of 2ndInternational Conference on Intelligent Robotics and Applications (ICIRA), pages744-754, 2009. DOI: 10.1007\/978-3-642-10817-4_74 Cited on page(s) 1, 2, 133 10.1007\/978-3-642-10817-4_74","DOI":"10.1007\/978-3-642-10817-4_74"},{"key":"p_106","doi-asserted-by":"publisher","DOI":"10.1137\/040620564"},{"key":"p_107","doi-asserted-by":"publisher","DOI":"10.1137\/040620564"},{"key":"p_108","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-47536-7_8"},{"key":"p_109","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.05.013"},{"key":"p_110","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2007.908304"},{"key":"p_111","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2007.908304"},{"issue":"1","key":"p_113","doi-asserted-by":"crossref","first-page":"3","DOI":"10.20965\/jrm.2009.p0003","volume":"21","author":"Miyamae T.","year":"2009","journal-title":"Journal of Robotics and Mechatronics"},{"key":"p_114","doi-asserted-by":"crossref","unstructured":"I. Navarro, \u00c1. Guti\u00e9rrez, F. Mat\u00eda, and F. Monasterio-Huelin. An approach to flocking of robots using minimal local sensing and common orientation. InProceedings of 3rdInternational Workshop on Hybrid Artificial Intelligence Systems (HAIS), pages616-624, 2008. DOI: 10.1007\/978-3-540-87656-4_76 Cited on page(s) 117 10.1007\/978-3-540-87656-4_76","DOI":"10.1007\/978-3-540-87656-4_76"},{"key":"p_115","doi-asserted-by":"crossref","unstructured":"F. Ooshita and S. Tixeuil. On the self-stabilization of mobile oblivious robots in uniform rings. InProceedings of 14thInternational Conference on Stabilization, Safety, and Security in Distributed Systems (SSS), 2012. (to appear). Cited on page(s) 147","DOI":"10.1007\/978-3-642-33536-5_6"},{"key":"p_116","doi-asserted-by":"crossref","unstructured":"L. Pagli, G. Prencipe, and G. Viglietta. Getting close without touching. InProceedings of 19thInt. Colloquium on Structural Information and Communication Complexity (SIROCCO), pages315-326, 2012. DOI: 10.1007\/978-3-642-31104-8_27 Cited on page(s) 48, 50, 51 10.1007\/978-3-642-31104-8_27","DOI":"10.1007\/978-3-642-31104-8_27"},{"key":"p_117","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1101-1"},{"key":"p_118","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.023"},{"key":"p_119","doi-asserted-by":"publisher","DOI":"10.1145\/37402.37406"},{"key":"p_121","unstructured":"S. Souissi, X. D\u00e9fago, and T. Katayama. Convergence of a uniform circle formation algorithm for distributed autonomous mobile robots. InProceedings of Journ\u00e9s Scientifiques Francophones (JSF), 2004. Cited on page(s) 84, 86"},{"key":"p_122","doi-asserted-by":"publisher","DOI":"10.1145\/1462187.1462196"},{"key":"p_123","doi-asserted-by":"crossref","unstructured":"S. Souissi, Y. Yang, and X. D\u00e9fago. Fault-tolerant flocking in a k -bounded asynchronous system. InProceedings of 12thInternational Conference on Principles of Distributed Systems (OPODIS), pages145-163, 2008. DOI: 10.1007\/978-3-540-92221-6_11 Cited on page(s) 117, 119 10.1007\/978-3-540-92221-6_11","DOI":"10.1007\/978-3-540-92221-6_11"},{"key":"p_124","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jss.2010.08.026","volume":"84","author":"Souissi S.","year":"2011","journal-title":"The Journal of Systems and Software"},{"key":"p_125","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4563(199603)13:3"},{"key":"p_126","unstructured":"I. Suzuki and M. Yamashita. Distributed anonymous mobile robots. InProceedings of 3rdInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), pages313-330, 1996. Cited on page(s) 9"},{"key":"p_127","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979628292X"},{"key":"p_128","first-page":"65","volume-title":"Department of Electrical Engineering","author":"Tanaka O.","year":"1992"},{"key":"p_129","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-8890(99)00084-6"},{"key":"p_130","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.80"},{"key":"p_131","doi-asserted-by":"publisher","DOI":"10.1002\/rob.4620080204"},{"key":"p_132","first-page":"355","volume":"43","author":"Weiszfeld E.","year":"1936","journal-title":"Tohoku Mathematical"},{"key":"p_133","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0038202"},{"key":"p_134","doi-asserted-by":"publisher","DOI":"10.4304\/jcm.5.1.31-38"},{"key":"p_135","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.037"},{"key":"p_136","doi-asserted-by":"crossref","unstructured":"Y. Yang, N. Xiong, N. Y. Chong, and X. D\u00e9fago. A decentralized and adaptive flocking algorithm for autonomous mobile robots. InProceedings of 3rdInternational Conference on Grid and Pervasive Computing Workshops, pages262-268, 2008. DOI: 10.1109\/GPC.WORKSHOPS.2008.18 Cited on page(s) 132, 133 10.1109\/GPC.WORKSHOPS.2008.18","DOI":"10.1109\/GPC.WORKSHOPS.2008.18"},{"key":"p_137","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-684X(199702)28:2"}],"container-title":["Synthesis Lectures on Distributed Computing Theory"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T13:13:38Z","timestamp":1687698818000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.morganclaypool.com\/doi\/abs\/10.2200\/S00440ED1V01Y201208DCT010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,27]]},"references-count":129,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,8,27]]}},"alternative-id":["10.2200\/S00440ED1V01Y201208DCT010"],"URL":"https:\/\/doi.org\/10.2200\/s00440ed1v01y201208dct010","relation":{},"ISSN":["2155-1626","2155-1634"],"issn-type":[{"value":"2155-1626","type":"print"},{"value":"2155-1634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,27]]}}}