Abstract

In a multisensor target tracking system, observations produced by sensors can arrive at a central processor out of sequence. There have been some state estimate update algorithms for out-of-sequence measurements (OOSMs). In this paper, we propose a flight path update algorithm for a sequence with arbitrary delayed OOSMs. The new algorithm has three advantages: (1) it is a globally optimal recursive algorithm; (2) it is an algorithm for arbitrary delayed OOSMs including the case of interlaced OOSMs with less storage, compared with the optimal state update algorithm in Zhang, Li, and Zhu (2005); (3) it can update the current whole flight path in addition to the current single state with less computation, i.e., the dimension of the matrices which need to be inverted is not more than that of the state in the process of updating the past ℓ (lag steps) estimates and corresponding error covariances. Besides, this algorithm can be easily modified to derive a globally optimal flight path update with removing an earlier (incorrectly associated) measurement.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.