{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:07Z","timestamp":1750220467197,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP15K15938 and JP17K19982"],"award-info":[{"award-number":["JP15K15938 and JP17K19982"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Theory"],"published-print":{"date-parts":[[2021,9,30]]},"abstract":"<jats:p>\n            This article poses a question about a simple localization problem. The question is if an\n            <jats:italic>oblivious<\/jats:italic>\n            walker on a line segment can localize the midpoint of the line segment in a\n            <jats:italic>finite<\/jats:italic>\n            number of steps observing the direction (i.e., Left or Right) and the distance to the nearest end point. This problem arises from\n            <jats:italic>self-stabilizing<\/jats:italic>\n            location problems by\n            <jats:italic>autonomous mobile robots<\/jats:italic>\n            with\n            <jats:italic>limited visibility<\/jats:italic>\n            , which is an abstract model attracting a wide interest in distributed computing. Contrary to appearances, it is far from trivial whether this simple problem is solvable, and it is not settled yet. This article is concerned with three variants of the problem with a minimal relaxation and presents self-stabilizing algorithms for them. We also show an easy impossibility theorem for bilaterally symmetric algorithms.\n          <\/jats:p>","DOI":"10.1145\/3460954","type":"journal-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T16:04:05Z","timestamp":1626624245000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Can a Skywalker Localize the Midpoint of a Rope?"],"prefix":"10.1145","volume":"13","author":[{"given":"Akihiro","family":"Monde","sequence":"first","affiliation":[{"name":"Kyushu University, Japan"}]},{"given":"Yukiko","family":"Yamauchi","sequence":"additional","affiliation":[{"name":"Kyushu University, Japan"}]},{"given":"Shuji","family":"Kijima","sequence":"additional","affiliation":[{"name":"Kyushu University, Japan"}]},{"given":"Yamashita","family":"Masafumi","sequence":"additional","affiliation":[{"name":"Kyushu University, Japan"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/70.795787"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIC.1995.525098"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008295"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446475"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780823_4"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.007"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/584490.584509"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Leonhard Euler. 1737. Variae observationes circa series infinitas. Commentarii academiae scientiarum Petropolitanae 9 (1744) 160\u2013188. DOI:https:\/\/doi.org\/10.1145\/361179.361202  Leonhard Euler. 1737. Variae observationes circa series infinitas. Commentarii academiae scientiarum Petropolitanae 9 (1744) 160\u2013188. DOI:https:\/\/doi.org\/10.1145\/361179.361202","DOI":"10.1145\/361179.361202"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09620-9_19"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0267-x"},{"volume-title":"Self-deployment algorithms for mobile sensors on a ring. Theor. Comput. Sci. 402, 1, (July","year":"2008","author":"Flocchini Paola","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.01.001"},{"volume-title":"Computing by Mobile Robotic Sensors","author":"Flocchini Paola","key":"e_1_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14849-1_21"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/140958682"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365739"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69084-1_12"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-13157-2"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.03.008"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979628292X"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.037"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3060272"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03578-9_17"}],"container-title":["ACM Transactions on Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460954","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:22Z","timestamp":1750193302000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9,30]]}},"alternative-id":["10.1145\/3460954"],"URL":"https:\/\/doi.org\/10.1145\/3460954","relation":{},"ISSN":["1942-3454","1942-3462"],"issn-type":[{"type":"print","value":"1942-3454"},{"type":"electronic","value":"1942-3462"}],"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2019-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}