Cooperative and Geometric Learning Algorithm (CGLA) for path planning of UAVs with limited information
MetadataShow full item record
In this paper, we propose a new learning algorithm, named as the Cooperative and Geometric Learning Algorithm (CGLA), to solve problems of maneuverability, collision avoidance and information sharing in path planning for Unmanned Aerial Vehicles (UAVs). The contributions of CGLA are three folds: (1) CGLA is designed for path planning based on cooperation of multiple UAVs. Technically, CGLA exploits a new defined individual cost matrix, which leads to an efficient path planning algorithm for multiple UAVs. (2) The convergence of the proposed algorithm for calculating the cost matrix is proven theoretically, and the optimal path in terms of path length and risk measure from a starting point to a target point can be calculated in polynomial time. (3) In CGLA, the proposed individual weight matrix can be efficiently calculated and adaptively updated based on the geometric distance and risk information shared among UAVs. Finally, risk evaluation is introduced first time in this paper for UAV navigation and extensive computer simulation results validate the effectiveness and feasibility of CGLA for safe navigation of multiple UAVs.
Showing items related by title, author, creator and subject.
Tan, Y.; Song, Y.; Liu, Xin; Wang, X.; Cheng, J. (2016)© 2017 Elsevier B.V.Offshore oil and gas platforms (OOGPs) usually have a lifetime of 30-40. years. An increasing number of OOGPs across the world will be retired and decommissioned in the coming decade. Therefore, a safe ...
Janarthanan, Ayshwarya (2020)This study was to develop a path planning algorithm which identifies the lay-by and the divider on either sides of a path, then calculate and create a central reference line of dots without the need of a center line or ...
Grigoleit, Mark Ted (2008)The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...