Fixed-wing UAV path planning in a dynamic environment via dynamic RRT algorithm

18Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposed a dynamic RRT algorithm that applied to fixed-wing UAV’s path planning in dynamic three-dimensional environment. The tree structure of the dynamic RRT algorithm was expanded by adopting the constraint equations to satisfy fixed-wing UAV’s actual dynamic constrains. In order to avoid collision with dynamic obstacles, corresponding locations of dynamic obstacles in the time of each step are considered in the algorithm. Also, B-spline was also used to interpolate the resulting optimal path for fixed-wing UAV. As a result, the algorithm could generate a smooth path that satisfy UAV’s dynamic constrains in the three-dimensional environment with static and/or dynamic obstacles. The simulation results showed the effectiveness of proposed dynamic RRT algorithm, indicating that it could be applied to fixed-wing UAV’s path planning in dynamic three-dimensional environment.

Cite

CITATION STYLE

APA

Lu, L., Zong, C., Lei, X., Chen, B., & Zhao, P. (2017). Fixed-wing UAV path planning in a dynamic environment via dynamic RRT algorithm. In Lecture Notes in Electrical Engineering (Vol. 408, pp. 271–282). Springer Verlag. https://doi.org/10.1007/978-981-10-2875-5_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free