UAV Path Planning in Threat Environment: A*-APF Algorithm for Spatio-Temporal Grid Optimization

Résumé fourni par la source

To address low threat avoidance efficiency and poor global path adaptability in UAV path planning under threatening environments, this paper proposes a hybrid A*-Artificial Potential Field (APF) path planning method based on spatio-temporal grid optimization. First, a new global fine-grained spatio-temporal grid system is developed by integrating advantages of GeoSOT binary encoding and BeiDou grid location code subdivision rules, enabling unified modeling of complex spatio-temporal environments. Ground threat and maze scenarios are constructed for verification. Second, traditional A* and APF algorithms are improved: the A* algorithm is enhanced with threat costs, dynamic neighborhood search, and local backtrack mechanisms to address low efficiency and incompatibility with threat avoidance; the APF algorithm is optimized with a dual gravitational field collaboration mechanism and distance-parameter-based repulsive field model to overcome local minima and unreachable goals. Finally, a sliding window-driven path association model achieves seamless collaboration between global and local planning. Experimental results show the proposed method outperforms traditional algorithms in comprehensive performance, with the improved A* algorithm excelling in path length, computation time, threat value, and search nodes, and the improved APF algorithm achieving complete safe obstacle avoidance in dynamic environments. The collaborative mechanism effectively handles complex scenarios.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.