Coverage Path Planning for Surveying Disjoint Areas

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages899-904
Number of pages6
ISBN (Print)9781538613535
DOIs
StatePublished - 31 Aug 2018
Event2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018 - Dallas, United States
Duration: 12 Jun 201815 Jun 2018

Publication series

Name2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018

Conference

Conference2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018
Country/TerritoryUnited States
CityDallas
Period12/06/1815/06/18

Fingerprint

Dive into the research topics of 'Coverage Path Planning for Surveying Disjoint Areas'. Together they form a unique fingerprint.

Cite this