Optimal Polygon Decomposition for UAV Survey Coverage Path Planning in Wind

Matthew Coombes, Tom Fletcher, Wen Hua Chen, Cunjia Liu

Research output: Contribution to journalArticlepeer-review

44 Citations (SciVal)


In this paper, a new method for planning coverage paths for fixed-wing Unmanned Aerial Vehicle (UAV) aerial surveys is proposed. Instead of the more generic coverage path planning techniques presented in previous literature, this method specifically concentrates on decreasing flight time of fixed-wing aircraft surveys. This is achieved threefold: by the addition of wind to the survey flight time model, accounting for the fact fixed-wing aircraft are not constrained to flight within the polygon of the region of interest, and an intelligent method for decomposing the region into convex polygons conducive to quick flight times. It is shown that wind can make a huge difference to survey time, and that flying perpendicular can confer a flight time advantage. Small UAVs, which have very slow airspeeds, can very easily be flying in wind, which is 50% of their airspeed. This is why the technique is shown to be so effective, due to the fact that ignoring wind for small, slow, fixed-wing aircraft is a considerable oversight. Comparing this method to previous techniques using a Monte Carlo simulation on randomised polygons shows a significant reduction in flight time.
Original languageEnglish
Pages (from-to)2132
Issue number7
Publication statusPublished - 3 Jul 2018


  • Dynamic Programming
  • Remote Sensing
  • Path Planning
  • UAV

ASJC Scopus subject areas

  • Aerospace Engineering


Dive into the research topics of 'Optimal Polygon Decomposition for UAV Survey Coverage Path Planning in Wind'. Together they form a unique fingerprint.

Cite this