中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Research on optimization method of routing buffer linkage based on Q-learning

文献类型:会议论文

作者Han ZH(韩忠华)1,2,3,4; Qi, Hongfeng2; Chang DL(常大亮)1,3,4; Gong, Wei2; Dai, Shilong2
出版日期2021
会议日期November 5-7, 2021
会议地点Zhuhai, China
页码1-7
英文摘要According to the characteristics of the painting process of passenger car manufacturing enterprises, by formulating the routing buffer linkage rules based on the total renewal cost, the linkage process of the bus in the routing buffer is controlled, and an improved Q-learning (Q- The routing buffer of learning) algorithm quickly finds the optimal path method. According to the actual production situation, this method improves the dynamic parameters of the algorithm on the basis of the traditional Q-learning algorithm, and improves the optimization speed and accuracy of the algorithm by establishing the correlation between the work-in-process and its neighboring work-in-process in the current state. Through multiple sets of example simulation tests, the effectiveness of the Q-learning algorithm in solving the optimization problem of routing buffer linkage is verified.
产权排序1
会议录International Conference on Advanced Manufacturing Technology and Electronic Information (AMTEI 2021)
会议录出版者IOP
会议录出版地Bristol, UK
语种英语
ISSN号1742-6596
源URL[http://ir.sia.cn/handle/173321/30574]  
专题沈阳自动化研究所_数字工厂研究室
通讯作者Qi, Hongfeng
作者单位1.Key Laboratory of Networked Control Systems, Chinese Academy of Sciences, Shenyang 110016, China
2.School of Information and Control Engineering, Shenyang Jianzhu University, Shenyang 110168, China
3.Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
4.Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang 110169, China.
推荐引用方式
GB/T 7714
Han ZH,Qi, Hongfeng,Chang DL,et al. Research on optimization method of routing buffer linkage based on Q-learning[C]. 见:. Zhuhai, China. November 5-7, 2021.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。