Quadrotor Trajectory Planning with Tetrahedron Partitions and B-Splines in Unknown and Dynamic Environments

被引:0
作者
Men, Jiayu [1 ]
Carrion, Jesus Requena [1 ]
机构
[1] Queen Mary Univ London, Sch Elect Engn & Comp Sci, Mile End Rd, London E1 4NS, England
关键词
trajectory planning; aerial vehicles; quadratic programming; B-spline function-based trajectory;
D O I
10.3390/robotics14010003
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Trajectory planning is a key task in unmanned aerial vehicle navigation systems. Although trajectory planning in the presence of obstacles is a well-understood problem, unknown and dynamic environments still present significant challenges. In this paper, we present a trajectory planning method for unknown and dynamic environments that explicitly incorporates the uncertainty about the environment. Assuming that the position of obstacles and their instantaneous movement are available, our method represents the environment uncertainty as a dynamic map that indicates the probability that a region might be occupied by an obstacle in the future. The proposed method first divides the free space into non-overlapping tetrahedral partitions using Delaunay triangulation. Then, a topo-graph that describes the topology of the free space and incorporates the uncertainty of the environment is created. Using this topo-graph, an initial path and a safe flight corridor are obtained. The initial safe flight corridor provides a sequence of control points that we use to optimize clamped B-spline trajectories by formulating a quadratic programming problem with safety and smoothness constraints. Using computer simulations, we show that our algorithm can successfully find a collision-free and uncertainty-aware trajectory in an unknown and dynamic environment. Furthermore, our method can reduce the computational burden caused by moving obstacles during trajectory replanning.
引用
收藏
页数:18
相关论文
共 27 条
  • [1] [Anonymous], Intel realsense depth camera d400
  • [2] COMPUTING DIRICHLET TESSELLATIONS
    BOWYER, A
    [J]. COMPUTER JOURNAL, 1981, 24 (02) : 162 - 166
  • [3] Bryce I., 2016, P AIAA MOD SIM TECHN, DOI [10.2514/6.2016-3675, DOI 10.2514/6.2016-3675]
  • [4] Chen J, 2016, IEEE INT CONF ROBOT, P1476, DOI 10.1109/ICRA.2016.7487283
  • [5] Computing Large Convex Regions of Obstacle-Free Space Through Semidefinite Programming
    Deits, Robin
    Tedrake, Russ
    [J]. ALGORITHMIC FOUNDATIONS OF ROBOTICS XI, 2015, 107 : 109 - 124
  • [6] Dragan Anca D., 2011, IEEE International Conference on Robotics and Automation, P4582
  • [7] Gao F., 2016, P 2016 IEEE INT S SA
  • [8] Gao F, 2018, IEEE INT CONF ROBOT, P344
  • [9] Gao F, 2017, IEEE INT C INT ROBOT, P3681, DOI 10.1109/IROS.2017.8206214
  • [10] Planning Dynamically Feasible Trajectories for Quadrotors Using Safe Flight Corridors in 3-D Complex Environments
    Liu, Sikang
    Watterson, Michael
    Mohta, Kartik
    Sun, Ke
    Bhattacharya, Subhrajit
    Taylor, Camillo J.
    Kumar, Vijay
    [J]. IEEE ROBOTICS AND AUTOMATION LETTERS, 2017, 2 (03): : 1688 - 1695