A consistent estimation criterion for multisensor bearings-only tracking

• Published in: IEEE transactions on aerospace and electronic systems Vol. 32; no. 1; pp. 108 - 120
• Main Authors: Iltis, R.A., Anderson, K.L.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.01.1996; Institute of Electrical and Electronics Engineers
• Subjects: Applied sciences; Computational modeling; Differential equations; Exact sciences and technology; Lyapunov method; Maximum likelihood estimation; Newton method; Operational research and scientific management; Operational research. Management science; Partitioning algorithms; Simulated annealing; State estimation; Target location and tracking; Target tracking; Yield estimation; Simulation; Estimation; Simulated annealing; Tracking(movable target); Multiple target; Non linear programming; Lyapunov function
• ISSN: 0018-9251; 1557-9603
• DOI: 10.1109/7.481253

The problem of multitarget tracking using bearings-only measurements is addressed, when the number of targets is unknown a priori. The minimum description length (MDL) criterion of Rissanen is first chosen as a natural way to determine the number of targets when a prior distribution is unavailable. However, it is shown that MDL results in inconsistent estimates of the number of targets, and hence a modified estimation criterion, which is shown to yield unbiased target estimates, is proposed. The resulting asymptotically unbiased target identification (AUTI) algorithm corresponds to the computation of joint maximum likelihood (ML) estimates of target states and associations, with an additional penalty term to prevent overparameterization. The problem of data association is solved using a set of parallel simulated annealing algorithms over the sensors and scans. As the associations are formed by annealing, a conventional nonlinear programming algorithm simultaneously estimates the target states (position and velocity). This partitioning is justified by examining the structure of the bearings-only tracking problem under clairvoyant associations; It is shown that the norm squared of the target state error vector is a Lyapunov function for a gradient descent differential equation. As a consequence, an idealized nonlinear programming algorithm (steepest descent with infinitesimal step size) is globally convergent. A practical algorithm is then developed for identification of the number of targets, which combines simulated annealing for associations, and the Gauss-Newton algorithm for target state estimation. Simulation results are presented which compare the tracking performance of the MDL and AUTI algorithms.