Research On Methods For Handling Uncertain Factors In Tactical Aircraft Flight Mission Planning

With rapid development of the antiaircraft forces and technology, the Tactical Aircraft Mission Planning (TAMP) has played a more and more important role in decision-making processes of air attack. But because of the complexity of battlefield, so many uncertain factors which have a bad influence on the mission planning have been brought in. So how to resolve these uncertain factors becomes a difficult problem. The uncertain factors in the Flight mission planning which is a basic level of function of TAMP are studied in this thesis.The main contributions of this thesis are summarized as follows:(1) On the basis of the analysis of original source, category and influence of uncertainty in this field, the primary uncertain factors which are caused by contingency, partially observable environments and uncertain initial states are modeled, and the methods for handling these uncertain factors are proposed.(2) Based on the analysis of standard planning methods, a method of mission planning based on Contingency Branch Planning is designed. The conception of the Contingency Branch Planning and the detailed design method of planning are introduced particularly. The methods of standard planning are improved. In order to reduce the complexity of resolving problem in planning, this paper introduces a method of Piecewise Planning.(3) In order to handle the bad influence on route planning which is caused by partially observable environments, this paper proposes an algorithm of route planning based on the probabilistic threat exposure map. Probabilistic threat exposure map is used to model the battlefield environment, where all the threat sources are given by their probability distribution functions. From the information of this map, the probability of the mission getting disabled can be easy calculated. In this map, the paper designs an algorithm that is parameterized to change the weighting on finding a shorter route or finding a route that will give smaller probability of getting disabled. At last the algorithm of route planning is simulated particularly in this probabilistic map. The simulation result is analyzed.