On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles
This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial vehicles with holonomic constraints in environments with obstacles. Our approach uses Pythagorean Hodograph (PH) curves to connect vertices of the tree, which makes it possible to generate paths for which the main kinematic constraints of the vehicle are not violated. These paths are converted into trajectories based on feasible speed profiles of the robot. The smoothness of the acceleration profile of the vehicle is indirectly guaranteed between two vertices of the RRT tree. The proposed algorithm provides fast convergence to the final trajectory. We still utilize the properties of the RRT to avoid collisions with static, environment bound obstacles and dynamic obstacles, such as other vehicles in the multi-vehicle planning scenario. We show results for a set of small unmanned aerial vehicles in environments with different configurations.
rapidly-exploring random trees multiple uav trajectory planning pythagorean hodograph curves uav swarm