ICRA 2011 Paper Abstract


Paper ThA204.5

Huang, Guoquan (University of Minnesota), Zhou, Ke (University of Minnesota), Trawny, Nikolas (Jet Propulsion Laboraty), Roumeliotis, Stergios (University of Minnesota)

Bearing-Only Target Tracking Using a Bank of MAP Estimators

Scheduled for presentation during the Regular Sessions "Sensor Fusion II" (ThA204), Thursday, May 12, 2011, 11:05−11:20, Room 3E

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on May 22, 2019

Keywords Sensor Fusion, Localization


Nonlinear estimation problems, such as bearing-only tracking, are often addressed using linearized estimators, e.g., the extended Kalman filter (EKF). These estimators generally suffer from linearization errors as well as the inability to track multimodal probability density functions (pdfs). In this paper, we propose a bank of batch maximum a posteriori (MAP) estimators as a general estimation framework that provides relinearization of the entire state history, multi-hypothesis tracking, and an efficient hypothesis generation scheme. Each estimator in the bank is initialized using a locally optimal state estimate for the current time step. Every time a new measurement becomes available, we convert the nonlinear cost function corresponding to this relaxed one-step subproblem into polynomial form, allowing to analytically and efficiently compute all stationary points. This local optimization generates highly probable hypotheses for the target trajectory and greatly improves the quality of the overall MAP estimate. Additionally, pruning and marginalization are employed to control the computational cost. Monte Carlo simulations and real-world experiments show that the proposed approach significantly outperforms the EKF, the standard batch MAP estimator, and the particle filter (PF), in terms of accuracy and consistency.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2019 PaperCept, Inc.
Page generated 2019-05-22  23:55:21 PST  Terms of use