系统仿真学报 ›› 2026, Vol. 38 ›› Issue (5): 1383-1407.doi: 10.16182/j.issn1004731x.joss.25-0395

• • 上一篇    

基于动态走廊膨胀与凸优化的移动机器人分层运动规划

张定坤1,2, 梁海朝1,2   

  1. 1.中山大学 航空航天学院,广东 深圳 518107
    2.智能多源自主导航基础科学中心,广东 深圳 518107
  • 收稿日期:2025-05-08 修回日期:2025-07-25 出版日期:2026-05-21 发布日期:2026-05-29
  • 通讯作者: 梁海朝
  • 第一作者简介:张定坤(2000-),男,硕士生,研究方向为移动机器人运动规划,移动机器人智能多源自主导航。
  • 基金资助:
    国家自然科学基金(62388101)

Hierarchical Motion Planning of Mobile Robot Based on Dynamic Corridor Inflation and Convex Optimization

Zhang Dingkun1,2, Liang Haizhao1,2   

  1. 1.College of Aeronautics and Astronautics, Sun Yat-sen University, Shenzhen 518107
    2.Basic Science Center for Intelligent Multi-Source Autonomous Navigation, Shenzhen 518107
  • Received:2025-05-08 Revised:2025-07-25 Online:2026-05-21 Published:2026-05-29
  • Contact: Liang Haizhao

摘要:

阿克曼底盘机器人在动态复杂环境中的运动规划面临着非完整性约束与运动动力学耦合挑战,为解决传统方法存在着路径冗余、随机性波动及局部最优等共性问题,提出基于动态走廊膨胀与凸优化的分层运动规划方法。基于融合RDP(Ramer-Douglas-Peucke)路径压缩算子与A*算法生成拓扑稀疏路径,有效降低冗余路径点对后端优化的干扰。结合阿克曼转向特性设计动态走廊膨胀策略,通过凸分解技术构建符合阿克曼机器人运动学约束的安全走廊。将走廊约束转化为线性不等式嵌入凸优化模型,采用加速度二阶导数最小化目标函数,并引入曲率自适应时间调整机制实现动力学约束下的全局最优轨迹生成。仿真数据表明:在密集障碍物场景中成功率达97.3%,相较于A*算法轨迹平滑度提升93.5%、路径点数减少81.6%,相较于结合A*及共轭梯度优化算法平滑度提升91.6%、路径点数降低81.8%;通过高精度iGPS定位系统开展实物验证,厘米级轨迹跟踪结果证实了算法与控制系统的实际适配性。该方法显著提升了阿克曼机器人在仓储物流、城市救援等动态场景下的规划质量与执行可靠性,为解决非完整移动平台的运动规划问题提供了新的技术路径。

关键词: 阿克曼机器人, 运动规划, 安全走廊, 轨迹优化, 凸优化

Abstract:

Motion planning for robots with Ackermann chassis in dynamic complex environments faces nonholonomic constraints and kinematic-dynamic coupling challenges. However, traditional methods suffer from path redundancy, random fluctuations, and local optimality. A hierarchical motion planning method based on dynamic corridor inflation and convex optimization is proposed. Topologically sparse paths are generated by fusing the Ramer-Douglas-Peucker (RDP) path compression operator with the A* algorithm to reduce redundant path points' interference with backend optimization. Dynamic corridor inflation strategies are designed considering Ackermann steering characteristics, and safe corridors satisfying kinematic constraints are constructed via convex decomposition. Corridor constraints are then transformed into linear inequalities embedded in a convex optimization model. An objective function of minimizing acceleration's second derivative is adopted, and a curvature-adaptive time adjustment mechanism is introduced for global optimal trajectory generation under dynamic constraints. Simulation and physical verification platforms validate the algorithm's effectiveness. In scenarios with dense obstacles, it achieves a 97.3% success rate. Compared with the A* algorithm, it improves trajectory smoothness by 93.5% and reduces 81.6% of path points. In comparison with hierarchical motion planning method with A*-integrated ESDF-based conjugate gradient optimization (HPGO), the proposed method enhances trajectory smoothness by 91.6% and reduces 81.8% of path points. High-precision iGPS physical tests show centimeter-level tracking accuracy, confirming algorithm-control system adaptability. Experiments demonstrate improved planning quality and execution reliability in warehouse logistics, urban rescue, etc., offering a new solution for nonholonomic mobile platform motion planning.

Key words: Ackermann-steering robots, motion planning, safe corridors, trajectory optimization, convex optimization

中图分类号: