arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1105.0392cs.CG
收藏

少切换的运动目标跟踪

Tracking Moving Objects with Few Handovers

David Eppstein, Michael T. Goodrich, Maarten Löffler

摘要:

我们研究了移动点在基站区域内的在线分配问题,例如移动对象可以表示手机,基站可以表示手机信号塔的覆盖区域。我们的目标是最小化当点移动到其指定区域之外并且必须被指定到新区域时发生的重复次数。我们研究这个问题的竞争分析,我们衡量我们的算法的竞争力的比率作为一个功能的层系统的区域,即,覆盖任何一个点的区域的最大数量。在这个问题的离线版本中,当对象运动是已知的,提前,一个简单的贪婪策略足以确定一个最佳的分配对象的基站,尽可能少的干扰。对于这个问题的移动点在一维的在线版本,我们提出了一个确定性的算法,实现了竞争比O(日志层)相对于最佳算法,我们表明,没有更好的比例是可能的。对于两个或两个以上的维度,我们提出了一个随机化的在线算法,实现了O(日志层)的竞争比相对于最佳算法,和一个确定性的算法,实现了O(层)的竞争比;再次,我们表明,没有更好的比例是可能的。

英文摘要:

We study the online problem of assigning a moving point to a base-station region that contains it. For instance, the moving object could represent a cellular phone and the base station could represent the coverage zones of cell towers. Our goal is to minimize the number of handovers that occur when the point moves outside its assigned region and must be assigned to a new region. We study this problem in terms of competitive analysis and we measure the competitive ratio of our algorithms as a function of the ply of the system of regions, that is, the maximum number of regions that cover any single point. In the offline version of this problem, when object motions are known in advance, a simple greedy strategy suffices to determine an optimal assignment of objects to base stations, with as few handovers as possible. For the online version of this problem for moving points in one dimension, we present a deterministic algorithm that achieves a competitive ratio of O(log ply) with respect to the optimal algorithm, and we show that no better ratio is possible. For two or more dimensions, we present a randomized online algorithm that achieves a competitive ratio of O(log ply) with respect to the optimal algorithm, and a deterministic algorithm that achieves a competitive ratio of O(ply); again, we show that no better ratio is possible.

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

↑