A new relaxation algorithm and passive sensor data association
From MaRDI portal
Publication:3989595
DOI10.1109/9.121621zbMath0768.93012OpenAlexW2002341681MaRDI QIDQ3989595
Somnath Deb, Robert B. jun. Washburn, Krishna R. Pattipati, Yaakov Bar-Shalom
Publication date: 28 June 1992
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.121621
Related Items (9)
A bi-criteria approach for the data association problem ⋮ Information value in nonparametric Dirichlet-process Gaussian-process (DPGP) mixture models ⋮ Branch and bound algorithms for the multidimensional assignment problem ⋮ Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) ⋮ New optimal algorithm of data association for multi-passive-sensor location system ⋮ A novel convex dual approach to three-dimensional assignment problem: theoretical analysis ⋮ A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements ⋮ A dual approach to multi-dimensional assignment problems ⋮ Localization of multiple emitters based on the sequential PHD filter
This page was built for publication: A new relaxation algorithm and passive sensor data association
