Abstract

A highly efficient implementation method for distributed fusion in sensor networks based on CPHD filters is proposed to address the issues of unknown cross-covariance fusion estimation and long fusion times in multi-sensor distributed fusion. This method can effectively and efficiently fuse multi-node information in multi-target tracking applications. Discrete gamma cardinalized probability hypothesis density (DG-CPHD) can effectively reduce the computational burden while ensuring computational accuracy similar to that of CPHD filters. Parallel inverse covariance intersection (PICI) can effectively avoid solving high-dimensional weight coefficient convex optimization problems, reduce the computational burden, and efficiently implement filtering fusion strategies. The effectiveness of the algorithm is demonstrated through simulation results, which indicate that PICI-GM-DG-CPHD can substantially reduce the computational time compared to other algorithms and is more suitable for distributed sensor fusion.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call