Abstract:

In order to solve the carrier plane moving route planning problem in special hangar environment, a new convex hull algorithm combined with Dijkstra is proposed. Firstly, the mathematic model of the carrier plane moving problem and correlative basic models are established, which supply foundation for the using of the algorithm. Secondly, the executive mechanism of using the convex hull algorithm to plan routes is provided, which is used to establish the carrier plane moving route directed graph. Then the best route could be found by using Dijkstra to operate on the directed graph. Finally, the method is used to solve the carrier plane moving route planning problem in hangar of the Kuznetsov aircraft carrier. Simulation results indicate that the principle of the method is correct and it performs well for getting the best route.