arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.04259cs.RO
收藏

用于自动驾驶车辆平滑高效路径规划的集成图搜索与模型预测控制

Integrated Graph Search and Model Predictive Control for Smooth and Efficient Path Planning in Autonomous Vehicles

Institute of Automotive Engineering, Graz University of Technology(格拉茨工业大学汽车工程研究所);Drone Engineering, University of Applied Science Kufstein Tirol(库夫施泰因蒂罗尔应用科学大学无人机工程系);Automation and Control Institute (ACIN), Vienna University of Technology(维也纳工业大学自动化与控制研究所)

Duc-Tien Bui, Ngoc Thinh Nguyen, Hung Duy Nguyen, Dong Bi, Tomislav Mihalj, Arno Eichberger

AI总结:

提出一种顺序路径规划框架,利用图搜索得到的粗糙路径指导基于模型预测控制的路径细化,在多个超车场景评估算法,相比之前方法能降低横向加速度等,还减少计算成本。

摘要:

路径规划是自动驾驶车辆的基本组成部分,要实现安全、舒适和动态可行路径并确保计算效率是重大挑战。本文提出一个顺序路径规划框架,通过图搜索得到粗糙路径指导基于模型预测控制的路径细化,并在多种场景评估算法,结果表明该方法能有效平衡路径平滑度和计算效率。

英文摘要:

Path planning is a fundamental component of autonomous vehicles, where achieving safe, comfortable, and dynamically feasible paths while ensuring computational efficiency remains a significant challenge. This paper presents a sequential path planning framework in which a rough path obtained from graph search is explicitly exploited to guide a Model Predictive Control (MPC)-based path refinement. A rough path is first obtained via Dijkstra search on a discretized grid and is then used to construct a spatially varying convex lateral safety corridor that explicitly captures obstacle avoidance constraints, transforming discrete obstacle avoidance decisions into continuous feasibility constraints for optimization. Within this corridor, an MPC problem is formulated to refine the path, enabling efficient optimization while maintaining path smoothness by penalizing the third-order spatial derivative of the lateral offset over a prediction horizon. The proposed algorithm is evaluated in multiple overtaking scenarios on both straight and curved roads, including cases with single and multiple target vehicles, using high-fidelity environment simulations (i.e., CarMaker). Compared with the previous study, which used polynomial fitting and a quadratic programming method, the proposed approach consistently achieves lower lateral acceleration, curvature, and jerk while reducing computational cost by 28.08% on straight roads and 29.52% on curved roads. These results demonstrate that exploiting graph-search structure within an MPC formulation provides an effective balance between path smoothness and computational efficiency for autonomous vehicles in structured driving environments.

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

↑