The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A generalized S-D assignment algorithm for multisensor-multitarget state estimation
Abstract
We develop a new algorithm to associate measurements from multiple sensors to identify the real targets in a surveillance region, and to estimate their states at any given time. The central problem in a multisensor-multitarget state estimation problem is that of data association-the problem of determining from which target, if any, a particular measurement originated. The data association problem is formulated as a generalized S-dimensional (S-D) assignment problem, which is NP-hard for S/spl ges/3 sensor scans (i.e., measurement lists). We present an efficient and recursive generalized S-D assignment algorithm (S/spl ges/3) employing a successive Lagrangian relaxation technique, with application to the localization of an unknown number of emitters using multiple high frequency direction finder sensors (S=3, 5, and 7).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1979) · Cited by 43,841
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
(2014) · Developing Nonprofit and Human Service Leaders: Essential Knowledge and Skills · doi:10.4135/9781483388007.n5 · Cited by 3,811
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“Comparison of Row-Column and Relaxation Algorithms row-column algorithm [ 25 , 29].”
MethodMultitarget-Multisensor Tracking: Principles and Techniques
Bar-Shalom, Y., & Rong-Li, X. (1995) · Cited by 2,155
Self-citationBranch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
Multiple-Target Tracking with Radar Applications
Blackman, S. S. (1986) · Medical Entomology and Zoology · Cited by 1,217
ZhouJiongpan (1995) · 中国邮电高校学报:英文版 · Cited by 1,109
Multiple Target Tracking with Radar Applications
Cooper, D. C. (1987) · Electronics and Power · doi:10.1049/ep.1987.0251 · Cited by 1,087
Principles of Artificial Intelligence
(1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767059 · Cited by 847
The auction algorithm: A distributed relaxation method for the assignment problem
Bertsekas, D. P. (1988) · Annals of Operations Research · doi:10.1007/bf02186476 · Cited by 634
Linear Network Optimization: Algorithms and Codes.
Wagner, D. K., & Bertsekas, D. P. (1993) · Mathematics of Computation · doi:10.2307/2153140 · Cited by 321
A new relaxation algorithm and passive sensor data association
Pattipati, K. R., Deb, S., Bar-Shalom, Y., & Washburn, R. B. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.121621 · Cited by 280
Self-citationTracking and classifying multiple targets without a priori identification
Mori, S., Chong, C.-Y., Tse, E. T. S., & Wishner, R. P. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104306 · Cited by 159
Poore, A. B., & Rijavec, N. (1993) · SIAM Journal on Optimization · doi:10.1137/0803027 · Cited by 134
Parallelization of a multiple model multitarget tracking algorithm with superlinear speedups
Popp, R. L., Pattipati, K. R., Bar‐Shalom, Y., & Yeddanapudi, M. (1997) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.570784 · Cited by 17
Self-citation
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
Overview of Environment Perception for Intelligent Vehicles
Zhu, H., Yuen, K.-V., Mihaylova, L., & Leung, H. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2017.2658662 · Cited by 386
Message Passing Algorithms for Scalable Multitarget Tracking
Meyer, F., Kropfreiter, T., Williams, J. L., Lau, R., Hlawatsch, F., Braca, P., & Win, M. Z. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2789427 · Cited by 355
Resolving motion correspondence for densely moving points
Veenman, C. J., Reinders, M. J. T., & Backer, E. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.899946 · Cited by 344
A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors
Meyer, F., Braca, P., Willett, P., & Hlawatsch, F. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2688966 · Cited by 230
Metadata
- Authors
- Deb, S., Yeddanapudi, M., Pattipati, K., & Bar-Shalom, Y.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 1997-04
- Volume
- 33
- Issue
- 2
- Pages
- 523-538
- ISSN
- 0018-9251 (ISSN-L)
- OpenAlex
- W2168688492
- Cited by
- 415
- References
- 20
- FWCI
- 5.23
- 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
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.