There are many multiple-model (MM) target-tracking algorithms that are available but there has yet to be a comparison that includes all of them. This work compares seven of the currently most popular MM algorithms in terms of performance, credibility, and computational complexity. The algorithms to be considered are the autonomous multiple-model algorithm, generalized pseudo- Bayesian of first order, generalized pseudo-Bayesian of second order, interacting multiple-model algorithm, B-Best algorithm, Viterbi algorithm, and reweighted interacting multiple-model algorithm. The algorithms were compared using three scenarios consisting of maneuvers that were both in and out of the model set. Based on this comparison, there is no clear-cut best algorithm but the B-best algorithm performs best in terms of tracking errors and the IMM algorithm has the best computational complexity among the algorithms that have acceptable tracking errors.
| Identifer | oai:union.ndltd.org:uno.edu/oai:scholarworks.uno.edu:td-1197 |
| Date | 17 December 2004 |
| Creators | Pitre, Ryan |
| Publisher | ScholarWorks@UNO |
| Source Sets | University of New Orleans |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | University of New Orleans Theses and Dissertations |
Page generated in 0.0024 seconds