Study On Flight Planning Methods Based Voronoi Graph Algorithms

Route planning is optimal design under certain constraints on the aircraft’s flight pathfrom the starting location to the target location (the shortest distance, maximum security,minimum fuel consumption, etc.).Used for fighter aircraft, UAVs can also be used in nuclearsubmarines, missiles, and robots. This article describes a method of route planning is mainlyused in transport, the main purpose is based on the no-fly zone point target location, combinedwith our aircraft mission requirements and the destination location plan a safe and efficientpath. Safe and efficient route planning can maximize the transport capacity transport aircraftto reduce unnecessary material loss.Voronoi diagram is a concept in computational geometry, surveying the area calledThiessen polygons. It is a continuous straight line by a polygon set-point connection betweentwo adjacent perpendicular bisector of the composition is formed. Voronoi diagram incomputational geometry to solve to find the nearest point, n-point convex hull, and the treeproblem. In this application the main parent polygon characteristic point farthest from theedge of the polygon is formed, the network structure of the initial path.This paper describes the development process of transport and route planning, and thenintroduces the theorem of the nature and development, and the application and developmentof geographic information systems Voronoi diagram, then describe how the nature of Voronoidiagram constructed in GIS initial path network; and describes the various types of pathalgorithm, comparing various algorithms which select the appropriate algorithm, and thengenerate efficient and reliable alternative path; finally selected depending on the purpose andpoint of the mandate from the no-fly alternative paths to complete the entire route of theoptimal path planning tasks.In this paper, the completion of the work:1.Algorithms for route planning and route analysis filtering algorithms, Voronoi diagrammethod and choose the path Dijkstra Algorithm;2. Establish a no-fly zone to the target point for the generation point Voronoi diagram;3.Path analysis based on Voronoi diagram network, shortest path search;4.Use ArcgisEngine secondary development of software design route display software.