摘要
目前智能网联汽车已进入快速发展的新阶段,智能网联汽车的路径规划算法一直是解决智能网联汽车如何快速、准确到达行驶目标的重要途径。本文介绍了三种全局路径规划算法,并运用三种算法对特斯拉轿车进行自动驾驶全局路径规划与控制,通过仿真实验比较研究,得出了在同一个地图上,同一智能网联汽车在同一PID参数设置下,从同一起始点到同一终点的同一限速下,根据不同的全局路径算法,得出了智能网联汽车在迪杰斯特拉算法下的自动驾驶动态行驶路径最佳。
Currently,intelligent connected vehicles have entered a new stage of rapid development,and the path planning algorithm for intelligent connected vehicles has always been a solution to the problem of how to quickly and accurately reach the driving target.This article introduces three global path planning algorithms and uses them to compare and simulate the global path of Tesla cars.Through simulation experiments,it is found that on the same map,under the same PID parameter settings and the same speed limit from the same starting point to the same ending point,the optimal dynamic driving path of the intelligent connected vehicle under the Dijkstra algorithm is obtained based on different global path algorithms.
作者
张新
蒋瑞斌
左萃
熊少华
Zhang Xin;Jiang Rui-bin;Zuo Cui;Xiong Shao-hua(Hunan Bioelectromechanical Vocational and Technical College,Hunan Changsha 410116)
出处
《内燃机与配件》
2025年第13期29-31,共3页
Internal Combustion Engine & Parts
关键词
智能网联汽车
全局路径规划算法
仿真比较
Intelligent connected vehicles
Global path planning algorithm
Simulation comparison
