{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:29Z","timestamp":1759638449736,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910136"},{"type":"electronic","value":"9783030910143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-91014-3_7","type":"book-chapter","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:03:39Z","timestamp":1638353019000},"page":"95-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Exclusive Perpetual Grid Exploration by\u00a0Luminous Myopic Robots Without Common Chirality"],"prefix":"10.1007","author":[{"given":"Arthur","family":"Rauch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0612-5616","authenticated-orcid":false,"given":"Quentin","family":"Bramas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Devismes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4459-511X","authenticated-orcid":false,"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7774-8402","authenticated-orcid":false,"given":"Anissa","family":"Lamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"issue":"2","key":"7_CR1","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":"7_CR2","doi-asserted-by":"publisher","unstructured":"Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive perpetual ring exploration without chirality. In: Lynch, N.A., Shvartsman, A.A. (eds.) Distributed Computing, DISC 2010. LNCS, vol. 6343, pp. 312\u2013327. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15763-9_29","DOI":"10.1007\/978-3-642-15763-9_29"},{"key":"7_CR3","doi-asserted-by":"publisher","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.) Principles of Distributed Systems, OPODIS 2011. LNCS, vol. 7109, pp. 251\u2013265. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_18","DOI":"10.1007\/978-3-642-25873-2_18"},{"key":"7_CR4","unstructured":"Bramas, Q., Devismes, S., Lafourcade, P.: Finding water on poleless using melomaniac myopic chameleon robots. In: FUN 2020, 10th International Conference on Fun with Algorithms. LiPICs, Favignana, Sicily, Italy, 28\u201330 September 2020)."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Bramas, Q., Devismes, S., Lafourcade, P.: Infinite grid exploration by disoriented robots. In: Georgiou, C., Majumdar, R. (eds.) Networked Systems, NETYS 2020. LNCS, vol. 12129, pp. 129\u2013145. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67087-0_9","DOI":"10.1007\/978-3-030-67087-0_9"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bramas, Q., Devismes, S., Lafourcade, P.: Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. In: ICDCN 2021: International Conference on Distributed Computing and Networking, Virtual Event, pp. 76\u201385. ACM, Nara, Japan, 5\u20138 January 2021","DOI":"10.1145\/3427796.3427834"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Datta, A.K., Lamani, A., Larmore, L.L., Petit, F.: Enabling ring exploration with myopic oblivious robots. In: 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, IPDPS 2015, pp. 490\u2013499. IEEE Computer Society, Hyderabad, India, 25\u201329 May 2015","DOI":"10.1109\/IPDPSW.2015.137"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1093\/comjnl\/bxz166","volume":"64","author":"S Devismes","year":"2020","unstructured":"Devismes, S., Lamani, A., Petit, F., Raymond, P., Tixeuil, S.: Terminating exploration of a grid by an optimal number of asynchronous oblivious robots. Comput. J. 64(1), 132\u2013154 (2020)","journal-title":"Comput. J."},{"issue":"9","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1007\/s00607-018-0595-8","volume":"101","author":"S Devismes","year":"2019","unstructured":"Devismes, S., Lamani, A., Petit, F., Tixeuil, S.: Optimal torus exploration by oblivious robots. Computing 101(9), 1241\u20131264 (2019)","journal-title":"Computing"},{"key":"7_CR10","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. Theor. Comput. Sci. (TCS) 498, 10\u201327 (2013)","journal-title":"Theor. Comput. Sci. (TCS)"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Dieudonn\u00e9, Y., Petit, F., Villain, V.: Leader election problem versus pattern formation problem. In: Lynch, N.A., Shvartsman, A.A. (eds.) Distributed Computing, DISC 2010. LNCS, vol. 6343, pp. 267\u2013281. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15763-9_26","DOI":"10.1007\/978-3-642-15763-9_26"},{"issue":"14\u201315","key":"7_CR12","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. Theor. Comput. Sci. 411(14\u201315), 1583\u20131598 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"20","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.ipl.2011.07.018","volume":"111","author":"P Flocchini","year":"2011","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: How many oblivious robots can explore a line. Inf. Process. Lett. 111(20), 1027\u20131031 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"7_CR14","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_CR15","doi-asserted-by":"publisher","unstructured":"Ooshita, F., Tixeuil, S.: Ring exploration with myopic luminous robots. In: Izumi, T., Kuznetsov, P. (eds.) Stabilization, Safety, and Security of Distributed Systems, SSS 2018. LNCS, vol. 11201, pp. 301\u2013316. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_20","DOI":"10.1007\/978-3-030-03232-6_20"},{"key":"7_CR16","doi-asserted-by":"publisher","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.) Distributed Computing \u2013 IWDC 2005, IWDC 2005. LNCS, vol. 3741, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11603771_1","DOI":"10.1007\/11603771_1"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Rauch, A., Bramas, Q., Devismes, S., Lafourcade, P., Lamani, A.: Optimal exclusive perpetual grid exploration by luminous myopic robots without chirality: the animations (2021). https:\/\/doi.org\/10.5281\/zenodo.4640462","DOI":"10.5281\/zenodo.4640462"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91014-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:04:49Z","timestamp":1638353089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91014-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910136","9783030910143"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91014-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 December 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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2021","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":"32","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":"15","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":"2","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":"47% - 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":"2,84","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)"}}]}}