Walker能定位线段的中点吗？
Can Walker Localize The Middle Point of A Line-segment?
摘要：
本文提出了一个简单的定位问题。问题是线段上的{ \em oblivious}步行者是否可以在观察方向的{ \em有限}步中定位线段的中点（即，左或右）以及到最近端点的距离。该问题是由具有{\em有限可见性}的{ \em自主移动机器人}的{\em自稳定}定位问题引起的，是分布式计算中广泛关注的抽象模型。与表面相反，这个简单的问题是否可解，以及是否尚未解决，这远非小事。本文研究了具有最小松弛的三种变式问题，并给出了它们的自稳定算法。我们还证明了一个简单的双边对称算法的不可能性定理。
英文摘要：
This paper poses a question about a simple localization problem. The question is if an {\em oblivious} walker on a line-segment can localize the middle point of the line-segment in {\em finite} steps observing the direction (i.e., Left or Right) and the distance to the nearest end point. This problem is arisen from {\em self-stabilizing} location problems by {\em autonomous mobile robots} with {\em limited visibility}, that is a widely interested abstract model in distributed computing. 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 problem with a minimal relaxation, and presents self-stabilizing algorithms for them. We also show an easy impossibility theorem for bilaterally symmetric algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
