Article
Version 1
This version is not peer-reviewed
Quick Path Planning Based on Shortest Path Algorithm for Multi-UAV System in Windy Condition
and
*
Version 1
: Received: 24 August 2021 / Approved: 25 August 2021 / Online: 25 August 2021 (12:03:59 CEST)
How to cite: Zhou, F.; Nie, H. Quick Path Planning Based on Shortest Path Algorithm for Multi-UAV System in Windy Condition. Preprints 2021, 2021080491 Zhou, F.; Nie, H. Quick Path Planning Based on Shortest Path Algorithm for Multi-UAV System in Windy Condition. Preprints 2021, 2021080491
Abstract
A graph based path planning method consisting of off-line part and on-line part for multi-UAV system in windy condition is proposed. In the off-line part, the task area is divided into grids. When two nodes is close enough, they are connected and weighted by the cost, obtained by solving an optimization problem based on difference method, between them. In order to ensure the accuracy of the difference method, the adjacent radius is set to be small enough. In order to ensure the generated paths close to analytical solution, the grid size is set to be much smaller than the adjacent radius. The shortest path algorithm is used to update the adjacent matrix and path matrix. In the on-line part, the target position assignment and optimal velocity can be obtained by accessing the adjacent matrix and path matrix. At the end of this paper, some numerical examples are taken to illustrate the validity of our method and the influence of the parameters.
Keywords
Path planning; Multi-UAV system; Shortest path algorithm
Subject
Engineering, Control and Systems Engineering
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
