Local Path Planning and Obstacle Avoidance for an Omnicopter

A 6D-DWA Algorithm for Real-time Omnidirectional Navigation

Master Thesis (2026)
Author(s)

M.K. Heliński (TU Delft - Aerospace Engineering)

Contributor(s)

M.D. Pavel – Graduation committee member (TU Delft - Control & Simulation)

C. de Wagter – Graduation committee member (TU Delft - Control & Simulation)

M. Popovic – Mentor (TU Delft - Control & Simulation)

Spilios Theodoulis – Mentor (TU Delft - Control & Simulation)

Faculty
Aerospace Engineering
More Info
expand_more
Publication Year
2026
Language
English
Graduation Date
05-03-2026
Awarding Institution
Delft University of Technology
Programme
['Aerospace Engineering | Control & Simulation']
Faculty
Aerospace Engineering
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

As omnidirectional UAVs become increasingly prevalent, computationally efficient path planning algorithms are required to facilitate their autonomous traversal of dynamic environments. This thesis presents a real-time local path planning algorithm for an omnicopter, adapted from the Dynamic Window Approach into a 6D-DWA implementation. To ensure computational efficiency, the local path planner incorporates environment voxelisation, a 10-sphere omnicopter structure approximation, and adaptive velocity sampling. The avoidance of dynamic obstacles, detected via depth camera, is facilitated through context-aware 6D-DWA weight adjustments and a separate integrated fast-evasion strategy. Simulation testing in Gazebo demonstrates that the 6D-DWA is a feasible local planning solution, consistently performing below the 0.2 s real-time threshold. Future research into algorithm hybridisation may further mitigate the system's limited foresight and enhance the replanning capabilities.

Files

License info not available