2台ロボットの最適集合アルゴリズム
Optimally Gathering Two Robots
非剛体ASYNCモデルで2色ライトと距離測定を用い、2台のロボットを有限時間で集合させる決定的アルゴリズムを提案した。
著者: Adam Heriban, Xavier Défago, Sébastien Tixeuil
分類: cs.DC, cs.CC, cs.DS, cs.RO
原文アブストラクト
We present an algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results, we assume robots are equipped with 2-colors lights and are able to measure distances between one another. Aside from its light, a robot has no memory of its past actions, and its protocol is deterministic. Since, in the same model, gathering is impossible when lights have a single color, our solution is optimal with respect to the number of used colors.
