Coverage Path Planning for Surveying Disjoint Areas

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

35 Citas (Scopus)

Resumen

Terrain surveying using unmanned aerial vehicles (UAV) is being applied to many areas such as precision agriculture or battlefield surveillance. A core problem of the surveying task is the coverage path planning problem (CPP); it is defined as the task of determining a path for an unmanned aerial vehicle so that it observes all points of a target area. State-of-the-art planners solve the problem for a unique region. However, in some operations, for example search and rescue, it is important to plan a path that covers more than a single area. We propose a method for solving the CPP for disjoint areas. The general problem is modeled as a rural postman problem which has been demonstrated to be NP-Hard. Our solution relies on dividing the problem into two steps: optimization of the visiting order and optimization of the flight lines orientation. The method is validated through several simulations using real parameters. In addition, it is fast enough for being implemented onboard.

Idioma originalInglés
Título de la publicación alojada2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018
EditorialInstitute of Electrical and Electronics Engineers Inc.
Páginas899-904
Número de páginas6
ISBN (versión impresa)9781538613535
DOI
EstadoPublicada - 31 ago. 2018
Evento2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018 - Dallas, Estados Unidos
Duración: 12 jun. 201815 jun. 2018

Serie de la publicación

Nombre2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018

Conferencia

Conferencia2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018
País/TerritorioEstados Unidos
CiudadDallas
Período12/06/1815/06/18

Huella

Profundice en los temas de investigación de 'Coverage Path Planning for Surveying Disjoint Areas'. En conjunto forman una huella única.

Citar esto