{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T20:52:08Z","timestamp":1768337528175,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030670863","type":"print"},{"value":"9783030670870","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67087-0_9","type":"book-chapter","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:17:39Z","timestamp":1610587059000},"page":"129-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Infinite Grid Exploration by Disoriented Robots"],"prefix":"10.1007","author":[{"given":"Quentin","family":"Bramas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Devismes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,14]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-14094-6","volume-title":"Algorithms for Sensor Systems","year":"2019","unstructured":"Gilbert, S., Hughes, D., Krishnamachari, B. (eds.): ALGOSENSORS 2018. LNCS, vol. 11410. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14094-6"},{"issue":"2","key":"9_CR2","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."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bonnet, F., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Asynchronous exclusive perpetual grid exploration without sense of direction. In: OPODIS, Toulouse, France, pp. 251\u2013265 (2011)","DOI":"10.1007\/978-3-642-25873-2_18"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bose, K., Adhikary, R., Kundu, M.K., Sau, B.: Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. In: WALCOM, pp. 354\u2013366 (2019)","DOI":"10.1007\/978-3-030-10564-8_28"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bramas, Q., Devismes, S., Lafourcade, P.: Infinite grid exploration by disoriented robots. In: SIROCCO, pp. 340\u2013344 (2019)","DOI":"10.1007\/978-3-030-24922-9_25"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bramas, Q., Devismes, S., Lafourcade, P.: Infinite Grid Exploration by Disoriented Robots: Animations (September 2019). https:\/\/doi.org\/10.5281\/zenodo.2625730","DOI":"10.5281\/zenodo.2625730"},{"key":"9_CR7","unstructured":"Brandt, S., Uitto, J., Wattenhofer, R.: A tight bound for semi-synchronous collaborative grid exploration. In: DISC (2018)"},{"issue":"P1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2015.09.018","volume":"609","author":"S Das","year":"2016","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: Autonomous mobile robots with lights. Theor. Comput. Sci. 609(P1), 171\u2013184 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR9","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). https:\/\/doi.org\/10.1007\/978-3-642-33536-5_7"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.ic.2016.09.004","volume":"254","author":"G Di Stefano","year":"2016","unstructured":"Di Stefano, G., Navarra, A.: Gathering of oblivious robots on infinite grids with minimum traveled distance. Inf. Comput. 254, 377\u2013391 (2016)","journal-title":"Inf. Comput."},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ipl.2006.09.008","volume":"101","author":"Y Dieudonn\u00e9","year":"2007","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Circle formation of weak robots and Lyndon words. Inf. Process. Lett. 101(4), 156\u2013162 (2007)","journal-title":"Inf. Process. Lett."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-50472-8_2","volume-title":"Distributed Computing and Internet Technology","author":"D Dutta","year":"2017","unstructured":"Dutta, D., Dey, T., Chaudhuri, S.G.: Gathering multiple robots in a ring and an infinite grid. In: Krishnan, P., Radha Krishna, P., Parida, L. (eds.) ICDCIT 2017. LNCS, vol. 10109, pp. 15\u201326. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50472-8_2"},{"issue":"P3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2015.05.054","volume":"608","author":"Y Emek","year":"2015","unstructured":"Emek, Y., Langner, T., Stolz, D., Uitto, J., Wattenhofer, R.: How many ants does it take to find the food? Theor. Comput. Sci. 608(P3), 255\u2013267 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1), 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ic.2016.09.005","volume":"254","author":"GAD Luna","year":"2017","unstructured":"Luna, G.A.D., Flocchini, P., Chaudhuri, S.G., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392\u2013418 (2017)","journal-title":"Inf. Comput."},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Ooshita, F., Datta, A.K.: Brief announcement: feasibility of weak gathering in connected-over-time dynamic rings. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 393\u2013397. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_27","DOI":"10.1007\/978-3-030-03232-6_27"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11603771_1","volume-title":"Distributed Computing \u2013 IWDC 2005","author":"D Peleg","year":"2005","unstructured":"Peleg, D.: Distributed coordination algorithms for mobile robot swarms: new directions and challenges. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol. 3741, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11603771_1"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jss.2010.08.026","volume":"84","author":"Y Yang","year":"2011","unstructured":"Yang, Y., Souissi, S., D\u00e9fago, X., Takizawa, M.: Fault-tolerant flocking for a group of autonomous mobile robots. J. Syst. Softw. 84(1), 29\u201336 (2011)","journal-title":"J. Syst. Softw."}],"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-67087-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:49:25Z","timestamp":1610588965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67087-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670863","9783030670870"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67087-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 January 2021","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2020","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":"46","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":"18","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":"39% - 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":"3","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.75","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually. Three invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}