Abstract
Distributed particle filters (PFs) have received extensive attention because of its excellent performance. Generally, it needs to transmit particles to multiple processing units (PUs) in order to improve the performance. However, how to balance communication costs and computation costs in particle routing is still an open problem. This paper presents a multi-objective discrete particle swarm optimization (PSO) algorithm to solve the problem. In the algorithm, the particle routing problem in distributed PFs is modeled as a multi-objective constrained optimization model for the first time. Following that, an improved hybrid discrete multi-objective PSO is proposed. Two new operators designed based on the problem’s characteristics, that is, a local search strategy based on molecular force and a constraint processing mechanism with greedy search, are developed to improve the performance of the proposed algorithm. By comparing with three commonly used methods on classical particle filters problems, experimental results show that the proposed algorithm is a highly competitive approach, and it can provide multiple high-quality Pareto optimal solutions for decision-makers to meet their different needs.
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.
