站起来放纵的Renminbi
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
