Skip to main content

Distributed Multi-sensor Target Tracking

  • Chapter
  • First Online:
Target Tracking with Random Finite Sets
  • 172 Accesses

Abstract

The RFS-based multi-target tracking algorithms introduced in the previous chapters are mainly aimed at a single sensor. The recent advances in sensor networking technology have given rise to the development of large-scale sensor networks composed of interconnected nodes (or agents) with sensing, communication and processing capabilities. Given all sensor data, one of the ways of establishing the posterior density of the multi-target state is to send all measurements from all sensing systems to a central station for fusion. Although this centralized scheme is optimal, it is required to send all measurements to a single station, which may result in a heavy communication burden. Moreover, since the entire network will stop working once the central station fails, this method makes the sensor network vulnerable. Another method is to treat each sensing system as a node in the distributed system. These nodes collect and process measurements locally to obtain local estimates, and then these local estimates (rather than original measurements) are periodically broadcast to other nodes for data fusion across the entire network. This method is referred to as the distributed fusion.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    If the sum of all rows and columns of a non-negative square matrix \({\varvec{\varOmega}}\) is 1, then \({\varvec{\varOmega}}\) is said to be a doubly stochastic matrix. Further, if there is an integer \(m\) such that all elements of \({\varvec{\varOmega}}^{m}\) strictly positive, then \({\varvec{\varOmega}}\) is said to be a primitive matrix.

  2. 2.

    It shall be noted that, the weighting operator \(\odot\) is only defined for strictly positive scalars. However, in (12.6.2), some scalar weights \(\omega_{i,j,c}\) are allowed to be 0. It can be understood as follows: once \(\omega_{i,j,c}\) is equal to 0, the corresponding multi-target density \(\pi_{j} (X)\) will be ignored when using the information fusion operator \(\oplus\). This is always feasible, because there is always a strictly positive weight \(\omega_{i,j,c}\) for each \(i \in {\mathcal{S}}\) and each \(c\).

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2023 National Defense Industry Press

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Wu, W., Sun, H., Zheng, M., Huang, W. (2023). Distributed Multi-sensor Target Tracking. In: Target Tracking with Random Finite Sets. Springer, Singapore. https://doi.org/10.1007/978-981-19-9815-7_12

Download citation

Publish with us

Policies and ethics