A Polynomial Time Algorithm for the Multidimensional Assignment Problem in Multiple Sensor Environments

@inproceedings{Capponi2004APT,
  title={A Polynomial Time Algorithm for the Multidimensional Assignment Problem in Multiple Sensor Environments},
  author={Agostino Capponi and Huub W. de Waard},
  year={2004}
}
This is the first half of a two-part paper devoted to the multidimensional assignment problem (MDA) in multiple target tracking. Here a new polynomial-time algorithm for solving the MDA problem is proposed. The dimension of the formulated assignment problem is given by two parameters: the number of available sensors and the last time instant when association decisions are revokable. This algorithm is then used in the companion paper [4] where a decomposition approach aiming at reducing the… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

A polynomial algorithm for the data association problem in multitarget tracking

  • A. Capponi
  • Submitted to IEEE Transaction on Aerospace and…
  • 2004
Highly Influential
4 Excerpts

A new algorithm for the generalized multidimensional assignment problem

  • K. R. Pattipati, Y. Bar-Shalom
  • To appear in Information Fusion
  • 2004

Design and Analysis of Modern Tracking Systems

  • S. S. Blackman, R.Popoli
  • 1999
1 Excerpt

An algorithm for tracking multiple targets

  • D. B. Reid
  • IEEE Transactions on Automatic Control , Vol. AC…
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…