A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements

Liang Chen and Naoyuki Tokuda

Mathematics and Computers in Simulation (MATCOM), 2001, vol. 57, issue 1, 109-120

Abstract: We have proved a new rotational sorting algorithm capable of reducing the complexity of data assignment process embedded in the maximum likelihood (ML)-based solution of a multitarget tracking problem from O(N3) of the conventional Hungarian type routines to O(N2) provided that the bearings-only measurements from an array of passive sensors are free from cluttering and missing data.

Keywords: Bearings-only measurement; Multitarget motion tracking; Data association problem; Hungarian algorithm (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475401002932
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:57:y:2001:i:1:p:109-120

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().