Abstract
The Lagrangian relaxation algorithm is widely used for passive sensor data association. However, there are two major problems about it. Firstly, the cost function of the algorithm is computed by using least square estimation of the target position without taking the estimation errors into account. To solve this problem, a modified cost function is derived which can reflect the correlation between measurements more reasonably owing to the integration of estimation errors. Secondly, due to the fact that building the candidate assignment tree would take a lot of CPU time, we propose a statistic test based on indicator function with a great improvement of the computational efficiency. Simulation results show that both the correlation accuracy and the computational efficiency of the improved relaxation algorithm are higher than that of the traditional one.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Popp, R., Pattipati, K.R., Bar-Shalom, Y.: An M-best multidimensional data association algorithm for multisensor multitarget tracking. IEEE Transactions on Aerospace and Electronic Systems 37(1), 22–39 (2001)
Poore, A., Robertson III, A.J.: A new class of Lagrangian relaxation based algorithms for a class of multidimensional assignment problems. Computational Optimization and Applications 8, 129–150 (1997)
Pattipati, K., Deb, S., Bar-Shalom, Y., Washburn, R.: A new relaxation algorithm and passive sensor data association. IEEE Transactions on Automatic Control 37(2), 197–213 (1992)
Poore, A., Rijavec, N.: A Lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking. SIAM Journal of Optimization 3(3), 544–563 (1993)
Deb, S., Yeddanapudi, M., Pattipati, K., Bar-Shalom, Y.: A generalized S-D assignment algorithm for multisensor-multitarget state estimation. IEEE Transactions on Aerospace and Electronic Systems 33(2), 523–538 (1997)
Kaplan, L., Bar-Shalom, Y., Blair, W.D.: Assignment costs for multiple sensor track-to-track association. IEEE Transactions on Aerospace and Electronic Systems (2008)
Chummun, M.R., Kirubarajan, T., Pattipati, K.R., Bar-Shalom, Y.: Fast Data Association Using Multidimensional Assignment with Clustering. IEEE Transactions on Aerospace and Electronic Systems 37(3), 898–913 (2001)
Bertsekas, D.P.: The auction algorithm: A distributed relaxation method for the assignment problem. Annals of Operat. Res. 14, 105–123 (1988)
Liu, H., Dou, L.-h., Pan, F., Dong, L.-x.: Research on data association in three passive sensors network. In: IEEE International Conference on control and Automation, Guangzhou, China, May 30-June 1, pp. 3235–3238 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ouyang, C., Ji, HB., Yang, JL. (2011). Improved Relaxation Algorithm for Passive Sensor Data Association. In: Hu, W. (eds) Electronics and Signal Processing. Lecture Notes in Electrical Engineering, vol 97. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21697-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-21697-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21696-1
Online ISBN: 978-3-642-21697-8
eBook Packages: EngineeringEngineering (R0)