arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.5166cs.MAcs.CGcs.DScs.ROmath.PR
收藏

多智能体会合问题的一种变体

A variant of the multi-agent rendezvous problem

Chalmers University Of Technology(查尔姆斯理工大学);University of Gothenburg(哥德堡大学)

Peter Hegarty, Anders Martinsson, Dmitry Zhelezov

摘要:

经典的多智能体会合问题需要一个确定性算法,通过该算法,分散在平面上的$n$点可以以恒定的速度移动并在一个点处合并,假设每个点在做出决策时只能使用它看到的其他点的位置,并且可见性图作为一个整体是连接的。在此类算法的时间复杂度分析中,通常只考虑所需的计算轮数,而不考虑每轮的计算量。本文考虑半径为$n$的圆盘上独立均匀随机分布的$Ω(n^2 \log n)$点,并假设每个点在单位距离内不仅能看见,而且原则上还能与其他点通信,寻求一个渐近几乎必然(a.a.s.)在时间上运行O(n),换句话说,在时间上与圆盘的半径成线性关系,而不是与点数成线性关系。在一组精确的假设下,关于相邻点的通信能力,我们描述了一个算法,a.a.s.时间复杂度为O(n),如果点数是$o(n^3)$。对今后的工作提出了几个问题。

英文摘要:

The classical multi-agent rendezvous problem asks for a deterministic algorithm by which $n$ points scattered in a plane can move about at constant speed and merge at a single point, assuming each point can use only the locations of the others it sees when making decisions and that the visibility graph as a whole is connected. In time complexity analyses of such algorithms, only the number of rounds of computation required are usually considered, not the amount of computation done per round. In this paper, we consider $Ω(n^2 \log n)$ points distributed independently and uniformly at random in a disc of radius $n$ and, assuming each point can not only see but also, in principle, communicate with others within unit distance, seek a randomised merging algorithm which asymptotically almost surely (a.a.s.) runs in time O(n), in other words in time linear in the radius of the disc rather than in the number of points. Under a precise set of assumptions concerning the communication capabilities of neighboring points, we describe an algorithm which a.a.s. runs in time O(n) provided the number of points is $o(n^3)$. Several questions are posed for future work.

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

↑