摘要
近年来,制造业快速向着自动化、智能化发展,智能搬运车逐渐映入我们的眼帘。随着智能搬运车的普及,其路径规划的重要性也被重视。Dijkstra算法是经典的路径规划算法之一,而传统的Dijkstra算法只能保留一条最短路径。本文对Dijkstra算法进行改进,使其能够保留所有最短路径,再将保留的所有路径进行行驶时间的计算,经计算对比筛选出耗时最短的路径。达到不仅路程短,还耗时少的目标,可以有效地节省工作时间,提高效率。
In recent years,the manufacturing industry has rapidly developed towards automation and intelligence,and intelligent transport vehicles have gradually come into our sight.With the popularization of intelligent transport vehicles,the importance of their path planning has also been emphasized.The Dijkstra algorithm is one of the classic path planning algorithms,while traditional Dijkstra algorithms can only retain one shortest path.This article improves the Dijkstra algorithm to retain all shortest paths,and then calculates the travel time of all retained paths.After comparison and calculation,the shortest path is selected.The goal of short distance and less time is achieved,which can effectively save work time and improve efficiency.
作者
闫恩雪
张石强
YAN En-xue;ZHANG Shi-qiang(Hebei University of Engineering,Handan 056038,China)
出处
《价值工程》
2024年第12期26-29,共4页
Value Engineering
