有界地形中的异步确定性交会
Asynchronous deterministic rendezvous in bounded terrains
摘要：
两个移动代理（机器人）必须满足一个先验未知的有界地形建模为多边形，可能与多边形障碍。智能体被建模为点，每个点都配备有指南针。代理人的指南可能是不连贯的。代理构建他们的路线，但每个代理的实际行走是由对手决定的：代理的移动可以是任意的速度，代理有时可能会停止或来回，只要代理在其路线的每一段中的行走是连续的，不离开它并覆盖所有它。我们考虑几种情况，取决于三个因素：（1）地形中是否存在障碍物，（2）两个智能体的罗盘是否一致，（3）智能体是否具有标记有其位置的地形地图。会合算法的成本是最坏情况下的总长度的代理人的轨迹，直到他们的会议。对于每种情况下，我们设计了一个确定性的会合算法，并分析其成本。我们还证明了在每种情况下的任何确定性交会算法的成本的下限。对于所有场景，这些边界都是紧的。
英文摘要：
Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Agents are modeled as points, and each of them is equipped with a compass. Compasses of agents may be incoherent. Agents construct their routes, but the actual walk of each agent is decided by the adversary: the movement of the agent can be at arbitrary speed, the agent may sometimes stop or go back and forth, as long as the walk of the agent in each segment of its route is continuous, does not leave it and covers all of it. We consider several scenarios, depending on three factors: (1) obstacles in the terrain are present, or not, (2) compasses of both agents agree, or not, (3) agents have or do not have a map of the terrain with their positions marked. The cost of a rendezvous algorithm is the worst-case sum of lengths of the agents' trajectories until their meeting. For each scenario we design a deterministic rendezvous algorithm and analyze its cost. We also prove lower bounds on the cost of any deterministic rendezvous algorithm in each case. For all scenarios these bounds are tight.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
