arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.00880cs.DS
收藏

平面上几乎普遍的匿名Renaissance

Almost Universal Anonymous Rendezvous in the Plane

Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit

摘要:

两个移动代理代表点自由移动的平面和开始在两个不同的位置,必须满足。会议,称为会合,发生时,代理人是在距离最多$r$彼此和永远不会移动后,这一时间,其中$r$是一个积极的真正未知的他们,称为可见性半径。代理是匿名的,并执行相同的确定性算法。每个代理都有一组私有属性,其中一些或全部属性在代理之间可能不同。这些属性是:代理的初始位置、其坐标系(方向和手性)、其时钟的速率、其移动时的速度以及其唤醒时间。如果所有属性(除初始位置外)都相同,并且座席的起始距离大于$r$,则它们永远不会相遇。然而,属性之间的差异使得有时可能打破对称并实现会合。这种集合问题的实例(形式化为属性列表)称为可行的。我们的贡献是三方面的。我们首先给出了一个精确的特征的可行的情况下。因此,很自然地会问,是否存在一个单一的算法,保证所有这些实例的会合。我们给出了一个强有力的否定回答这个问题:我们显示两组$S_1$和$S_2$的可行实例,使他们都不承认一个单一的会合算法有效的所有实例的集合。另一方面,我们构建了一个单一的算法,保证集合$S_1$和$S_2$之外的所有可行实例的会合。我们观察到,这些例外集$S_1$和$S_2$是几何上非常小的,相比于所有可行的实例的集合:它们被包括在后者的低维子空间。因此,我们的会合算法处理所有可行的情况下,除了这些小集的例外,可以公正地称为几乎是普遍的。

英文摘要:

Two mobile agents represented by points freely moving in the plane and starting at two distinct positions, have to meet. The meeting, called rendezvous, occurs when agents are at distance at most $r$ of each other and never move after this time, where $r$ is a positive real unknown to them, called the visibility radius. Agents are anonymous and execute the same deterministic algorithm. Each agent has a set of private attributes, some or all of which can differ between agents. These attributes are: the initial position of the agent, its system of coordinates (orientation and chirality), the rate of its clock, its speed when it moves, and the time of its wake-up. If all attributes (except the initial positions) are identical and agents start at distance larger than $r$ then they can never meet. However, differences between attributes make it sometimes possible to break the symmetry and accomplish rendezvous. Such instances of the rendezvous problem (formalized as lists of attributes), are called feasible. Our contribution is three-fold. We first give an exact characterization of feasible instances. Thus it is natural to ask whether there exists a single algorithm that guarantees rendezvous for all these instances. We give a strong negative answer to this question: we show two sets $S_1$ and $S_2$ of feasible instances such that none of them admits a single rendezvous algorithm valid for all instances of the set. On the other hand, we construct a single algorithm that guarantees rendezvous for all feasible instances outside of sets $S_1$ and $S_2$. We observe that these exception sets $S_1$ and $S_2$ are geometrically very small, compared to the set of all feasible instances: they are included in low-dimension subspaces of the latter. Thus, our rendezvous algorithm handling all feasible instances other than these small sets of exceptions can be justly called almost universal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑