{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:09:43Z","timestamp":1768338583586,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T00:00:00Z","timestamp":1634947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T00:00:00Z","timestamp":1634947200000},"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":["Distrib. Comput."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00446-021-00406-6","type":"journal-article","created":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T09:02:43Z","timestamp":1634979763000},"page":"105-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications"],"prefix":"10.1007","volume":"35","author":[{"given":"Giuseppe A. Di","family":"Luna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6145-4602","authenticated-orcid":false,"given":"Giovanni","family":"Viglietta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,23]]},"reference":[{"key":"406_CR1","doi-asserted-by":"crossref","unstructured":"Agathangelou, C., Georgiou, C. and Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In 32nd ACM Symposium on Principles of Distributed Computing (PODC), 250\u2013259, 2013.","DOI":"10.1145\/2484239.2484266"},{"issue":"1","key":"406_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/050645221","volume":"36","author":"N Agmon","year":"2006","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56\u201382 (2006)","journal-title":"SIAM J. Comput."},{"key":"406_CR3","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts (1974)"},{"issue":"5","key":"406_CR4","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\u2013838 (1999)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"406_CR5","unstructured":"Barel, A., Manor, R. and Bruckstein, A. M.: Come Together: Multi-agent geometric consensus (Gathering, Rendezvous, Clustering, Aggregation). arXiv:1902.01455 [cs.MA], 2019"},{"issue":"2","key":"406_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S0129054117500083","volume":"28","author":"Q Bramas","year":"2017","unstructured":"Bramas, Q., Tixeuil, S.: The random bit complexity of mobile robots scattering. Int. J. Found. Comput. Sci. 28(2), 111\u2013134 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"406_CR7","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831470","volume-title":"Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms","author":"F Bullo","year":"2009","unstructured":"Bullo, F., Cort\u00e9s, J., Mart\u00ednez, S.: Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms. Princeton University Press, New Jersy (2009)"},{"key":"406_CR8","doi-asserted-by":"crossref","unstructured":"Canepa, D., D\u00e9fago, X., Izumi, T. and Potop-Butucaru, M.: Flocking with oblivious robots. In 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 94\u2013108, 2016","DOI":"10.1007\/978-3-319-49259-9_8"},{"key":"406_CR9","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di\u00a0Stefano, S. and Navarra, A.: Minimum-traveled-distance gathering of oblivious robots over given meeting points. In 10th International Symposium on Algorithms and Experiments for Sensor Systems (Algosensors), pp. 57\u201372, 2014","DOI":"10.1007\/978-3-662-46018-4_4"},{"key":"406_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00446-018-0325-7","volume":"32","author":"S Cicerone","year":"2019","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Asynchronous pattern formation: the effects of a rigorous approach. Distrib. Comput. 32, 91\u2013132 (2019)","journal-title":"Distrib. Comput."},{"issue":"2","key":"406_CR11","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(2), 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"406_CR12","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"36","author":"R Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Comput. 36(6), 1516\u20131528 (2005)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"406_CR13","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(3), 447\u2013452 (2015)","journal-title":"Inf. Process. Lett."},{"key":"406_CR14","doi-asserted-by":"crossref","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S. and Urbain., X.: Certified universal gathering in $$\\mathbb{R}^2$$ for oblivious mobile robots. In 30th International Symposium on Distributed Computing (DISC), pp. 187\u2013200, 2016","DOI":"10.1007\/978-3-662-53426-7_14"},{"issue":"2","key":"406_CR15","first-page":"131","volume":"28","author":"S Das","year":"2015","unstructured":"Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Forming sequences of geometric patterns with oblivious mobile robots. Inf. Process. Lett. 28(2), 131\u2013145 (2015)","journal-title":"Inf. Process. Lett."},{"key":"406_CR16","doi-asserted-by":"crossref","unstructured":"D\u00e9fago, X., Gradinariu, M., Messika, S., Raipin-Parv\u00e9dy, P. and Dolev, S.: Fault-tolerant and self-stabilizing mobile robots gathering. In 20th International Symposium on Distributed Computing (DISC), pp. 46\u201360, 2006","DOI":"10.1007\/11864219_4"},{"key":"406_CR17","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), 1\u201318 (2015)","DOI":"10.1145\/2742341"},{"key":"406_CR18","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Kling, P., Meyer auf\u00a0der Heide, F., Pietrzyk, P. and Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 139\u2013148, 2011","DOI":"10.1145\/1989493.1989515"},{"key":"406_CR19","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G. and Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool, 2012","DOI":"10.2200\/S00440ED1V01Y201208DCT010"},{"issue":"6","key":"406_CR20","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00446-016-0291-x","volume":"30","author":"P Flocchini","year":"2017","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: Uniform circle formation. Distrib. Comput. 30(6), 413\u2013457 (2017)","journal-title":"Distrib. Comput."},{"issue":"1\u20133","key":"406_CR21","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. Theoret. Comput. Sci. 337(1\u20133), 147\u2013168 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"406_CR22","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."},{"issue":"3","key":"406_CR23","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/140958682","volume":"44","author":"N Fujinaga","year":"2015","unstructured":"Fujinaga, N., Yamauchi, Y., Kijima, S., Yamahista, M.: Pattern formation by oblivious asynchronous mobile robots. SIAM J. Comput. 44(3), 740\u2013785 (2015)","journal-title":"SIAM J. Comput."},{"key":"406_CR24","doi-asserted-by":"crossref","unstructured":"Izumi, T., Gradinariu, M. and Tixeuil. S.: Connectivity-preserving scattering of mobile robots with limited visibility. In 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 319\u2013331, 2010","DOI":"10.1007\/978-3-642-16023-3_27"},{"key":"406_CR25","doi-asserted-by":"crossref","unstructured":"Kling, P. and Meyer auf der Heide, F.: Continuous Protocols for Swarm Robotics. In Distributed Computing by Mobile Entities, 317\u2013334, P.\u00a0Flocchini, G.\u00a0Prencipe, and N. Santoro (Eds.), Springer, 2019","DOI":"10.1007\/978-3-030-11072-7_13"},{"key":"406_CR26","doi-asserted-by":"crossref","unstructured":"Li, S., Markarian, C., Meyer auf der Heide, F. and Podlipyan, P.: A continuous strategy for collisionless gathering. Theor. Comput. Sci. 852, 41\u201360 (2021)","DOI":"10.1016\/j.tcs.2020.10.037"},{"issue":"6","key":"406_CR27","doi-asserted-by":"publisher","first-page":"2096","DOI":"10.1137\/040620552","volume":"46","author":"J Lin","year":"2007","unstructured":"Lin, J., Morse, A.S., Anderson, B.D.O.: The multi-agent rendezvous problem. Part 1 and Part 2. SIAM J. Control Opt. 46(6), 2096\u20132147 (2007)","journal-title":"SIAM J. Control Opt."},{"issue":"5","key":"406_CR28","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00446-015-0248-5","volume":"28","author":"L Pagli","year":"2015","unstructured":"Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching: Near-gathering for autonomous mobile robots. Distrib. Comput. 28(5), 333\u2013349 (2015)","journal-title":"Distrib. Comput."},{"key":"406_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer-Verlag, Berlin (1985)"},{"key":"406_CR30","unstructured":"Shamos, M.\u00a0I.:Computational Geometry. Ph. D. thesis, Department of Computer Science, Yale University, 1978"},{"issue":"4","key":"406_CR31","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":"406_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44545-5","volume-title":"Randomness and Completeness in Computational Complexity","author":"D van Melkebeek","year":"2000","unstructured":"van Melkebeek, D.: Randomness and Completeness in Computational Complexity. Springer-Verlag, Berlin (2000)"},{"issue":"26\u201328","key":"406_CR33","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":"406_CR34","doi-asserted-by":"publisher","first-page":"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), 1\u201343 (2017)","journal-title":"J. ACM"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-021-00406-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-021-00406-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-021-00406-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T03:02:55Z","timestamp":1646881375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-021-00406-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,23]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1007\/s00446-021-00406-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,23]]},"assertion":[{"value":"13 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}