liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Sampling-based Path Planning for an Autonomous Helicopter
2006 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Many of the applications that have been proposed for future small unmanned aerial vehicles (UAVs) are at low altitude in areas with many obstacles. A vital component for successful navigation in such environments is a path planner that can find collision free paths for the UAV.

Two popular path planning algorithms are the probabilistic roadmap algorithm (PRM) and the rapidly-exploring random tree algorithm (RRT).

Adaptations of these algorithms to an unmanned autonomous helicopter are presented in this thesis, together with a number of extensions for handling constraints at different stages of the planning process.

The result of this work is twofold:

First, the described planners and extensions have been implemented and integrated into the software architecture of a UAV. A number of flight tests with these algorithms have been performed on a physical helicopter and the results from some of them are presented in this thesis.

Second, an empirical study has been conducted, comparing the performance of the different algorithms and extensions in this planning domain. It is shown that with the environment known in advance, the PRM algorithm generally performs better than the RRT algorithm due to its precompiled roadmaps, but that the latter is also usable as long as the environment is not too complex. The study also shows that simple geometric constraints can be added in the runtime phase of the PRM algorithm, without a big impact on performance. It is also shown that postponing the motion constraints to the runtime phase can improve the performance of the planner in some cases.

Place, publisher, year, pages
Institutionen för datavetenskap, 2006. 141 p.
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1229
Keyword [en]
Path Planning, Motion Planning, Helicopters, Probabilistic Roadmaps, Rapidly-exploring Random Trees
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-5270 (URN)91–85497–15–0 (ISBN)oai:DiVA.org:liu-5270 (OAI)diva2:21248 (DiVA)
Presentation
2006-02-21, Visionen, B, 581 83, Linköping, 13:15 (English)
Opponent
Supervisors
Note
Report code: LiU–Tek–Lic–2006:10.Available from2006-02-28 Created:2006-02-28 Last updated:2009-03-09

Open Access in DiVA

fulltext(822 kB)2162 downloads
File information
File name FULLTEXT01.pdfFile size 822 kBChecksum MD5
06f30888e98ab6e87285bc3772228b6e8271fbc81e647ef858a355d9af630e087d9111cf
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Pettersson, Per Olof
By organisation
KPLAB - Knowledge Processing LabThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2162 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: 588 hits
ReferencesLink to record
Permanent link

Direct link