In this paper, an optimization technique is developed for providing the globally optimal solution to the maximum likelihood (ML) method for the bearing-only geolocation problem. The ML formulation does not require the a priori knowledge of the distances between the sensor and the emitter. It is formulated as a non-concave fractional programming problem, and a branch and bound algorithm is developed for solving for the globally optimal solution. The algorithm has the property of global convergence and the advantage of computational efficiency. Computer simulations are used to demonstrate the performance of the proposed techniques and comparisons to other methods and the Cramer-Rao lower bounds (CRLBs) are also provided.
A Globally Optimal Solution to Maximum Likelihood Bearing-Only Geolocation
2017-09-01
214025 byte
Conference paper
Electronic Resource
English
6.0203 Maximum Likelihood Geolocation using a Ground Moving Target Indicator (GMTI) Report
British Library Conference Proceedings | 2002
|Maximum likelihood autocalibration
British Library Online Contents | 2011
|Maximum-likelihood estimation optimizer for constrained, time-optimal satellite reorientation
Online Contents | 2014
|