Multitarget tracking algorithm parallelization for distributed-memory computing systems

We present a robust scalable parallelization of a multitarget tracking algorithm developed for air traffic surveillance. We couple the state estimation and data association problems by embedding an interacting multiple model (IMM) state estimator into an optimization-based assignment framework. A SP...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:High-Performance Distributed Computing, 5th International Symposium On: HPDC-5 s. 412 - 421
Hlavní autori: Popp, R.L., Pattipati, K.R., Bar-Shalom, Y., Gassner, R.R.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1996
Predmet:
Computer interfaces
Concurrent computing
Cost function
Distributed computing
Heuristic algorithms
Radar tracking
Robustness
State estimation
Surveillance
Traffic control
ISBN:0818675829, 9780818675829
ISSN:1082-8907
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present a robust scalable parallelization of a multitarget tracking algorithm developed for air traffic surveillance. We couple the state estimation and data association problems by embedding an interacting multiple model (IMM) state estimator into an optimization-based assignment framework. A SPMD distributed-memory parallelization is described wherein the interface to the optimization problem, namely computing the rather numerous gating and IMM state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the assignment problem), is parallelized. We describe several heuristic algorithms developed for the inherent task allocation problem wherein the problem is one of assigning track tasks, having uncertain processing costs and negligible communication costs, across a set of homogeneous processors to minimize workload imbalances. Using a measurement database based on two FAA air traffic central radars, courtesy of Rome Laboratory, we show that near linear speedups are obtainable on a 32-node Intel Paragon supercomputer using simple task allocation algorithms.
Bibliografia:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:0818675829
9780818675829
ISSN:1082-8907
DOI:10.1109/HPDC.1996.546212