Abstract
The Voronoi graph search algorithm is a classic method of UAV path planning. There have been many related mature researches in this field, but most of them are about the design and implementation of this algorithm, few studying the influence of each parameter on the performance of the whole algorithm. In this paper, the establishment of a quantitative model of UAV path planning, algorithm design, performance evaluation and optimization suggestions are discussed, and the impact of the threat proportion and the number of threats on the planning results of this algorithm is mainly studied. Furthermore, we analyze the time distribution among Voronoi graph founding time, Dijkstra planning time, and path smoothing time. The evaluation methods and optimization advice of Voronoi graph search algorithm are given, which can be adopted to other path planning algorithms as well.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
