Route Planning of Geomagnetic Aided Navigation for Vehicle under Matching Suitability Constraints

摘要

In geomagnetic aided navigation (GAN), the vehicle is expected to traverse the areas with excellent matching suitability in order to obtain high matching precision. The route planning problem under matching suitability constraints is studied based on particle swarm optimization (PSO) algorithm in this article. Firstly, the PSO algorithm is briefly introduced and the expanding space of route nodes is determined with the maneuverability constraints of the vehicle. Then the minimum movement distance, the ability of avoiding threats and the proximity to suitable-matching areas are considered to construct the fitness function of PSO algorithm. Further the route planning method under matching suitability constraints is proposed. Experimental results show that the proposed method is effective, and the vehicle can successfully avoid the threats and can traverse the suitable-matching areas.