ICUAS 2019 Paper Abstract

Close

Paper ThA4.4

Cabreira, Tauã (Universidade Federal de Pelotas), Di Franco, Carmelo (University of Virginia), Ferreira Jr., Paulo R. (Universidade Federal de Pelotas), Buttazzo, Giorgio (Scuola Superiore Sant'Anna)

Grid-Based Coverage Path Planning with Minimum Energy Over Irregular-Shaped Areas with UAVs

Scheduled for presentation during the Regular Session "Energy Efficient UAS" (ThA4), Thursday, June 13, 2019, 11:00−11:20, Savannah

2020 International Conference on Unmanned Aircraft Systems (ICUAS), June 11-14, 2019, Athens, Greece

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

Keywords Energy Efficient UAS, Path Planning, UAS Applications

Abstract

Grid-based methods have been proposed to solve the Coverage Path Planning problem using Unmanned Aerial Vehicles in irregular-shaped areas since simple geometric flight patterns, such as the back-and-forth, are inefficient in this type of scenario. However, the grid-based methods usually apply simplistic cost functions and demand high computational time leading to inefficient and expensive paths, making them not usable in real-world scenarios. This paper introduces an energy-aware grid-based approach aimed at minimizing energy consumption during mapping missions over irregular-shaped areas. Our work was built upon a previously proposed grid-based approach. Here we introduce an energy-aware cost function based on an accurate energy model. The proposed approach was able to save up to 17% of energy in real flight experiments, proving that the original cost function was not capable of finding the optimal solution in terms of real energy measurements. Additional simulation experiments were also performed to state the energy savings in different irregular-shaped scenarios. As a further contribution, we also applied two pruning techniques to the original approach dropping the computation time up to 99%.

 

 

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-25  15:40:06 PST  Terms of use