{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T11:04:46Z","timestamp":1784372686090,"version":"3.55.0"},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"7","license":[{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,7,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We consider a strong variant of the crash fault-tolerant gathering problem called Stand-Up Indulgent Gathering (SUIG), by robots endowed with limited visibility sensors and lights on line-shaped networks. In this problem, a group of mobile robots must eventually gather at a single location, not known beforehand, regardless of the occurrence of crashes. Differently from previous work that considered unlimited visibility, we assume that robots can observe nodes only within a certain fixed distance (i.e. they are myopic), and emit a visible color from a fixed set (i.e. they are luminous), without multiplicity detection. We consider algorithms depending on two parameters related to the initial configuration: $M_{\\mathrm{init}}$, which denotes the number of nodes between two border nodes, and $O_{\\mathrm{init}}$, which denotes the number of nodes hosting robots. Then, a border node is a node hosting one or more robots that cannot see other robots on at least one side. Our main contribution is to prove that, if $M_{\\mathrm{init}}$ or $O_{\\mathrm{init}}$ is odd, SUIG can be solved in the fully synchronous model even if crashes occur at a node at any phase of execution (i.e. including within the LCM cycle).<\/jats:p>","DOI":"10.1093\/comjnl\/bxag015","type":"journal-article","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T12:43:41Z","timestamp":1770209021000},"page":"1122-1132","source":"Crossref","is-referenced-by-count":0,"title":["Stand-up indulgent gathering on lines for myopic luminous robots"],"prefix":"10.1093","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0612-5616","authenticated-orcid":false,"given":"Quentin","family":"Bramas","sequence":"first","affiliation":[{"name":"Department of Computer Science , University of Strasbourg, ICube, CNRS, 300 Bd S\u00e9bastien Brant, 67412, Illkirch-Graffenstaden,","place":["France"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1087-410X","authenticated-orcid":false,"given":"Hirotsugu","family":"Kakugawa","sequence":"additional","affiliation":[{"name":"Faculty of Advanced Science and Technology , Ryukoku University, 1-5 Yokotani, Seta Oe, Otsu, Shiga, 520-2194,","place":["Japan"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1716-3028","authenticated-orcid":false,"given":"Sayaka","family":"Kamei","sequence":"additional","affiliation":[{"name":"Graduate School of Advanced Science and Engineering , Hiroshima University, 1-7-1 Kagamiyama, Higashi Hiroshima, Hiroshima, 739-8521,","place":["Japan"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7774-8402","authenticated-orcid":false,"given":"Anissa","family":"Lamani","sequence":"additional","affiliation":[{"name":"Department of Computer Science , University of Strasbourg, ICube, CNRS, 300 Bd S\u00e9bastien Brant, 67412, Illkirch-Graffenstaden,","place":["France"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9400-1095","authenticated-orcid":false,"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[{"name":"Faculty of Engineering , Fukui University of Technology, Gakuen 3-6-1, Fukui-shi, Fukui 910-8505,","place":["Japan"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1414-8033","authenticated-orcid":false,"given":"Masahiro","family":"Shibata","sequence":"additional","affiliation":[{"name":"Graduate school of Computer Science and Systems Engineering , Kyushu Institute of Technology, 680-4 Kawazu, Iizuka, Fukuoka, 820-8502,","place":["Japan"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0948-7172","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[{"name":"Sorbonne University , CNRS, LIP6, IUF, 4 place Jussieu, 75005 Paris,","place":["France"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"2026071806511507700_ref1","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"},{"key":"2026071806511507700_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11072-7","volume-title":"Distributed Computing By Mobile Entities, Current Researchin Moving and Computing","author":"Flocchini","year":"2019"},{"key":"2026071806511507700_ref3","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.ipl.2014.11.001","article-title":"Impossibility of gathering, a certification","volume":"115","author":"Courtieu","year":"2015","journal-title":"Inf Process Lett"},{"key":"2026071806511507700_ref4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-030-11072-7_10","article-title":"Fault-tolerant mobile robots","volume-title":"Distributed Computing by Mobile Entities, Current Research in Moving and Computing","author":"D\u00e9fago","year":"2019"},{"key":"2026071806511507700_ref5","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":"2026071806511507700_ref6","first-page":"337","article-title":"Gathering of mobile robots tolerating multiple crash faults","volume-title":"2013 IEEE 33rd International Conference on Distributed Computing Systems (ICDCS)","author":"Bouzid","year":"2013"},{"key":"2026071806511507700_ref7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-25258-2_22","article-title":"Wait-free gathering without chirality","volume-title":"22nd Structural Information and Communication Complexity (SIROCCO)","author":"Bramas","year":"2015"},{"key":"2026071806511507700_ref8","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"},{"key":"2026071806511507700_ref9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-64348-5_4","article-title":"Stand up indulgent rendezvous","volume-title":"Stabilization, Safety, and Security of Distributed Systems (SSS)","author":"Bramas","year":"2020"},{"key":"2026071806511507700_ref10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-030-89240-1_2","volume-title":"Stand Up Indulgent Gathering. Algorithms for Sensor Systems (ALGOSENSORS)","author":"Bramas","year":"2021"},{"key":"2026071806511507700_ref11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.tcs.2022.10.015","article-title":"Stand up indulgent gathering","volume":"939","author":"Bramas","year":"2023","journal-title":"Theor Comput Sci"},{"key":"2026071806511507700_ref12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-31277-0_7","article-title":"Continuous vs. discrete asynchronous moves: a certified approach for mobile robots","volume-title":"Networked Systems (NETYS), Revised Selected Papers, September","author":"Balabonski","year":"2019"},{"key":"2026071806511507700_ref13","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-031-44274-2_34","article-title":"Stand-up indulgent gathering on lines","volume-title":"Stabilization, Safety, and Security of Distributed Systems (SSS)","author":"Bramas","year":"2023"},{"key":"2026071806511507700_ref14","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114796","article-title":"Stand-up indulgent gathering on lines","volume":"1016","author":"Bramas","year":"2024","journal-title":"Theor Comput Sci"},{"key":"2026071806511507700_ref15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-031-60603-8_7","article-title":"Stand-up indulgent gathering on rings","volume-title":"Structural Information and Communication Complexity (SIROCCO)","author":"Bramas","year":"2024"},{"key":"2026071806511507700_ref16","first-page":"46","article-title":"Asynchronous ring gathering by oblivious robots with limited vision","volume-title":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops (SRDSW)","author":"Kamei","year":"2014"},{"key":"2026071806511507700_ref17","first-page":"27:1","article-title":"Gathering on rings for myopic asynchronous robots with lights","volume-title":"23rd International Conference on Principles of Distributed Systems (OPODIS), Dagstuhl, Germany, February, Leibniz International Proceedings in Informatics (LIPIcs)","author":"Kamei","year":"2020"},{"key":"2026071806511507700_ref18","doi-asserted-by":"publisher","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":"Theor Comput Syst"},{"key":"2026071806511507700_ref19","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-031-57853-3_10","article-title":"Stand-up indulgent gathering on lines for myopic luminous robots","volume-title":"Advanced Information Networking and Applications (AINA)","author":"Bramas","year":"2024"},{"key":"2026071806511507700_ref20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-030-03232-6_20","article-title":"Ring exploration with myopic luminous robots","volume-title":"Stabilization, Safety, and Security of Distributed Systems (SSS) Lecture Notes in Computer Science","author":"Ooshita","year":"2018"},{"key":"2026071806511507700_ref21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","article-title":"Gathering asynchronous oblivious mobile robots in a ring","volume":"390","author":"Klasing","year":"2008","journal-title":"Theor Comput Sci"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/7\/1122\/67076132\/bxag015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/7\/1122\/67076132\/bxag015.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T10:51:24Z","timestamp":1784371884000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/69\/7\/1122\/8495067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,23]]},"references-count":21,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2026,2,23]]},"published-print":{"date-parts":[[2026,7,14]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxag015","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,7]]},"published":{"date-parts":[[2026,2,23]]}}}