{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T07:02:13Z","timestamp":1771916533363,"version":"3.50.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030312763","type":"print"},{"value":"9783030312770","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31277-0_7","type":"book-chapter","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:02:53Z","timestamp":1568376173000},"page":"93-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots"],"prefix":"10.1007","author":[{"given":"Thibaut","family":"Balabonski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Courtieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Pelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lionel","family":"Rieg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Urbain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,14]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-03089-0_13","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Auger","year":"2013","unstructured":"Auger, C., Bouzid, Z., Courtieu, P., Tixeuil, S., Urbain, X.: Certified impossibility results for byzantine-tolerant mobile robots. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 178\u2013190. Springer, Cham (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-319-03089-0_13"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-03232-6_29","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T Balabonski","year":"2018","unstructured":"Balabonski, T., Courtieu, P., Pelle, R., Rieg, L., Tixeuil, S., Urbain, X.: Brief announcement continuous vs. discrete asynchronous moves: a certified approach for mobile robots. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 404\u2013408. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-03232-6_29"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-319-49259-9_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T Balabonski","year":"2016","unstructured":"Balabonski, T., Delga, A., Rieg, L., Tixeuil, S., Urbain, X.: Synchronous gathering without multiplicity detection: a certified algorithm. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 7\u201319. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-49259-9_2"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Balabonski, T., Pelle, R., Rieg, L., Tixeuil, S.: A foundational framework for certified impossibility results with mobile robots on graphs. In: Bellavista, P., Garg, V.K., (eds.) Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, Varanasi, India, 4\u20137 January 2018, pp. 5:1\u20135:10. ACM (2018)","DOI":"10.1145\/3154273.3154321"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ipl.2008.08.011","volume":"109","author":"R Baldoni","year":"2008","unstructured":"Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: Anonymous graph exploration without collision by mobile robots. Inf. Process. Lett. 109(2), 98\u2013103 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"7_CR6","first-page":"101","volume":"7","author":"B B\u00e9rard","year":"2015","unstructured":"B\u00e9rard, B., et al.: Formal methods for mobile robots: current results and open problems. Int. J. Inform. Soc. 7(3), 101\u2013114 (2015). Invited Paper","journal-title":"Int. J. Inform. Soc."},{"issue":"6","key":"7_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00446-016-0271-1","volume":"29","author":"B B\u00e9rard","year":"2016","unstructured":"B\u00e9rard, B., Lafourcade, P., Millet, L., Potop-Butucaru, M., Thierry-Mieg, Y., Tixeuil, S.: Formal verification of mobile robot protocols. Distrib. Comput. 29(6), 459\u2013487 (2016)","journal-title":"Distrib. Comput."},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1007\/s00453-016-0124-0","volume":"77","author":"L Blin","year":"2017","unstructured":"Blin, L., Burman, J., Nisse, N.: Exclusive graph searching. Algorithmica 77(3), 942\u2013969 (2017)","journal-title":"Algorithmica"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-15763-9_29","volume-title":"Distributed Computing","author":"L Blin","year":"2010","unstructured":"Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive perpetual ring exploration without chirality. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 312\u2013327. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-15763-9_29"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Bonnet, F., D\u00e9fago, X., Petit, F., Potop-Butucaru, M., Tixeuil, S.: Discovering and assessing fine-grained metrics in robot networks protocols. In 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, SRDS Workshops 2014, Nara, Japan, 6\u20139 October 2014, pp. 50\u201359. IEEE (2014)","DOI":"10.1109\/SRDSW.2014.34"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-25873-2_18","volume-title":"Principles of Distributed Systems","author":"F Bonnet","year":"2011","unstructured":"Bonnet, F., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Asynchronous exclusive perpetual grid exploration without sense of direction. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 251\u2013265. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-25873-2_18"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-40509-4_22","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"F Bonnet","year":"2016","unstructured":"Bonnet, F., Potop-Butucaru, M., Tixeuil, S.: Asynchronous gathering in rings with 4 robots. In: Mitton, N., Loscri, V., Mouradian, A. (eds.) ADHOC-NOW 2016. LNCS, vol. 9724, pp. 311\u2013324. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-40509-4_22"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-17653-1_2","volume-title":"Principles of Distributed Systems","author":"Z Bouzid","year":"2010","unstructured":"Bouzid, Z., Dolev, S., Potop-Butucaru, M., Tixeuil, S.: RoboCast: asynchronous communication in robot networks. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 16\u201331. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-17653-1_2"},{"issue":"8","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1016\/j.robot.2012.05.009","volume":"60","author":"G Caron","year":"2012","unstructured":"Caron, G., Mouaddib, E.M., Marchand, \u00c9.: 3D model based tracking for omnidirectional vision: a new spherical approach. Robot. Auton. Syst. 60(8), 1056\u20131068 (2012)","journal-title":"Robot. Auton. Syst."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-16926-7_20","volume-title":"Graph Theoretic Concepts in Computer Science","author":"J Chalopin","year":"2010","unstructured":"Chalopin, J., Flocchini, P., Mans, B., Santoro, N.: Network exploration by silent and oblivious robots. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 208\u2013219. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16926-7_20"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.ipl.2014.11.001","volume":"115","author":"P Courtieu","year":"2015","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: Impossibility of gathering, a certification. Inf. Process. Lett. 115, 447\u2013452 (2015)","journal-title":"Inf. Process. Lett."},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-662-53426-7_14","volume-title":"Distributed Computing","author":"P Courtieu","year":"2016","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: Certified universal gathering in \n                      \n                        \n                      \n                      $$\\mathbb{R} ^2$$\n                     for oblivious mobile robots. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 187\u2013200. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-53426-7_14"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00446-016-0274-y","volume":"30","author":"G D\u2019Angelo","year":"2017","unstructured":"D\u2019Angelo, G., Navarra, A., Nisse, N.: A unified approach for gathering and exclusive searching on rings under weak assumptions. Distrib. Comput. 30(1), 17\u201348 (2017)","journal-title":"Distrib. Comput."},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1007\/s00453-014-9892-6","volume":"72","author":"G D\u2019Angelo","year":"2015","unstructured":"D\u2019Angelo, G., Stefano, G.D., Navarra, A., Nisse, N., Suchan, K.: Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica 72(4), 1055\u20131096 (2015)","journal-title":"Algorithmica"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-33536-5_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Devismes","year":"2012","unstructured":"Devismes, S., Lamani, A., Petit, F., Raymond, P., Tixeuil, S.: Optimal grid exploration by asynchronous oblivious robots. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 64\u201376. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33536-5_7"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-26850-7_13","volume-title":"Networked Systems","author":"S Devismes","year":"2015","unstructured":"Devismes, S., Lamani, A., Petit, F., Tixeuil, S.: Optimal torus exploration by oblivious robots. In: Bouajjani, A., Fauconnier, H. (eds.) NETYS 2015. LNCS, vol. 9466, pp. 183\u2013199. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-26850-7_13"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2013.05.031","volume":"498","author":"S Devismes","year":"2013","unstructured":"Devismes, S., Petit, F., Tixeuil, S.: Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theoret. Comput. Sci. 498, 10\u201327 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-57708-1_12","volume-title":"Structured Object-Oriented Formal Language and Method","author":"HTT Doan","year":"2017","unstructured":"Doan, H.T.T., Bonnet, F., Ogata, K.: Model checking of a mobile robots perpetual exploration algorithm. In: Liu, S., Duan, Z., Tian, C., Nagoya, F. (eds.) SOFL+MSVL 2016. LNCS, vol. 10189, pp. 201\u2013219. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-57708-1_12"},{"key":"7_CR25","unstructured":"Doan, H.T.T., Bonnet, F., Ogata, K.: Model checking of robot gathering. In: Aspnes, J., Felber, P. (edS.) Principles of Distributed Systems - 21th International Conference (OPODIS 2017), Leibniz International Proceedings in Informatics (LIPIcs), Lisbon, Portugal, December 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"issue":"14\u201315","key":"7_CR26","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1016\/j.tcs.2010.01.007","volume":"411","author":"P Flocchini","year":"2010","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: tree exploration by asynchronous oblivious robots. Theoret. Comput. Sci. 411(14\u201315), 1583\u20131598 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"7_CR27","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/s00453-011-9611-5","volume":"65","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing without communicating: ring exploration by asynchronous oblivious robots. Algorithmica 65(3), 562\u2013583 (2013)","journal-title":"Algorithmica"},{"key":"7_CR28","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"publisher","DOI":"10.2200\/S00440ED1V01Y201208DCT010","volume-title":"Distributed Computing by Oblivious Mobile Robots","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, California (2012)"},{"issue":"1\u20133","key":"7_CR29","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.tcs.2008.07.026","volume":"407","author":"P Flocchini","year":"2008","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoret. Comput. Sci. 407(1\u20133), 412\u2013447 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-33651-5_22","volume-title":"Distributed Computing","author":"N Fujinaga","year":"2012","unstructured":"Fujinaga, N., Yamauchi, Y., Kijima, S., Yamashita, M.: Asynchronous pattern formation by anonymous oblivious mobile robots. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 312\u2013325. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33651-5_22"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-642-24100-0_32","volume-title":"Distributed Computing","author":"T Izumi","year":"2011","unstructured":"Izumi, T., Bouzid, Z., Tixeuil, S., Wada, K.: Brief announcement: the BG-simulation for Byzantine mobile robots. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 330\u2013331. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24100-0_32"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-13284-1_9","volume-title":"Structural Information and Communication Complexity","author":"T Izumi","year":"2010","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Mobile robots gathering algorithm with local weak multiplicity in rings. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol. 6058, pp. 101\u2013113. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-13284-1_9"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-22212-2_14","volume-title":"Structural Information and Communication Complexity","author":"S Kamei","year":"2011","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 150\u2013161. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22212-2_14"},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-642-32589-2_48","volume-title":"Mathematical Foundations of Computer Science 2012","author":"S Kamei","year":"2012","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Gathering an even number of robots in an odd ring without global multiplicity detection. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 542\u2013553. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32589-2_48"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-13284-1_15","volume-title":"Structural Information and Communication Complexity","author":"A Lamani","year":"2010","unstructured":"Lamani, A., Potop-Butucaru, M.G., Tixeuil, S.: Optimal deterministic ring exploration with oblivious asynchronous robots. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol. 6058, pp. 183\u2013196. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-13284-1_15"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-11764-5_17","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Millet","year":"2014","unstructured":"Millet, L., Potop-Butucaru, M., Sznajder, N., Tixeuil, S.: On the synthesis of mobile robots algorithms: the case of ring gathering. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 237\u2013251. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-11764-5_17"},{"issue":"2\u20133","key":"7_CR37","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.tcs.2007.04.023","volume":"384","author":"G Prencipe","year":"2007","unstructured":"Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoret. Comput. Sci. 384(2\u20133), 222\u2013231 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-25524-8_12","volume-title":"PRIMA 2015: Principles and Practice of Multi-Agent Systems","author":"B Aminof","year":"2015","unstructured":"Aminof, B., Murano, A., Rubin, S., Zuleger, F.: Verification of asynchronous mobile-robots in partially-known environments. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds.) PRIMA 2015. LNCS (LNAI), vol. 9387, pp. 185\u2013200. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-25524-8_12"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Sangnier, A., Sznajder, N., Potop-Butucaru, M., Tixeuil, S.: Parameterized verification of algorithms for oblivious robots on a ring. In: Formal Methods in Computer Aided Design, Vienna, Austria, October 2017","DOI":"10.23919\/FMCAD.2017.8102262"},{"issue":"4","key":"7_CR40","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"key":"7_CR41","unstructured":"Tomita, Y., Yamauchi, Y., Kijima, S., Yamashita, M.: Plane formation by synchronous mobile robots without chirality. In: Aspnes, J., Bessani, A., Felber, P., Leit\u00e3o, J. (eds.) 21st International Conference on Principles of Distributed Systems, OPODIS 2017. LIPIcs, vol. 95, Lisbon, Portugal, 18\u201320 December 2017, pp. 13:1\u201313:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"26\u201328","key":"7_CR42","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1016\/j.tcs.2010.01.037","volume":"411","author":"M Yamashita","year":"2010","unstructured":"Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theoret. Comput. Sci. 411(26\u201328), 2433\u20132453 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"7_CR43","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/3060272","volume":"64","author":"Y Yamauchi","year":"2017","unstructured":"Yamauchi, Y., Uehara, T., Kijima, S., Yamashita, M.: Plane formation by synchronous mobile robots in the three-dimensional Euclidean space. J. ACM 64(3), 16:1\u201316:43 (2017)","journal-title":"J. ACM"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Yamauchi, Y., Uehara, T., Yamashita, T.: Brief announcement: pattern formation problem for synchronous mobile robots in the three dimensional euclidean space. In: Giakkoupis, G. (ed.) Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, 25\u201328 July 2016, pp. 447\u2013449. ACM (2016)","DOI":"10.1145\/2933057.2933063"},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-03578-9_17","volume-title":"Structural Information and Communication Complexity","author":"Y Yamauchi","year":"2013","unstructured":"Yamauchi, Y., Yamashita, M.: Pattern formation by mobile robots with limited visibility. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 201\u2013212. Springer, Cham (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-319-03578-9_17"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31277-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:05:51Z","timestamp":1568376351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31277-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030312763","9783030312770"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31277-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.91","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.68","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}