Computationally Efficient Obstacle Avoidance Trajectory Planner for UAVs Based on Heuristic Angular Search Method
Han Chen, Peng Lu

TL;DR
This paper introduces a fast, real-time obstacle avoidance trajectory planner for UAVs using a heuristic angular search method, optimized for safety and efficiency in cluttered unknown environments.
Contribution
It presents a novel, computationally efficient trajectory planner with a heuristic angular search method tailored for UAV obstacle avoidance in unknown environments.
Findings
Average control output time per iteration is less than 18 ms
The planner performs well in simulation tests
Enhanced safety techniques increase feasible trajectory chances
Abstract
For accomplishing a variety of missions in challenging environments, the capability of navigating with full autonomy while avoiding unexpected obstacles is the most crucial requirement for UAVs in real applications. In this paper, we proposed such a computationally efficient obstacle avoidance trajectory planner that can be used in cluttered unknown environments. Because of the narrow view field of single depth camera on a UAV, the information of obstacles around is quite limited thus the shortest entire path is difficult to achieve. Therefore we focus on the time cost of the trajectory planner and safety rather than other factors. This planner is mainly composed of a point cloud processor, a waypoint publisher with Heuristic Angular Search(HAS) method and a motion planner with minimum acceleration optimization. Furthermore, we propose several techniques to enhance safety by making the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Robotics and Sensor-Based Localization · Guidance and Control Systems
