A polynomial-time approximation algorithm for joint probabilistic data association.

Songhwai Oh Shankar Sastry

Published in: ACC (2005)

Keyphrases

polynomial time approximation
learning algorithm
computational complexity
search space
simulated annealing
objective function
optimal solution
np hard
dynamic programming
worst case
convex hull
theoretical analysis
data fusion
kalman filter
approximation algorithms