Research On Integrated Route Planning And Task Assignment Of Air-to-ground Attacking Under Multiple Threats

The capability of air-to-ground attacking is the decisive factor for Air Force to transform from positive defensive type to both offensive and defensive one. It has been attached great important attention by different countries all over the world. Therefore, studying the related technologies of air-to-ground attacking has a great significance to improve our air fighting force. This thesis mainly consider how to effectively use the aerial vehicles to implement air-to-ground attacking task when making the battle plan. The programming of air-to-ground attacking task includes two parts: flight route planning and task assignment. These two parts are not only mutual coupling interconnection but also very complex issues, this thesis particularly consider the practical situation that exists a variety of threats in the battle space, whice makes the difficulties of flight route planning and task assignment significantly increase.A approach for problem of integrated route planning and task assignment was proposed in this thesis,that is:applying route planning approach based on Dynamic Programming(DP) to search routes between any two task-points first,then applying task assignment approach based on the multi-ant-colony algorithm(MACA) to assign task for vehicles.So can deal with the constraints of the vehicles'capabilities and environment in the process of route planning,and deal with the constraints of tasks and cooperation in the process of task assignment.This approach can ensure the programming battle plan is executive,the flight routes conform to the vehicles'capabilities, especially that in the cooperative air-to-ground attacking task,every vehicle abides by the battle plan and the combat effectiveness is maximezed.The common approach at present is using straight line distance or it's approximation to assign tasks, which can't assure the battle plan is optimal,and maybe lead to an unexecutive plan due to incompatible battle plan or outreach of the vehicles'capabilities.In the terms of route planning,this thesis summarizes the basic elements,constraint conditions and typical approaches of vehicle's route planning problem;mainly analyzed the route planning approach and it's key technologies which based on DP, the slanting array of the frontier points and the mechanism of sending message were proposed; the horizontal improve method of routes was proposed. Simulation results show that the route planning approach based on dynamic programming presented in this thesis has a particular charater: it's time complexity only related to the size of the geographic range,not sensitive to the terrain and the ground threats,and this approach is faster and the usual approach when sovling the route planning between multiple points.In the terms of task assignment, this thesis modeling the problem of vehicle's task assignment,and summarize it's usual sovling approach;mainly analyzed the task assignment approach and it's key technologies based on MACA, consider the situation of target's value reduce following the time gone,these were proposed: the selection strategy based on the integrative apability,the dynamic select-set strategy based on the constaints,the transform strategy based on values,the local and the global strategy of pheromone updating,and the operation steps of the algorithm was given.Simulation results show that the approach proposed in this thesis is beneficial to program a cooperative battle plan, and under the constraints listed, this approach can program the optimal battle plan in a short time when exits a little targets in the map,and the sub-optimal battle plan in a short time when exits a number of tartges in the map.