TY - GEN
T1 - Self-stabilizing localization of the middle point of a line segment by an oblivious robot with limited visibility
AU - Monde, Akihiro
AU - Yamauchi, Yukiko
AU - Kijima, Shuji
AU - Yamashita, Masafumi
N1 - Funding Information:
Acknowledgement. This work is partly supported by JSPS KAKENHI Grant Numbers 15K15938 and 17K19982.
Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - This paper poses a question about a simple localization problem, which is arisen from self-stabilizing location problems by oblivious mobile autonomous robots with limited visibility. The question is if an oblivious mobile robot on a line-segment can localize the middle point of the line-segment in finite steps observing the direction (i.e., Left or Right) and distance to the nearest end point. This problem is also akin to (a continuous version of) binary search, and could be closely related to computable real functions. Contrary to appearances, it is far from trivial if this simple problem is solvable or not, and unsettled yet. This paper is concerned with three variants of the original problem, minimally relaxing, and presents self-stabilizing algorithms for them. We also show an easy impossibility theorem for bilaterally symmetric algorithms.
AB - This paper poses a question about a simple localization problem, which is arisen from self-stabilizing location problems by oblivious mobile autonomous robots with limited visibility. The question is if an oblivious mobile robot on a line-segment can localize the middle point of the line-segment in finite steps observing the direction (i.e., Left or Right) and distance to the nearest end point. This problem is also akin to (a continuous version of) binary search, and could be closely related to computable real functions. Contrary to appearances, it is far from trivial if this simple problem is solvable or not, and unsettled yet. This paper is concerned with three variants of the original problem, minimally relaxing, and presents self-stabilizing algorithms for them. We also show an easy impossibility theorem for bilaterally symmetric algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85032677839&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85032677839&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-69084-1_12
DO - 10.1007/978-3-319-69084-1_12
M3 - Conference contribution
AN - SCOPUS:85032677839
SN - 9783319690834
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 172
EP - 186
BT - Stabilization, Safety, and Security of Distributed Systems - 19th International Symposium, SSS 2017, Proceedings
A2 - Tsigas, Philippas
A2 - Spirakis, Paul
PB - Springer Verlag
T2 - 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2017
Y2 - 5 November 2017 through 8 November 2017
ER -