ICUAS 2021 Paper Abstract

Close

Paper FrA3.5

Aiello, Giuseppe (Politecnico di Torino), Valavanis, Kimon P. (University of Denver), Rizzo, Alessandro (Politecnico di Torino)

3D Real-Time Energy Efficient Path Planning for a Fleet of Fixed-Wing UAVs

Scheduled for presentation during the Regular Session "Path Planning VI" (FrA3), Friday, June 18, 2021, 10:20−10:40, Edessa

2021 International Conference on Unmanned Aircraft Systems (ICUAS), June 15-18, 2021, Athens, Greece

This information is tentative and subject to change. Compiled on April 24, 2024

Keywords Path Planning, Swarms, See-and-avoid Systems

Abstract

UAV path planning requires finding an optimal (or sub-optimal) collision free path in a cluttered environment, while taking into account geometric, physical and temporal constraints, eventually allowing UAVs to perform their tasks despite several uncertainty sources. This paper reviews the current state-of-the-art in path planning, and subsequently introduces a novel node-based algorithm based on the called EEA*. EEA* is based on the A* Search algorithm and aims at mitigating some of its key limitations. The proposed EEA* deals with 3D environments, it provides robustness quickly converging to the solution, it is energy efficient and it is real-time implementable and executable. Along with the proposed EEA*, a local path planner is developed to cope with unknown dynamic threats in the environment. Applicability and effectiveness is first demonstrated via simulated experiments using a fixed-wing UAV that operates in different mountain-like 3D environments in the presence of several unknown dynamic obstacles. Then, the algorithm is applied in a multi-agent setting with three UAVs that are commanded to follow their respective paths in a safe way. The energy efficiency of the EEA* algorithm has also been tested and compared with the conventional A* algorithm.

 

 

All Content © PaperCept, Inc.

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2024 PaperCept, Inc.
Page generated 2024-04-24  18:13:27 PST  Terms of use