运动规划
非完整系统
计算机科学
笛卡尔坐标系
控制理论(社会学)
路径(计算)
移动机器人
快速行进算法
机器人
数学优化
数学
机器人运动学
控制工程
可观测性
稳健性(进化)
最优控制
计算
车辆动力学
作者
Ibrahim Ibrahim,Wilm Decré,Jan Swevers
标识
DOI:10.1109/tro.2026.3695992
摘要
We present an effective solution for computing locally optimal Reeds-Shepp distances and paths for kinematically-constrained vehicles in environments represented as obstacle-rich 2D Cartesian occupancy grids, addressing the reliance of current methods on discretization and approximation techniques. Our solution leverages a visibility-based marching architecture with continuous analytical expressions for propagating the Reeds-Shepp distance function. We introduce a model to identify reachable and unreachable regions for Reeds-Shepp vehicles, accompanied by a comprehensive representation of the Reeds-Shepp distance function in both cases. Unlike existing approaches, our method computes locally optimal distances and smooth paths globally without discretizing vehicle orientations, motion primitives, or the PDE, and without gradient descent (GD) backtracking, ensuring both accuracy and computational efficiency. Extensive simulations in various environments demonstrate effective improvements over state-of-the-art methods, particularly in complex obstacle-rich scenarios. To facilitate adoption, we provide an open-source solver implemented in C++.
科研通智能强力驱动
Strongly Powered by AbleSci AI