多目标环境下多保护目标跟踪的划分策略与任务分配
Partitioning Strategies and Task Allocation for Target-tracking with Multiple Guards in Polygonal Environments
摘要:
本文提出了一种算法,部署一队{ \it免费}警卫配备全方位摄像机跟踪一个有限的速度入侵者内一个简单连接的多边形环境。该算法将环境划分为更小的多边形,并为每个分区分配一个守卫,以便入侵者始终对至少一个守卫可见。基于本文提出的{ \it动态区域}的概念,我们提出了事件触发的防御策略来跟踪入侵者。我们发现,部署的算法跟踪警卫的数量严格小于$\lfloor {\frac{n}{3}} \rfloor$这是足够的,有时是必要的覆盖范围。我们推导出成功跟踪所需的移动警卫的速度上界,这取决于入侵者的速度,移动警卫的路线图,和几何环境。最后,我们将上述分析扩展到正交多边形,并表明部署用于跟踪的警卫数量的上限严格小于$\lfloor {\frac{n}{4}} \rfloor$,这是足够的,有时是必要的覆盖问题。
英文摘要:
This paper presents an algorithm to deploy a team of {\it free} guards equipped with omni-directional cameras for tracking a bounded speed intruder inside a simply-connected polygonal environment. The proposed algorithm partitions the environment into smaller polygons, and assigns a guard to each partition so that the intruder is visible to at least one guard at all times. Based on the concept of {\it dynamic zones} introduced in this paper, we propose event-triggered strategies for the guards to track the intruder. We show that the number of guards deployed by the algorithm for tracking is strictly less than $\lfloor {\frac{n}{3}} \rfloor$ which is sufficient and sometimes necessary for coverage. We derive an upper bound on the speed of the mobile guard required for successful tracking which depends on the intruder's speed, the road map of the mobile guards, and geometry of the environment. Finally, we extend the aforementioned analysis to orthogonal polygons, and show that the upper bound on the number of guards deployed for tracking is strictly less than $\lfloor {\frac{n}{4}} \rfloor$ which is sufficient and sometimes necessary for the coverage problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。