基于微分平坦性的超快采样动力学规划
Ultrafast Sampling-based Kinodynamic Planning via Differential Flatness
AI总结:
本文提出FLASK框架,利用微分平坦性将运动规划问题从状态空间转换到平坦输出空间,通过并行计算实现快速、精确的动态可行性轨迹生成,适用于多种机器人系统。
摘要:
在动态约束下的运动规划(即动力学规划)通过生成机器人可准确跟踪的动态可行性轨迹,实现安全的机器人操作。对于高自由度机器人如机械臂,采样基于运动规划器常用于复杂任务,特别是在拥挤环境中。然而,在此类规划器中强制执行机器人动力学约束需要解决复杂的两点边界值问题(BVPs)或传播机器人动力学,这两种方法都导致计算瓶颈,显著增加规划时间。同时,最近的研究表明,基于采样的运动规划器可以使用并行化在微秒内生成计划,但仅限于几何路径。本文开发了FLASK,一种快速并行化的基于采样的动力学运动规划框架,适用于广泛的不同微分平坦机器人系统,包括机械臂、地面和空中车辆等。微分平坦性允许我们将运动规划问题从原始状态空间转换到平坦输出空间,在该空间中可以得到BVP问题的解析时间参数化解。然后将平坦输出空间中的轨迹转换回原始状态空间中的闭式动态可行性轨迹,通过“单指令,多数据”并行性实现快速验证。我们的框架是快速、精确且兼容任何基于采样的运动规划器,同时基于闭式BVP解提供概率穷尽性和渐近最优性的理论保证。我们广泛验证了我们的方法在模拟基准和真实实验中的有效性,包括拥挤和动态环境,规划时间仅需几微秒到几毫秒。
英文摘要:
Motion planning under dynamics constraints, i.e, kinodynamic planning, enables safe robot operation by generating dynamically feasible trajectories that the robot can accurately track. For high-DOF robots such as manipulators, sampling-based motion planners are commonly used, especially for complex tasks in cluttered environments. However, enforcing constraints on robot dynamics in such planners requires solving either challenging two-point boundary value problems (BVPs) or propagating robot dynamics, both of which cause computational bottlenecks that drastically increase planning times. Meanwhile, recent efforts have shown that sampling-based motion planners can generate plans in microseconds using parallelization, but are limited to geometric paths. This paper develops FLASK, a fast parallelized sampling-based kinodynamic motion planning framework for a broad class of differentially flat robot systems, including manipulators, ground and aerial vehicles, and more. Differential flatness allows us to transform the motion planning problem from the original state space to a flat output space, where an analytical time-parameterized solution of the BVP problem can be obtained. A trajectory in the flat output space is then converted back to a closed-form dynamically feasible trajectory in the original state space, enabling fast validation via ``single instruction, multiple data" parallelism. Our framework is fast, exact, and compatible with any sampling-based motion planner, while offering theoretical guarantees on probabilistic exhaustivity and asymptotic optimality based on the closed-form BVP solutions. We extensively verify the effectiveness of our approach in both simulated benchmarks and real experiments with cluttered and dynamic environments, requiring mere microseconds to milliseconds of planning time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。