.png){kind=icon}
.png){kind=icon}
Return
Model-Based Local Path Planning for UAVs
.png){kind=icon}
PRE
AI
DOI：10.1007/s10846-014-0097-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Autonomous aviation continuously becomes more and more important. Algorithms that enable this autonomy have developed quickly in the last years. This paper describes a concept for a reactive path planning algorithm. The aim is to develop a method for static obstacle avoidance of an unmanned aerial vehicle (UAV) by calculating collision-free paths within the field of view of a UAV's obstacle detection sensor. In contrast to other algorithms, this method considers the properties of the obstacle detection sensors, plans paths that the UAV is able to track, and is applied in three-dimensional space without access to an inner loop controller. In this work we represent the field of view of a UAV as a grid map and apply the wavefront algorithm as the local path planning algorithm. We reduce the configuration space of UAVs within the field of view by calculating an approximated worst-case reachable set based on a linearized reference model. We evaluate the method with approximated specifications for the unmanned helicopters ARTIS and Yamaha RMAX, and with specifications for the obstacle detection sensors LIDAR - and stereo camera. Experiments show that this method is able to generate collision-free paths in a region constricted by obstacles.
Keywords:
Obstacle avoidance
Wavefront algorithm
Reachable set
Grid map
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
2.8
Papers:
3.8K
Citations:
6.9K