{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T11:15:59Z","timestamp":1774005359851,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T00:00:00Z","timestamp":1769644800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"publisher","award":["218001"],"award-info":[{"award-number":["218001"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["25K03079"],"award-info":[{"award-number":["25K03079"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["25K03078"],"award-info":[{"award-number":["25K03078"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115776","type":"journal-article","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T07:44:53Z","timestamp":1769759093000},"page":"115776","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Gathering semi-synchronously scheduled two-state robots"],"prefix":"10.1016","volume":"1068","author":[{"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"}]},{"given":"Koichi","family":"Wada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115776_bib0001","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1137\/S009753979628292X","article-title":"Distributed anonymous mobile robots: formation of geometric patterns","volume":"28","author":"Suzuki","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.115776_bib0002","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/050645221","article-title":"Fault-tolerant gathering algorithms for autonomous mobile robots","volume":"36","author":"Agmon","year":"2006","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115776_bib0003","series-title":"The 33rd Int. Conf. on Distributed Computing Systems","first-page":"334","article-title":"Gathering of mobile robots tolerating multiple crash faults","author":"Bouzid","year":"2013"},{"issue":"4","key":"10.1016\/j.tcs.2026.115776_bib0004","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/100796534","article-title":"Distributed computing by mobile robots: gathering","volume":"41","author":"Cieliebak","year":"2012","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115776_bib0005","series-title":"23rd ACM SPAA","first-page":"139","article-title":"A tight run-time bound for synchronous gathering of autonomous robots with limited visibility","author":"Degener","year":"2011"},{"key":"10.1016\/j.tcs.2026.115776_bib0006","series-title":"25th DISC","first-page":"330","article-title":"Brief announcement: the BG-simulation for Byzantine mobile robots","author":"Izumi","year":"2011"},{"key":"10.1016\/j.tcs.2026.115776_bib0007","series-title":"18th SIROCCO","first-page":"150","article-title":"Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection","author":"Kamei","year":"2011"},{"issue":"1","key":"10.1016\/j.tcs.2026.115776_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1462187.1462196","article-title":"Using eventually consistent compasses to gather memory-less mobile robots with limited visibility","volume":"4","author":"Souissi","year":"2009","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"key":"10.1016\/j.tcs.2026.115776_bib0009","series-title":"Distributed Computing by Oblivious Mobile Robots","author":"Flocchini","year":"2012"},{"key":"10.1016\/j.tcs.2026.115776_bib0010","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.tcs.2015.09.018","article-title":"Autonomous mobile robots with lights","volume":"609","author":"Das","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115776_bib0011","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.tcs.2016.01.025","article-title":"Rendezvous with constant memory","volume":"621","author":"Flocchini","year":"2016","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2026.115776_bib0012","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/70.795787","article-title":"A distributed memoryless point convergence algorithm for mobile robots with limited visibility","volume":"15","author":"Ando","year":"1999","journal-title":"IEEE Trans. Rob. Autom."},{"issue":"1","key":"10.1016\/j.tcs.2026.115776_bib0013","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-017-0293-3","article-title":"Gathering of robots on meeting-points","volume":"31","author":"Cicerone","year":"2018","journal-title":"Distrib. Comput."},{"issue":"15","key":"10.1016\/j.tcs.2026.115776_bib0014","doi-asserted-by":"crossref","first-page":"1516","DOI":"10.1137\/S0097539704446475","article-title":"Convergence properties of the gravitational algorithms in asynchronous robot systems","volume":"34","author":"Cohen","year":"2005","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/j.tcs.2026.115776_bib0015","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s00446-019-00359-x","article-title":"Self-stabilizing gathering of mobile robots under crash or Byzantine faults","volume":"33","author":"D\u00e9fago","year":"2020","journal-title":"Distrib. Comput."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.115776_bib0016","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","article-title":"Gathering of asynchronous robots with limited visibility","volume":"337","author":"Flocchini","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115776_bib0017","series-title":"Proc. 23rd Int. Conference on Principles of Distributed Systems (OPODIS)","first-page":"25:1","article-title":"On memory, communication, and synchronous schedulers when moving and computing","author":"Flocchini","year":"2019"},{"key":"10.1016\/j.tcs.2026.115776_bib0018","series-title":"21st DISC","first-page":"298","article-title":"Gathering autonomous mobile robots with dynamic compasses: an optimal result","author":"Izumi","year":"2007"},{"issue":"1","key":"10.1016\/j.tcs.2026.115776_bib0019","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/100797916","article-title":"The gathering problem for two oblivious robots with unreliable compasses","volume":"41","author":"Izumi","year":"2012","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/j.tcs.2026.115776_bib0020","first-page":"2096","article-title":"The multi-agent rendezvous problem. Parts 1 and 2","volume":"46","author":"Lin","year":"2007","journal-title":"SIAM J. Comput."},{"issue":"114198","key":"10.1016\/j.tcs.2026.115776_bib0021","article-title":"Optimal Rendezvous L-algorithms for asynchronous mobile robots with external-lights","volume":"979","author":"Okumura","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115776_bib0022","series-title":"26th International Symposium on Distributed Computing (SSS 2024)","first-page":"39","article-title":"Invited paper: gathering oblivious robots in the plane","volume":"14931","author":"Frei","year":"2024"},{"key":"10.1016\/j.tcs.2026.115776_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114162","article-title":"Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality","volume":"977","author":"Bramas","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115776_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114143","article-title":"Perpetual torus exploration by myopic luminous robots","volume":"976","author":"Darwich","year":"2023","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115776_bib0025","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/s00224-024-10199-3","article-title":"Gathering on rings for myopic asynchronous robots with lights","volume":"69","author":"Kamei","year":"2025","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.115776_bib0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114198","article-title":"Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights","volume":"979","author":"Okumura","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115776_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114723","article-title":"Mutual visibility of luminous robots despite angular inaccuracy","volume":"1011","author":"Pramanick","year":"2024","journal-title":"Theor. Comput. Sci."},{"issue":"241\u2013261","key":"10.1016\/j.tcs.2026.115776_bib0028","article-title":"Gathering problems for autonomous mobile robots with lights","volume":"941","author":"Terai","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115776_bib0029","series-title":"Proc. 23rd Int. Symposium (SSS)","first-page":"410","article-title":"Asynchronous gathering algorithms for autonomous mobile robots with lights","author":"Nakai","year":"2021"},{"key":"10.1016\/j.tcs.2026.115776_bib0030","series-title":"LATIN 2004: Theoretical Informatics","first-page":"577","article-title":"Gathering non-oblivious robots","author":"Cieliebak","year":"2004"},{"key":"10.1016\/j.tcs.2026.115776_bib0031","series-title":"39th International Symposium on Distributed Computing (DISC 2025)","first-page":"57:1","article-title":"Brief announcement: the virtue of self-consistency","volume":"356","author":"Frei","year":"2025"},{"key":"10.1016\/j.tcs.2026.115776_bib0032","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.tcs.2008.07.026","article-title":"Arbitrary pattern formation by asynchronous oblivious robots","volume":"407","author":"Flocchini","year":"2008","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115776_bib0033","series-title":"Distributed Computing by Oblivious Mobile Robots","author":"Flocchini","year":"2022"},{"key":"10.1016\/j.tcs.2026.115776_bib0034","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.tcs.2016.01.025","article-title":"Rendezvous with constant memory","volume":"621","author":"Flocchini","year":"2016","journal-title":"Theor. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000356?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000356?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T09:07:49Z","timestamp":1773997669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":34,"alternative-id":["S0304397526000356"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115776","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Gathering semi-synchronously scheduled two-state robots","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115776","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115776"}}