A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
This paper poses a question about a simple localization problem. The question is if an oblivious walker 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 the distance to the nearest end point. This problem is arisen from self-stabilizing location problems by autonomous mobile robots with limited visibility, that is a widely interested abstract model in distributed computing. Contrary to appearances, it is fararXiv:1707.06398v2 fatcat:4stpuitmyzei7iksbslai6sraq