论文标题
站起来放纵集合
Stand Up Indulgent Rendezvous
论文作者
论文摘要
我们考虑了在连续的欧几里得空间中进化的两个移动遗忘机器人。我们要求两个机器人解决集合问题（在同一地点开会，事先在同一地点开会），尽管这些机器人之一可能会崩溃。集合会站起来，因为当崩溃发生时，正确的机器人仍然必须在其最后一个位置上遇到坠机机器人。我们表征了可以解决问题的系统假设，并提出了一系列解决可能情况问题的算法。
We consider two mobile oblivious robots that evolve in a continuous Euclidean space. We require the two robots to solve the rendezvous problem (meeting in finite time at the same location, not known beforehand) despite the possibility that one of those robots crashes unpredictably. The rendezvous is stand up indulgent in the sense that when a crash occurs, the correct robot must still meet the crashed robot on its last position. We characterize the system assumptions that enable problem solvability, and present a series of algorithms that solve the problem for the possible cases.
