The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
m-best S-D assignment algorithm with application to multitarget tracking
Abstract
In this paper we describe a novel data association algorithm, termed m-best S-D, that determines in O(mSkn/sup 3/) time (m assignments, S/spl ges/3 lists of size n, k relaxations) the (approximately) m-best solutions to an S-D assignment problem. The m-best S-D algorithm is applicable to tracking problems where either the sensors are synchronized or the sensors and/or the targets are very slow moving. The significance of this work is that the m-best S-D assignment algorithm (in a sliding window mode) can provide for an efficient implementation of a suboptimal multiple hypothesis tracking (MHT) algorithm by obviating the need for a brute force enumeration of an exponential number of joint hypotheses. We first describe the general problem for which the m-best S-D applies. Specifically, given line of sight (LOS) (i.e., incomplete position) measurements from S sensors, sets of complete position measurements are extracted, namely, the 1st, 2nd, ..., mth best (in terms of likelihood) sets of composite measurements are determined by solving a static S-D assignment problem. Utilizing the joint likelihood functions used to determine the m best S-D assignment solutions, the composite measurements are then quantified with a probability of being correct using a JPDA-like (joint probabilistic data association) technique. Lists of composite measurements from successive scans, along with their corresponding probabilities, are used in turn with a state estimator in a dynamic 2-D assignment algorithm to estimate the states of moving targets over time. The dynamic assignment cost coefficients are based on a likelihood function that incorporates the "true" composite measurement probabilities obtained from the (static) m-best S-D assignment solutions. We demonstrate the merits of the m-best S-D algorithm by applying it to a simulated multitarget passive sensor track formation and maintenance problem, consisting of multiple time samples of LOS measurements originating from multiple (S=7) synchronized high frequency direction finding sensors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for tracking multiple targets
Reid, D. (1979) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1979.1102177 · Cited by 3,059
Cited by
Multiple hypothesis tracking for multiple target tracking
Blackman, S. S. (2004) · IEEE Aerospace and Electronic Systems Magazine · doi:10.1109/maes.2004.1263228 · Cited by 1,395
Knowledge-Based Multitarget Ship Tracking for HF Surface Wave Radar Systems
Vivone, G., Braca, P., & Horstmann, J. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2014.2388355 · Cited by 88
Metadata
- Authors
- Popp, R. L., Pattipati, K. R., & Bar-Shalom, Y.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 2001
- Volume
- 37
- Issue
- 1
- Pages
- 22-39
- ISSN
- 0018-9251 (ISSN-L)
- OpenAlex
- W2137688837
- Cited by
- 160
- References
- 1
- FWCI
- 3.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: m-best S-D assignment algorithm with application to multitarget tracking. https://app.cochat.ai/papers/10.1109/7.913665
- The paper
- Popp, R. L., Pattipati, K. R., & Bar-Shalom, Y. (2001). m-best S-D assignment algorithm with application to multitarget tracking. IEEE Transactions on Aerospace and Electronic Systems. https://doi.org/10.1109/7.913665
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.