论文标题
合作观察目标，超过平面图，并预测位置
Cooperative Observation of Targets moving over a Planar Graph with Prediction of Positions
论文作者
论文摘要
考虑一个具有两种类型代理的团队：目标和观察者。观察者是空中无人机，观察到目标在陆地上移动的目标限于在表面上形成平面图的路径。观察者的视力范围有限，目标不能避免观察者。目的是最大化观察区间观察到的目标数量的积分。利用这一事实是，短期内目标的未来位置是可以预测的，我们在本文中显示了一种经过修改的爬坡算法，该算法在CTO问题的新环境中超过了其先前版本。
Consider a team with two types of agents: targets and observers. Observers are aerial UAVs that observe targets moving on land with their movements restricted to the paths that form a planar graph on the surface. Observers have limited range of vision and targets do not avoid observers. The objective is to maximize the integral of the number of targets observed in the observation interval. Taking advantage of the fact that the future positions of targets in the short term are predictable, we show in this article a modified hill climbing algorithm that surpasses its previous versions in this new setting of the CTO problem.
