{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:06Z","timestamp":1760203026997,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030892395"},{"type":"electronic","value":"9783030892401"}],"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-89240-1_3","type":"book-chapter","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:01:04Z","timestamp":1634619664000},"page":"29-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Gathering a Euclidean Closed Chain of\u00a0Robots in Linear Time"],"prefix":"10.1007","author":[{"given":"Jannik","family":"Castenow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas","family":"Harbig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Till","family":"Knollmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Gathering a closed chain of robots on a grid. In: 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, 23\u201327 May 2016, pp. 689\u2013699 (2016)","DOI":"10.1109\/IPDPS.2016.51"},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robot. Autom. 15(5), 818\u2013828 (1999)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM 32(4), 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Castenow, J., Fischer, M., Harbig, J., Jung, D., Meyer auf der Heide, F.: Gathering anonymous, oblivious robots on a grid. Theor. Comput. Sci. 815, 289\u2013309 (2020)","DOI":"10.1016\/j.tcs.2020.02.018"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-030-64348-5_5","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"J Castenow","year":"2020","unstructured":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., Meyer auf der Heide, F.: Brief announcement: gathering in linear time: a closed chain of disoriented and luminous robots with limited visibility. In: Devismes, S., Mittal, N. (eds.) SSS 2020. LNCS, vol. 12514, pp. 60\u201364. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64348-5_5"},{"key":"3_CR6","unstructured":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., Meyer auf der Heide, F.: Gathering a euclidean closed chain of robots in linear time. CoRR abs\/2010.04424 (2021). https:\/\/arxiv.org\/abs\/2010.04424"},{"issue":"1\u20132","key":"3_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2008.02.007","volume":"399","author":"R Cohen","year":"2008","unstructured":"Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399(1\u20132), 71\u201382 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Asymptotically optimal gathering on a grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach\/Pacific Grove, CA, USA, 11\u201313 July 2016, pp. 301\u2013312 (2016)","DOI":"10.1145\/2935764.2935789"},{"key":"3_CR9","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, 171\u2013184 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Kling, P., Meyer auf der Heide, F.: Linear and competitive strategies for continuous robot formation problems. ACM Trans. Parallel Comput. 2(1), 2:1\u20132:18 (2015)","DOI":"10.1145\/2742341"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, 4\u20136 June 2011, pp. 139\u2013148. ACM (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Di Luna, G., Viglietta, G.: Robots with lights. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, pp. 252\u2013277 (2019)","DOI":"10.1007\/978-3-030-11072-7_11"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s11036-008-0102-0","volume":"14","author":"C Dixon","year":"2009","unstructured":"Dixon, C., Frew, E.W.: Maintaining optimal communication chains in robotic sensor networks using mobility control. Mob. Netw. Appl. 14(3), 281\u2013291 (2009)","journal-title":"Mob. Netw. Appl."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Flocchini, P.: Gathering. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, pp. 63\u201382 (2019)","DOI":"10.1007\/978-3-030-11072-7_4"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Moving and computing models: robots. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, pp. 3\u201314 (2019)","DOI":"10.1007\/978-3-030-11072-7_1"},{"key":"3_CR16","unstructured":"Flocchini, P., Santoro, N., Wada, K.: On memory, communication, and synchronous schedulers when moving and computing. In: OPODIS. LIPIcs, vol. 153, pp. 25:1\u201325:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"6","key":"3_CR17","doi-asserted-by":"publisher","first-page":"2532","DOI":"10.1109\/TMECH.2017.2751149","volume":"22","author":"Y Gao","year":"2017","unstructured":"Gao, Y., Chen, H., Li, Y., Lyu, C., Liu, Y.: Autonomous wi-fi relay placement with mobile robots. IEEE\/ASME Trans. Mechatron. 22(6), 2532\u20132542 (2017)","journal-title":"IEEE\/ASME Trans. Mechatron."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Metamorphoses of polygons. In: The Lighter Side of Mathematics, pp. 35\u201348 (1994)","DOI":"10.1090\/spec\/011\/05"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2018.04.047","volume":"738","author":"T Izumi","year":"2018","unstructured":"Izumi, T., Kaino, D., Potop-Butucaru, M., Tixeuil, S.: On time complexity for connectivity-preserving scattering of mobile robots. Theor. Comput. Sci. 738, 42\u201352 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Kling, P., Meyer auf der Heide, F.: Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, 4\u20136 June 2011, pp. 159\u2013166 (2011)","DOI":"10.1145\/1989493.1989517"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-11072-7_13","volume-title":"Distributed Computing by Mobile Entities","author":"P Kling","year":"2019","unstructured":"Kling, P., Meyer auf der Heide, F.: Continuous protocols for swarm robotics. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities. LNCS, vol. 11340, pp. 317\u2013334. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_13"},{"issue":"36","key":"3_CR22","doi-asserted-by":"publisher","first-page":"3391","DOI":"10.1016\/j.tcs.2008.04.010","volume":"410","author":"J Kutylowski","year":"2009","unstructured":"Kutylowski, J., Meyer auf der Heide, F.: Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theor. Comput. Sci. 410(36), 3391\u20133405 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR23","unstructured":"Nguyen, H.G., Pezeshkian, N., Raymond, S.M., Gupta, A., Spector, J.M.: Autonomous communication relays for tactical robots. In: Proceedings of the 11th International Conference on Advanced Robotics (ICAR), pp. 35\u201340 (2003)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-319-69084-1_23","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"P Poudel","year":"2017","unstructured":"Poudel, P., Sharma, G.: Universally optimal gathering under limited visibility. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 323\u2013340. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_23"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2018.02.015","volume":"736","author":"D Regnault","year":"2018","unstructured":"Regnault, D., R\u00e9mila, E.: Lost in self-stabilization: a local process that aligns connected cells. Theor. Comput. Sci. 736, 41\u201361 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Tagliabue, A., Schneider, S., Pavone, M., Agha-mohammadi, A.: Shapeshifter: a multi-agent, multi-modal robotic platform for exploration of titan. CoRR abs\/2002.00515 (2020). https:\/\/arxiv.org\/abs\/2002.00515","DOI":"10.1109\/AERO47225.2020.9172739"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Tekdas, O., Plonski, P.A., Karnad, N., Isler, V.: Maintaining connectivity in environments with obstacles. In: IEEE International Conference on Robotics and Automation, ICRA 2010, Anchorage, Alaska, USA, 3\u20137 May 2010, pp. 1952\u20131957 (2010)","DOI":"10.1109\/ROBOT.2010.5509479"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89240-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T05:55:27Z","timestamp":1634622927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89240-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030892395","9783030892401"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89240-1_3","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":"19 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/ALGOSENSORS2021\/index.html","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":"28","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":"10","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":"0","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":"36% - 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.4","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.7","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 online due to the COVID-19 pandemic.","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)"}}]}}