A quadrotor trajectory generation pipeline combines kinodynamic search in discretized control space, B-spline optimization using Euclidean distance field gradients and convex hull properties, and iterative time adjustment on non-uniform B-splines to produce minimum-time dynamically feasible paths.
An Efficient B-spline-Based Kinodynamic Replanning Framework for Quadrotors
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Trajectory replanning for quadrotors is essential to enable fully autonomous flight in unknown environments. Hierarchical motion planning frameworks, which combine path planning with path parameterization, are popular due to their time efficiency. However, the path planning cannot properly deal with non-static initial states of the quadrotor, which may result in non-smooth or even dynamically infeasible trajectories. In this paper, we present an efficient kinodynamic replanning framework by exploiting the advantageous properties of the B-spline, which facilitates dealing with the non-static state and guarantees safety and dynamical feasibility. Our framework starts with an efficient B-spline-based kinodynamic (EBK) search algorithm which finds a feasible trajectory with minimum control effort and time. To compensate for the discretization induced by the EBK search, an elastic optimization (EO) approach is proposed to refine the control point placement to the optimal location. Systematic comparisons against the state-of-the-art are conducted to validate the performance. Comprehensive onboard experiments using two different vision-based quadrotors are carried out showing the general applicability of the framework.
fields
cs.RO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Robust and Efficient Quadrotor Trajectory Generation for Fast Autonomous Flight
A quadrotor trajectory generation pipeline combines kinodynamic search in discretized control space, B-spline optimization using Euclidean distance field gradients and convex hull properties, and iterative time adjustment on non-uniform B-splines to produce minimum-time dynamically feasible paths.