21 September 2007 Joint MAP bias estimation and data association: simulations
Author Affiliations +
The problem of joint maximum a posteriori (MAP) bias estimation and data association belongs to a class of nonconvex mixed integer nonlinear programming problems. These problems are difficult to solve due to both the combinatorial nature of the problem and the nonconvexity of the objective function or constraints. Algorithms for this class of problems have been developed in a companion paper of the authors. This paper presents simulations that compare the "all-pairs" heuristic, the k-best heuristic, and a partial A*-based branch and bound algorithm. The combination of the latter two algorithms is an excellent candidate for use in a realtime system. For an optimal algorithm that also computes the k-best solutions of the joint MAP bias estimation problem and data association problem, we investigate a branch and bound framework that employs either a depth-first algorithm or an A*-search procedure. In addition, we demonstrate the improvements due to a new gating procedure.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Scott Danford, Scott Danford, Bret Kragel, Bret Kragel, Aubrey Poore, Aubrey Poore, } "Joint MAP bias estimation and data association: simulations", Proc. SPIE 6699, Signal and Data Processing of Small Targets 2007, 669915 (21 September 2007); doi: 10.1117/12.735225; https://doi.org/10.1117/12.735225


Back to Top