{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T12:21:54Z","timestamp":1782303714566,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Italian National Group for Scientific Computation GNCS-INdAM"},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["Discovery Grants A3583 and A2415"],"award-info":[{"award-number":["Discovery Grants A3583 and A2415"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467910","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"9-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Separating Bounded and Unbounded Asynchrony for Autonomous Robots"],"prefix":"10.1145","author":[{"given":"David","family":"Kirkpatrick","sequence":"first","affiliation":[{"name":"University of British Columbia, Vancouver, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Irina","family":"Kostitsyna","sequence":"additional","affiliation":[{"name":"TU Eindhoven, Eindhoven, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[{"name":"University of Perugia, Perugia, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Prencipe","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484266"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/70.795787"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154273.3154322"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11072-7_7"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.10.015"},{"key":"e_1_3_2_2_6_1","volume-title":"Local gathering of mobile robots in three dimensions. CoRR","author":"Braun Michael","year":"2020","unstructured":"Michael Braun , Jannik Castenow , and Friedhelm Meyer auf der Heide . 2020. Local gathering of mobile robots in three dimensions. CoRR , Vol. abs\/ 2005 .07495 ( 2020 ). https:\/\/arxiv.org\/abs\/2005.07495 Michael Braun, Jannik Castenow, and Friedhelm Meyer auf der Heide. 2020. Local gathering of mobile robots in three dimensions. CoRR , Vol. abs\/2005.07495 (2020). https:\/\/arxiv.org\/abs\/2005.07495"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2015.04.001"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0293-3"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0325-7"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0333-7"},{"key":"e_1_3_2_2_11_1","volume-title":"Gabriele Di Stefano, and Alfredo Navarra","author":"Cicerone Serafino","year":"2020","unstructured":"Serafino Cicerone , Gabriele Di Stefano, and Alfredo Navarra . 2020 . A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study. CoRR , Vol. abs\/ 2010 .12463 (2020). https:\/\/arxiv.org\/abs\/2010.12463 Serafino Cicerone, Gabriele Di Stefano, and Alfredo Navarra. 2020. A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study. CoRR , Vol. abs\/2010.12463 (2020). https:\/\/arxiv.org\/abs\/2010.12463"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3064880"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/100796534"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446475"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/060665257"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.005"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.09.010"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Paola Flocchini Giuseppe Prencipe and Nicola Santoro. 2012. Distributed Computing by Oblivious Mobile Robots .Morgan & Claypool.  Paola Flocchini Giuseppe Prencipe and Nicola Santoro. 2012. Distributed Computing by Oblivious Mobile Robots .Morgan & Claypool.","DOI":"10.1007\/978-3-031-02008-7"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0291-x"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46632-0_10"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.01.001"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.002"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22212-2_12"},{"key":"e_1_3_2_2_24_1","volume-title":"Separating bounded and unbounded asynchrony for autonomous robots: Point convergence with limited visibility. CoRR","author":"Kirkpatrick David","unstructured":"David Kirkpatrick , Irina Kostitsyna , Alfredo Navarra , Giuseppe Prencipe , and Nicola Santoro . 2021. Separating bounded and unbounded asynchrony for autonomous robots: Point convergence with limited visibility. CoRR , Vol. abs\/ (2021). https:\/\/arxiv.org\/abs\/ 2105 .13042 David Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, and Nicola Santoro. 2021. Separating bounded and unbounded asynchrony for autonomous robots: Point convergence with limited visibility. CoRR , Vol. abs\/ (2021). https:\/\/arxiv.org\/abs\/2105.13042"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/040620564"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-015-0248-5"},{"key":"e_1_3_2_2_27_1","volume-title":"Partha Sarathi Mandal, and Stefan Schmid","author":"Pattanayak Debasish","year":"2017","unstructured":"Debasish Pattanayak , Kaushik Mondal , Partha Sarathi Mandal, and Stefan Schmid . 2017 . Convergence of even simpler robots without position information. In Networked Systems (NETYS) (Lecture Notes in Computer Science , Vol. 10299), Amr El Abbadi and Beno\u00eet Garbinato (Eds.). Springer, 69-- 85 . Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, and Stefan Schmid. 2017. Convergence of even simpler robots without position information. In Networked Systems (NETYS) (Lecture Notes in Computer Science, Vol. 10299), Amr El Abbadi and Beno\u00eet Garbinato (Eds.). Springer, 69--85."},{"key":"e_1_3_2_2_28_1","volume-title":"Partha Sarathi Mandal, and Stefan Schmid","author":"Pattanayak Debasish","year":"2021","unstructured":"Debasish Pattanayak , Kaushik Mondal , Partha Sarathi Mandal, and Stefan Schmid . 2021 . Area convergence of monoculus robots with additional capabilities. The Computer Journal (COMPJ) ( 2021). https:\/\/doi.org\/10.1093\/comjnl\/bxaa182 10.1093\/comjnl Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, and Stefan Schmid. 2021. Area convergence of monoculus robots with additional capabilities. The Computer Journal (COMPJ) (2021). https:\/\/doi.org\/10.1093\/comjnl\/bxaa182"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4563(199603)13:3<127::AID-ROB1>3.0.CO;2-U"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979628292X"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.04.038"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.037"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3060272"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","location":"Virtual Event Italy","acronym":"PODC '21","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467910","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467910"}},"subtitle":["Point Convergence with Limited Visibility"],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":33,"alternative-id":["10.1145\/3465084.3467910","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467910","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}