欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
首先采用网络拓扑图法对AGV工作空间建模,将AGV路径规划问题即可转化为求解网络拓扑图的最短路径问题。然后用Floyd-Warshall算法求拓扑图的可行路径点;再用改进的自适应遗传算法来调整各个可行路径点,得到最优或近似最优的路径。MATLAB仿真结果表明本算法行之有效,可以较为准确地搜索到AGV的全局最优路径。
英文摘要：
This paper presents the Network Topology Graph（NTG） is used to establish the AGV environment model at first,so the AGV path planning problem is transformed into find out the shortest path in the established model.Then the Floyd-Warshall algorithm was applied to find the feasible space nodes,and finally the improved SAGA was successfully implemented to adjust them and find the optimal path or approximate optimal path.The effectiveness and efficiency of the improved SAGA was tested using the MATLAB simulation approach.
同期刊论文项目
同项目期刊论文
位置：