Change search
ReferencesLink to record
Permanent link

Direct link
Search path generation with UAV applications using approximate convex decomposition
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This work focuses on the problem that pertains to area searching with UAVs. Specifically developing algorithms that generate flight paths that are short with- out sacrificing flyability. For instance, very sharp turns will compromise flyability since fixed wing aircraft cannot make very sharp turns. This thesis provides an analysis of different types of search methods, area decompositions, and combi- nations thereof. The search methods used are side to side searching and spiral searching. In side to side searching the aircraft goes back and forth only making 90-degree turns. Spiral search searches the shape in a spiral pattern starting on the outer perimeter working its way in. The idea being that it should generate flight paths that are easy to fly since all turns should be with a large turn radii. Area decomposition is done to divide complex shapes into smaller more manage- able shapes. The report concludes that with the implemented methods the side to side scanning method without area decomposition yields good and above all very reliable results. The reliability stems from the fact that all turns are 90 degrees and that algorithm never get stuck or makes bad mistakes. Only having 90 degree turns results in only four different types of turns. This allows the airplanes behav- ior along the route to be predictable after flying the first four turns. Although this assumes that the strength of the wind is a greater influence than the turbulences effect on the aircraft’s flight characteristics. This is a very valuable feature for an operator in charge of a flight. The other tested methods and area decompositions often yield a shorter flight path, however, despite extensive adjustments to the algorithms they never came to handle all cases in a satisfactory manner. These methods may also generate any kind of turn at any time, including turns of nearly 180 degrees. These turns can lead to an airplane missing the intended flight path and thus missing to scan the intended area properly. Area decomposition proves to be really effective only when the area has many protrusions that stick out in different directions, think of a starfish shape. In these cases the side to side algo- rithm generate a path that has long legs over parts that are not in the search area. When the area is decomposed the algorithm starts with, for example, one arm of the starfish at a time and then search the rest of the arms and body in turn. 

Place, publisher, year, edition, pages
2012. , 52 p.
Keyword [en]
UAV Search area planning approximate convex decomposition
National Category
Other Computer and Information Science
URN: urn:nbn:se:liu:diva-77353ISRN: LiTH-ISY-EX--12/4553--SEOAI: diva2:526417
External cooperation
Instrument Control Sweden AB
Subject / course
Automatic Control
2012-03-30, Algoritmen, Mäster Mattiasvägen, Linköping, 10:00 (English)
Available from: 2012-05-14 Created: 2012-05-11 Last updated: 2012-05-14Bibliographically approved

Open Access in DiVA

Search path generation with UAV applications using approximate convex decomposition(2419 kB)555 downloads
File information
File name FULLTEXT01.pdfFile size 2419 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Öst, Gustav
By organisation
Automatic ControlThe Institute of Technology
Other Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 555 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 306 hits
ReferencesLink to record
Permanent link

Direct link