arXiv:2603.16059cs.RO2026-03被引 3

利用微分平坦性实现毫秒级动态运动规划,让机器人快速生成可追踪的轨迹。

Ultrafast Sampling-based Kinodynamic Planning via Differential Flatness

  • 将动态规划问题转到平坦输出空间,用解析解替代复杂求解
  • 在模拟与真实场景中均实现微秒至毫秒级规划,支持高自由度机器人
  • 兼容任意采样规划器,适合复杂动态环境下的实时控制

在动力学约束下进行运动规划(即动力学规划)能够生成机器人可精确跟踪的动态可行轨迹,保障安全操作。对于如机械臂等高自由度机器人,在复杂遮挡环境中常采用基于采样的规划方法。然而,此类方法在引入动力学约束时需求解困难的两点边值问题(BVP)或推进机器人动力学模型,导致计算瓶颈,大幅增加规划时间。尽管近期研究已通过并行化实现几何路径的微秒级规划,但尚未解决动态可行性问题。本文提出FLASK框架,一种针对广义微分平坦机器人的快速并行化采样式动力学运动规划方法,涵盖机械臂、地面与空中车辆等。微分平坦性使我们能将规划问题从原始状态空间转换到平坦输出空间,在该空间中可获得BVP的解析时间参数解。随后,平坦空间中的轨迹被映射回原始状态空间,生成闭式动态可行轨迹,支持通过“单指令多数据”并行化快速验证。本框架速度快、精确且兼容任何采样式规划器,基于闭式BVP解提供概率遍历性和渐近最优性的理论保证。我们在多种模拟基准和真实实验中验证了该方法的有效性,规划时间仅需数微秒至数毫秒。

原文摘要 · Abstract (English)

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 exhaustibility 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.

运动规划微分平坦实时控制并行计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。