摘要
阐述了制造环境中AGV运输子系统的路径规划方法,运用Dijkstra算法和A*算法都能求得最优解,但从计算量及速度来说,A*算法优于Dijkstra算法。
Path planning for AGV transport subsystem in manufacturing environment is presented. Both Dijkstra＇s algorithm and A ＊ algorithm can find a shortest path. But A ＊ algorithm is better than Dijkstra＇s algorithm because of less calculation and fast speed.
出处
《机械设计与制造》
北大核心
2010年第2期237-239,共3页
Machinery Design & Manufacture
基金
教育部留学回国人员科研启动基金项目(8080823101)
关键词
制造
AGV
路径规划
Manufacturing
AGV
Path planning
