检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]同济大学现代制造技术研究所,上海201804
出 处:《同济大学学报(自然科学版)》2010年第1期113-117,共5页Journal of Tongji University:Natural Science
基 金:国家"八六三"高技术研究发展计划资助项目(2007AA042002);上海市"十一五"基础性重点研究资助项目(06JC14066)
摘 要:在分析可重组制造系统物流布局的基础上,根据物流运输网络的空间分布特征,提出了一种动态的AGV(自动导引小车)路径规划方法.利用图论,构建了AGV路径规划的有向图网络模型,采用机床相对位置矩阵、距离矩阵以及阻塞系数来描述车间环境信息,通过系统的重组,有效缩短运输距离.针对物流运输动态路网的变化,把整个运输网络划分成不同的子路网,动态地优化变化附近运输节点所在的子路网,从而较迅速地得到最佳运输路径.仿真结果表明了该方法的有效性和快速性.Based on an analysis of logistics layout in reconfigurable manufacturing system, a method of the dynamic routing planning is proposed for automated guided vehicle (AGV)according to the spatial distribution feature of logistics transport network. Directed graph network model of AGV routing planning was built based on graph theory. Workshop circumstance information was described by the relative position matrix of machine tools, the distance matrix and congestion coefficient. Through reconfiguring system, the transport distance can be shortened effectually. Specific to dynamic change of logistics transport road network, the whole transport network was partitioned with different sub-road networks, and those including transport nodes near the changed location were optimized to obtain best transport routing rapidly. Simulating result verifies the validity and celerity of this method.
关 键 词:可重组制造系统 自动引导小车 路径规划 DIJKSTRA算法
分 类 号:TH165[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222