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

DOI10.1016/S0378-4754(01)00293-2zbMath0992.65059OpenAlexW2064997761MaRDI QIDQ5944024

Liang Chen, Naoyuki Tokuda

Publication date: 25 March 2002

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4754(01)00293-2

zbMATH Keywords

computational complexityglobal minimumbearings-only measurementsdata assignment algorithmGauss-Newton downhill type algorithmHungarian algorithmmaximum likelihood relation methodmulti-target motion trackingrotational sorting-based algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

A multi-objective-ACO-based data association method for bearings-only multi-target tracking ⋮ A study on two measurements-to-tracks data assignment algorithms ⋮ Data association approaches in bearings-only multi-target tracking ⋮ A new algorithm of bearings-only multi-target tracking of bistatic system

Uses Software

• Algorithm 548

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The auction algorithm: A distributed relaxation method for the assignment problem
• A unified framework for primal-dual methods in minimum cost network flow problems
• Efficient dual simplex algorithms for the assignment problem
• Signature Methods for the Assignment Problem
• A new relaxation algorithm and passive sensor data association

This page was built for publication: A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements