{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:06:15Z","timestamp":1780074375991,"version":"3.54.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_18","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:41Z","timestamp":1763409821000},"page":"216-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Computational Power of\u00a0Mobile Robots Under Sequential Schedulers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1813-8056","authenticated-orcid":false,"given":"Caterina","family":"Feletti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3584-5727","authenticated-orcid":false,"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7954-3918","authenticated-orcid":false,"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"issue":"1","key":"18_CR1","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). https:\/\/doi.org\/10.1137\/050645221","journal-title":"SIAM J. Comput."},{"issue":"2","key":"18_CR2","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\u2013117 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Buchin, K., Flocchini, P., Kostitsyna, I., Peters, T., Santoro, N., Wada, K.: Autonomous mobile robots: refining the computational landscape. In: Proceedings of 35th International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 576\u2013585. IEEE (2021). https:\/\/doi.org\/10.1109\/IPDPSW52791.2021.00091","DOI":"10.1109\/IPDPSW52791.2021.00091"},{"key":"18_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/J.IC.2025.105280","volume":"303","author":"K Buchin","year":"2025","unstructured":"Buchin, K., Flocchini, P., Kostitsyna, I., Peters, T., Santoro, N., Wada, K.: On the computational power of energy-constrained mobile robots. Inf. Comput. 303, 105280 (2025). https:\/\/doi.org\/10.1016\/J.IC.2025.105280","journal-title":"Inf. Comput."},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Canepa, D., D\u00e8fago, X., Izumi, T., Potop-Butucaru, M.: Flocking with oblivious robots. In: Proceedings of 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 94\u2013108 (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_8","DOI":"10.1007\/978-3-319-49259-9_8"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"88177","DOI":"10.1109\/ACCESS.2021.3089081","volume":"9","author":"S Cicerone","year":"2021","unstructured":"Cicerone, S., Stefano, G.D., Navarra, A.: Solving the pattern formation by mobile robots with chirality. IEEE Access 9, 88177\u201388204 (2021)","journal-title":"IEEE Access"},{"issue":"4","key":"18_CR7","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(4), 829\u2013879 (2012). https:\/\/doi.org\/10.1137\/100796534","journal-title":"SIAM J. Comput."},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Clemente, S., Feletti, C.: Fault detection and identification by autonomous mobile robots. In: Proceedings of 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND). LIPIcs, vol.\u00a0330, pp. 10:1\u201310:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.SAND.2025.10","DOI":"10.4230\/LIPICS.SAND.2025.10"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: Certified universal gathering in $$R^2$$ for oblivious mobile robots. In: Proceedings of 30th International Symposium on Distributed Computing (DISC), pp. 187\u2013200 (2016)","DOI":"10.1007\/978-3-662-53426-7_14"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"90577","DOI":"10.1109\/ACCESS.2020.2994052","volume":"8","author":"S Das","year":"2020","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N.: Forming sequences of patterns with luminous robots. IEEE Access 8, 90577\u201390597 (2020)","journal-title":"IEEE Access"},{"key":"18_CR11","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). https:\/\/doi.org\/10.1016\/J.TCS.2015.09.018","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00446-014-0220-9","volume":"28","author":"S Das","year":"2014","unstructured":"Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Forming sequences of geometric patterns with oblivious mobile robots. Distrib. Comput. 28(2), 131\u2013145 (2014). https:\/\/doi.org\/10.1007\/s00446-014-0220-9","journal-title":"Distrib. Comput."},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"D\u00e9fago, X., Potop-Butucaru, M., Tixeuil, S.: Fault-tolerant mobile robots. In: Chapter 10 of [18], pp. 234\u2013251. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_10","DOI":"10.1007\/978-3-030-11072-7_10"},{"issue":"4","key":"18_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1452001.1452006","volume":"3","author":"Y Dieudonn\u00e9","year":"2008","unstructured":"Dieudonn\u00e9, Y., Labbani-Igbida, O., Petit, F.: Circle formation of weak mobile robots. ACM Trans. Auton. Adapt. Syst. 3(4), 1\u201320 (2008). https:\/\/doi.org\/10.1145\/1452001.1452006","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1142\/S0129626409000146","volume":"19","author":"Y Dieudonn\u00e9","year":"2009","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Scatter of robots. Parallel Process. Lett. 19(1), 175\u2013184 (2009). https:\/\/doi.org\/10.1142\/S0129626409000146","journal-title":"Parallel Process. Lett."},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Feletti, C., Mambretti, L., Mereghetti, C., Palano, B.: Computational power of autonomous robots: transparency vs. opaqueness. Theor. Comput. Sci. 1036, 115153 (2025). https:\/\/doi.org\/10.1016\/J.TCS.2025.115153","DOI":"10.1016\/J.TCS.2025.115153"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Navarra, A., Pattanayak, D., Piselli, F., Santoro, N.: Oblivious robots under sequential schedulers: universal pattern formation. In: Proceedings of 32nd International Colloquium On Structural Information and Communication Complexity (SIROCCO). LNCS, vol. 15671, pp. 297\u2013314. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-91736-3_18","DOI":"10.1007\/978-3-031-91736-3_18"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing, LNCS, vol. 11340. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7","DOI":"10.1007\/978-3-030-11072-7"},{"issue":"6","key":"18_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00446-016-0291-x","volume":"30","author":"P Flocchini","year":"2016","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: uniform circle formation. Distrib. Comput. 30(6), 413\u2013457 (2016). https:\/\/doi.org\/10.1007\/s00446-016-0291-x","journal-title":"Distrib. Comput."},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Santoro, N., Sudo, Y., Wada, K.: On asynchrony, memory, and communication: separations and landscapes. In: Proceedings of 27th International Conference on Principles of Distributed Systems (OPODIS). LIPIcs, vol.\u00a0286, pp. 28:1\u201328:23 (2023). https:\/\/doi.org\/10.4230\/LIPICS.OPODIS.2023.28","DOI":"10.4230\/LIPICS.OPODIS.2023.28"},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Santoro, N., Wada, K.: On memory, communication, and synchronous schedulers when moving and computing. In: Proceedings of 23rd International Conference on Principles of Distributed Systems (OPODIS). LIPIcs, vol.\u00a0153, pp. 25:1\u201325:17 (2019). https:\/\/doi.org\/10.4230\/LIPICS.OPODIS.2019.25","DOI":"10.4230\/LIPICS.OPODIS.2019.25"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Frei, F., Wada, K.: Brief announcement: distinct gathering under round robin. In: Proceedings of 38th International Symposium on Distributed Computing (DISC). LIPIcs, vol.\u00a0319, pp. 48:1\u201348:8. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2024.48","DOI":"10.4230\/LIPIcs.DISC.2024.48"},{"issue":"3","key":"18_CR23","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.dam.2003.11.010","volume":"144","author":"V Gervasi","year":"2004","unstructured":"Gervasi, V., Prencipe, G.: Coordination without communication: the case of the flocking problem. Disc. Appl. Math. 144(3), 324\u2013344 (2004). https:\/\/doi.org\/10.1016\/j.dam.2003.11.010","journal-title":"Disc. Appl. Math."},{"key":"18_CR24","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., Gradinariu Potop-Butucaru, M., S\u00e9bastien, T.: On time complexity for connectivity-preserving scattering of mobile robots. Theor. Comput. Sci. 738, 42\u201352 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.04.047","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"18_CR25","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/S00446-024-00463-7","volume":"37","author":"DG Kirkpatrick","year":"2024","unstructured":"Kirkpatrick, D.G., Kostitsyna, I., Navarra, A., Prencipe, G., Santoro, N.: On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. Distrib. Comput. 37(3), 279\u2013308 (2024). https:\/\/doi.org\/10.1007\/S00446-024-00463-7","journal-title":"Distrib. Comput."},{"issue":"4","key":"18_CR26","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). https:\/\/doi.org\/10.1137\/S009753979628292X","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:44Z","timestamp":1763409824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}