arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.00192cs.RO
收藏

RDA:一种用于杂乱环境中自主导航的加速无碰撞运动规划器

RDA: An Accelerated Collision Free Motion Planner for Autonomous Navigation in Cluttered Environments

Southern University of Science and Technology(南方科技大学);The University of Hong Kong(香港大学);Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences(中国科学院深圳先进技术研究院);Harbin Institute of Technology, Shenzhen(哈尔滨工业大学(深圳));Sifakis Research Institute for Trustworthy Autonomous Systems(可信自主系统西法克斯研究院)

Ruihua Han, Shuai Wang, Shuaijun Wang, Zeqing Zhang, Qianru Zhang, Yonina C. Eldar, Qi Hao, Jia Pan

AI总结:

本文提出加速无碰撞运动规划器RDA,通过正则化对偶交替方向乘子法求解非凸MPC运动规划问题,支持避碰约束并行计算以显著减少计算时间,实验证明其能快速生成平滑无碰撞轨迹且在杂乱环境中表现稳健。

摘要:

由于非凸避碰约束,多障碍物环境下的自主运动规划具有挑战性。直接将数值求解器应用于这些非凸公式无法利用约束结构,导致计算时间过长。在本文中,我们提出了一种加速无碰撞运动规划器,即正则化对偶交替方向乘子法(RDADMM 或简称 RDA),用于基于模型预测控制(MPC)的运动规划问题。所提出的 RDA 通过对偶求解平滑双凸重构来解决非凸运动规划,并允许针对每个障碍物并行计算避碰约束,从而显著减少计算时间。我们通过在仿真和真实世界环境中使用类车机器人进行路径跟踪实验,验证了 RDA 规划器的性能。实验结果表明,与其他基准相比,所提出的方法在更短的计算时间内生成平滑的无碰撞轨迹,并在杂乱环境中表现稳健。源代码可在 https://github.com/hanruihua/RDA_planner 获取。

英文摘要:

Autonomous motion planning is challenging in multi-obstacle environments due to nonconvex collision avoidance constraints. Directly applying numerical solvers to these nonconvex formulations fails to exploit the constraint structures, resulting in excessive computation time. In this paper, we present an accelerated collision-free motion planner, namely regularized dual alternating direction method of multipliers (RDADMM or RDA for short), for the model predictive control (MPC) based motion planning problem. The proposed RDA addresses nonconvex motion planning via solving a smooth biconvex reformulation via duality and allows the collision avoidance constraints to be computed in parallel for each obstacle to reduce computation time significantly. We validate the performance of the RDA planner through path-tracking experiments with car-like robots in both simulation and real-world settings. Experimental results show that the proposed method generates smooth collision-free trajectories with less computation time compared with other benchmarks and performs robustly in cluttered environments. The source code is available at https://github.com/hanruihua/RDA_planner.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑