检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李明辉 徐方[1,2,4] 宋吉来[4] LI Ming-hui;XU Fang;SONG Ji-lai(State Key Laboratory of Robotics,Shenyang Institute of Automation,Chinese Academy of Science,Shenyang 110016,China;Institutes for Robotics and Intelligent Manufacturing,Chinese Academy of Sciences,Shenyang 110169,China;University of Chinese Academy of Sciences,Beijing 100049,China;Central Research Institute,Shenyang SIASUN Robot&Automation Limited Company,Shenyang 110168,China)
机构地区:[1]中国科学院沈阳自动化研究所,机器人学国家重点实验室,辽宁沈阳110016 [2]中国科学院机器人与智能制造创新研究院,辽宁沈阳110169 [3]中国科学院大学,北京100049 [4]沈阳新松机器人自动化股份有限公司中央研究院,辽宁沈阳110168
出 处:《计算机工程与设计》2021年第8期2395-2400,F0003,共7页Computer Engineering and Design
摘 要:为解决自动化物料运输系统中的车辆拥堵问题,提高生产运输效率,根据混合布局建立轨道的图网络模型,提出基于实时交通信息的动态调度方法。在调度过程的运输任务指派和运输路径规划阶段均使用加入交通信息的预测时间,运输任务指派根据系统状态变化使用匈牙利算法动态求解,路径规划也会根据轨道权重变化选择最快到达目的地的路径。实验结果表明,提出方法可以有效缓解车辆拥堵,减少晶圆的平均运输周期。To solve the problem of vehicle congestion in the automatic material handling system and improve the production and transportation efficiency,a graph network model of tracks was established according to the hybrid layout,and a dynamic scheduling method based on real-time traffic information was proposed.The transportation task assignment and transportation path planning stages in the scheduling process both used the predicted time with traffic information,and the transportation task assignment used Hungary algorithm based on the change of system status to solve the problem dynamically,and the path planning selected the fastest path to the destination according to the change of track weight.Experimental results show that the proposed dynamic scheduling method can effectively alleviate vehicle congestion and reduce the average transportation cycle of wafers.
关 键 词:自动物料运输系统 防拥堵 调度 任务指派 路径规划 交通信息
分 类 号:TP278[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200