{"id":{"repo_id":"uno","oai_identifier":"oai:scholarworks.uno.edu:td-1197"},"canonical_url":"https://search.dev.ndltd.org/etd/uno/oai:scholarworks.uno.edu:td-1197","repository":{"repo_id":"uno","name":"University of New Orleans","base_url":"https://scholarworks.uno.edu/do/oai/"},"display":{"title":"A Comparison of Multiple-Model Target Tracking Algorithms","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Pitre, Ryan"],"institution":null,"degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Li, X. Rong","Chen, Huimin","Jilkov, Vesselin"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004-12-17T08:00:00Z","date_published":"2004-12-17T08:00:00Z","updated_at":"2026-07-24T05:28:04Z","subjects":["Target tracking","Multiple model"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.uno.edu/td/193","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Li, X. Rong","Chen, Huimin","Jilkov, Vesselin"]},{"key":"dc:creator","label":"Author","values":["Pitre, Ryan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Target tracking","Multiple model"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.uno.edu/td/193"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["A Comparison of Multiple-Model Target Tracking Algorithms"]}]}],"canonical_facts":{"dc:contributor":["Li, X. Rong","Chen, Huimin","Jilkov, Vesselin"],"dc:creator":["Pitre, Ryan"],"dc:description.abstract":["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."],"dc:identifier":["https://scholarworks.uno.edu/td/193"],"dc:subject":["Target tracking","Multiple model"],"dc:title":["A Comparison of Multiple-Model Target Tracking Algorithms"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."]},"updated_at":"2026-07-24T05:28:04Z"}