Fast Spline Trajectory Planning: Minimum Snap and Beyond
In this paper, we study spline trajectory generation via the solution of two optimisation problems: (i) a quadratic program (QP) with linear equality constraints and (ii) a nonlinear and nonconvex optimisation program. We propose an efficient algorithm to solve (i), which we then leverage to use in an iterative algorithm to solve (ii). Both the first algorithm and each iteration of the second algorithm have linear computational complexity in the number of spline segments. The scaling of each algorithm is such that we are able to solve the two problems faster than state-of-the-art methods and in times amenable to real-time trajectory generation requirements. The trajectories we generate are applicable to differentially flat systems, a broad class of mechanical systems, which we demonstrate by planning trajectories for a quadrotor.
Code (0)
등록된 구현이 없습니다.
Tasks
Trajectory PlanningSimilar Papers 제목 키워드 기반
An Efficient B-spline-Based Kinodynamic Replanning Framework for Quadrotors
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 du…
Motion PlanningMIGHTY: Hermite Spline-based Efficient Trajectory Planning
Hard-constraint trajectory planners often rely on commercial solvers and demand substantial computational resources. Existing soft-constraint methods achieve faster computation, but either (1) decouple spatial and tempor…
Trajectory PlanningFast Trajectory Planner with a Reinforcement Learning-based Controller for Robotic Manipulators
Generating obstacle-free trajectories for robotic manipulators in unstructured and cluttered environments remains a significant challenge. Existing motion planning methods often require additional computational effort to…
Reinforcement LearningTrajectory PlanningMotion PlanningHierarchical Informative Path Planning via Graph Guidance and Trajectory Optimization
We study informative path planning (IPP) with travel budgets in cluttered environments, where an agent collects measurements of a latent field modeled as a Gaussian process (GP) to reduce uncertainty at target locations.…
Robot Path and Trajectory Planning Considering a Spatially Fixed TCP
This paper presents a method for planning a trajectory in workspace coordinates using a spatially fixed tool center point (TCP), while taking into account the processing path on a part. This approach is beneficial if it …
Trajectory Planning