arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.02059math.OC
收藏

最大信息量的观察者路径规划

Observer Path Planning for Maximum Information

C. Yalçın Kaya

摘要:

本文研究的是如何找到一个观测器或传感器以恒定速度运动的最优路径,即只使用方位角测量来估计静止目标的位置。所生成的路径是最佳的,在这个意义上,沿着路径,信息,并因此采用的潜在的估计器的效率,是最大化的。换句话说,在某种意义上,如果观察者路径最大化信息,使得目标的位置以最小的不确定性估计,则该观察者路径被认为是最优的。我们制定这个问题作为一个最优控制问题最大化的Fisher信息矩阵,这是一个可能的措施的信息的行列式。我们使用最大值原理推导出最优性的分析结果。我们进行了数值实验,并讨论了多个(局部)最优解获得。我们检查图形的最优性的必要条件验证的数值解。最后,我们为未来的工作提供了一个全面的可能的扩展列表。

英文摘要:

This paper is concerned with finding an optimal path for an observer, or sensor, moving at a constant speed, which is to estimate the position of a stationary target, using only bearing angle measurements. The generated path is optimal in the sense that, along the path, information, and thus the efficiency of a potential estimator employed, is maximized. In other words, an observer path is deemed optimal if it maximizes information so that the location of the target is estimated with smallest uncertainty, in some sense. We formulate this problem as an optimal control problem maximizing the determinant of the Fisher information matrix, which is one of the possible measures of information. We derive analytical results for optimality using the Maximum Principle. We carry out numerical experiments and discuss the multiple (locally) optimal solutions obtained. We check graphically that the necessary conditions of optimality are verified by the numerical solutions. Finally we provide a comprehensive list of possible extensions for future work.

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

↑