关键词: 无人作战, 空地异构, 任务规划, 蛇优化算法, A*算法

Abstract:

Compared with the air-based homogeneous unmanned system, the motion capabilities, resource payloads, and combat scenes in the air-ground heterogeneous unmanned system increase the number of constraint conditions and significantly increase the computational complexity of the solution model. The modeling of collaborative combat missions and the efficient solution of large-scale problems are the key issues. With the time, path cost, and reconnaissance benefit as the objective functions, considering the constraints such as the endurance of unmanned platforms, a multi-objective programming model for the reconnaissance missions of an air-ground heterogeneous unmanned system is constructed. Aiming at the urban combat environments with multiple threat zones, considering the path safety and timeliness of unmanned platform missions, the improved A* algorithm path planning strategies for unmanned aerial vehicles and unmanned ground vehicles are proposed. Aiming at the problem that the optimization effect of snake optimizer (SO) is unstable and easy to fall into local optimal solutions, an improved snake optimizer (IMSO) is proposed by combining the particle swarm algorithm and the genetic algorithm. Simulation verification and comparative analysis with existing algorithms are carried out by using Python language to verify the feasibility of the model and the superiority of the algorithm. Solving 10 tasks independently under three different task loads from small to large, the average objective function values of IMSO are 100.11%, 108.99%, and 110.01% of SO, respectively. It can be seen that IMSO can jump out of local optima multiple times, and the stability and final fitness values of the algorithm are better than SO, and is more superior in solving the larger-scale problems.

Key words: unmanned combat, air-ground heterogeneity, mission planning, snake optimization, A* algorithm