{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:25:35Z","timestamp":1743049535203,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031744976"},{"type":"electronic","value":"9783031744983"}],"license":[{"start":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T00:00:00Z","timestamp":1729382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T00:00:00Z","timestamp":1729382400000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74498-3_15","type":"book-chapter","created":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T11:02:30Z","timestamp":1729335750000},"page":"209-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gathering Semi-Synchronously Scheduled Two-State Robots"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2155-6960","authenticated-orcid":false,"given":"Kohei","family":"Otaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1368-3205","authenticated-orcid":false,"given":"Fabian","family":"Frei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5351-1459","authenticated-orcid":false,"given":"Koichi","family":"Wada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,20]]},"reference":[{"issue":"1","key":"15_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)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"15_CR2","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H Ando","year":"1999","unstructured":"Ando, H., Osawa, Y., Suzuki, I., Yamashita, M.: A 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."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In The 33rd International Conference on Distributed Computing Systems, pp. 334\u2013346 (2013)","DOI":"10.1109\/ICDCS.2013.27"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Stefano, D., Navarra, A.: Gathering of robots on meeting-points. Distrib. Comput. 31(1), 1\u201350 (2018)","DOI":"10.1007\/s00446-017-0293-3"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Cieliebak, M.: Gathering non-oblivious robots. In: LATIN 2004: Theoretical Informatics, pp. 577\u2013588 (2004)","DOI":"10.1007\/978-3-540-24698-5_60"},{"issue":"4","key":"15_CR6","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)","journal-title":"SIAM J. Comput."},{"issue":"15","key":"15_CR7","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithms in asynchronous robot systems. SIAM J. Comput. 34(15), 1516\u20131528 (2005)","journal-title":"SIAM J. Comput."},{"key":"15_CR8","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":"15_CR9","doi-asserted-by":"crossref","unstructured":"D\u00e9fago, X., Potop-Butucaru, M., Raipin-Parv\u00e9dy, P.: Self-stabilizing gathering of mobile robots under crash or byzantine faults. Distrib. Comput. 33(5), 393\u2013421 (2020)","DOI":"10.1007\/s00446-019-00359-x"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf\u00a0der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight run-time bound for synchronous gathering of autonomous robots with limited visibility. In 23rd ACM SPAA, pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool (2012)","DOI":"10.1007\/978-3-031-02008-7"},{"issue":"1\u20133","key":"15_CR12","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. Theor. Comput. Sci. 337(1\u20133), 147\u2013169 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR13","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 oblivious robots. Theor. Comput. Sci. 407, 412\u2013447 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.01.025","volume":"621","author":"P Flocchini","year":"2016","unstructured":"Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous with constant memory. Theor. Comput. Sci. 621, 57\u201372 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR15","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), pp. 25:1\u201325:17 (2019)"},{"key":"15_CR16","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Springer Nature (2022)"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.01.025","volume":"621","author":"P Flocchini","year":"2016","unstructured":"Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous with constant memory. Theor. Comput. Sci. 621, 57\u201372 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Izumi, T., Bouzid, Z., Tixeuil, S., Wada, K.: Brief announcement: the BG-simulation for byzantine mobile robots. In: 25th DISC, pp. 330\u2013331 (2011)","DOI":"10.1007\/978-3-642-24100-0_32"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: an optimal result. In: 21st DISC, pp. 298\u2013312 (2007)","DOI":"10.1007\/978-3-540-75142-7_24"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/100797916","volume":"41","author":"T Izumi","year":"2012","unstructured":"Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., D\u00e9fago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26\u201346 (2012)","journal-title":"SIAM J. Comput."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. In: 18th SIROCCO, pp. 150\u2013161 (2011)","DOI":"10.1007\/978-3-642-22212-2_14"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Lin, J., Morse, A.S., Anderson, B.D.O.: The multi-agent rendezvous problem. Parts 1 and 2. SIAM J. Comput. 46(6), 2096\u20132147 (2007)","DOI":"10.1137\/040620552"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Nakai, R., Sudo, Y., Wada, K.: Asynchronous gathering algorithms for autonomous mobile robots with lights. In: Proceedings of 23rd International Symposium (SSS), pp. 410\u2013424 (2021)","DOI":"10.1007\/978-3-030-91081-5_27"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Okumura, T., Wada, K., D\u00e9fago, X.: Optimal rendezvous $$\\cal{L}$$-algorithms for asynchronous mobile robots with external-lights. Theor. Comput. Sci. 979, 114198 (2023)","DOI":"10.1016\/j.tcs.2023.114198"},{"issue":"1","key":"15_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462187.1462196","volume":"4","author":"S Souissi","year":"2009","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Autonom. Adapt. Syst. 4(1), 1\u201327 (2009)","journal-title":"ACM Trans. Autonom. Adapt. Syst."},{"key":"15_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, 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Terai, S., Wada, K., Katayama, Y.: Gathering problems for autonomous mobile robots with lights. Theor. Comput. Sci. 941, 241\u2013261 (2023)","DOI":"10.1016\/j.tcs.2022.11.018"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Viglietta, G.: Rendezvous of two robots with visible bits. In: 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), pp. 291\u2013306 (2013)","DOI":"10.1007\/978-3-642-45346-5_21"}],"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-031-74498-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T22:03:29Z","timestamp":1735596209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74498-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,20]]},"ISBN":["9783031744976","9783031744983"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74498-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,20]]},"assertion":[{"value":"20 October 2024","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":"Nagoya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2024.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}