障碍物
计算机科学
弹道
稳健性(进化)
计算
数学优化
水准点(测量)
运动规划
规划师
冗余(工程)
欧几里德距离
功能(生物学)
欧几里德几何
算法
机器人
控制理论(社会学)
数学
人工智能
几何学
法学
化学
生物
操作系统
生物化学
控制(管理)
大地测量学
进化生物学
政治学
物理
天文
基因
地理
作者
Xin Zhou,Zhepei Wang,Hongkai Ye,Chao Xu,Fei Gao
标识
DOI:10.1109/lra.2020.3047728
摘要
Gradient-based planners are widely used for quadrotor local planning, in which a Euclidean Signed Distance Field (ESDF) is crucial for evaluating gradient magnitude and direction. Nevertheless, computing such a field has much redundancy since the trajectory optimization procedure only covers a very limited subspace of the ESDF updating range. In this letter, an ESDF-free gradient-based planning framework is proposed, which significantly reduces computation time. The main improvement is that the collision term in penalty function is formulated by comparing the colliding trajectory with a collision-free guiding path. The resulting obstacle information will be stored only if the trajectory hits new obstacles, making the planner only extract necessary obstacle information. Then, we lengthen the time allocation if dynamical feasibility is violated. An anisotropic curve fitting algorithm is introduced to adjust higher order derivatives of the trajectory while maintaining the original shape. Benchmark comparisons and real-world experiments verify its robustness and high-performance. The source code is released as ros packages.
科研通智能强力驱动
Strongly Powered by AbleSci AI