Abstract
In this paper, we investigate different variants of the recently proposed cost-reference particle filters (CRPFs) and study their application to the problem of tracking of a high-speed maneuvering target in the two-dimensional space. CRPFs drop all probabilistic assumptions required by conventional particle filters and, as a consequence, lead to practically more robust algorithms. We introduce some suitable and natural modifications of CRPFs in order to increase their efficiency and reduce their computational complexity. Computer simulations are provided to illustrate the performance of the new alternatives.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
