Papers
Topics
Authors
Recent
Search
2000 character limit reached

Observer Path Planning for Maximum Information

Published 2 Mar 2021 in math.OC | (2103.02059v2)

Abstract: 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.

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.