Online Replanning of Time-Efficient Flight Paths for Unmanned Rotorcraft

• Published in: Journal of intelligent & robotic systems 2016-12, Vol.84 (1-4), p.277-296
• Main Authors: Schopferer, Simon, Adolf, Florian M.
• Format: Article
• Language: English
• Subjects: Artificial Intelligence; Control; Electrical Engineering; Engineering; Feasibility; Flight paths; Mechanical Engineering; Mechatronics; Obstacles; Onboard; Path planning; Robotics; Rotorcraft; Unknown environments; Unmanned helicopters
• ISSN: 0921-0296; 1573-0409
• DOI: 10.1007/s10846-015-0297-9

Onboard and online flight path planning for small-scale unmanned rotorcraft requires efficient algorithms in order to meet real-time constraints. In a priori unknown environment, rapid replanning is necessary in order to maintain a safe clearance when new obstacles are detected. The complexity of the planning problem varies vastly with the required flight path qualities and the complexity of the environment. In most scenarios flight paths should be smooth and time-efficient and always feasible to fly. Therefore, the rotorcraft’s flight dynamics must be accounted for. Decoupled planning approaches have been proven to solve this problem very efficiently by dividing the problem into sequentially solvable subproblems. However, this computational efficiency comes at the cost of having to compromise on the flight path quality. In this work, we present a decoupled planning approach that has been integrated with our midiARTIS helicopter in order to perform onboard path planning when flying through a priori unknown environment. The approach involves roadmap-based global path planning and local path refinement with cubic splines. It allows to plan safe, dynamically feasible and time-efficient flight paths with limited onboard processing power. We present simulation results from a set of benchmark scenarios in complex urban terrain as well as results from flight testing of a closed-loop obstacle avoidance maneuver with virtual obstacle mapping. Our results demonstrate that close-to-optimal flight paths can be planned with a decoupled planning approach, if heuristics and simplifications for each planning step are carefully chosen.