arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.05294cs.AIcs.ROeess.SP
收藏

平面图上运动目标的位置预测协同观测

Cooperative Observation of Targets moving over a Planar Graph with Prediction of Positions

Universidade Estadual do Ceará – UECE(塞阿拉州立大学)

José E. B. Maia, Levi P. Figueredo

摘要:

考虑一个有两种类型的代理的团队:目标和观察者。观测器是一种空中无人机,用于观测陆地上移动的目标,其移动受限于在地面上形成平面图的路径。观察者的视野有限,目标不会避开观察者。目标是最大化在观测间隔中观测到的目标数量的积分。利用目标在短期内的未来位置是可预测的这一事实,我们在这篇文章中展示了一种改进的爬山算法,该算法在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.

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

↑