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.Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China 2.School of Information and Control Engineering, Shenyang Jianzhu University, Shenyang 110168, China 3.Key Laboratory of Networked Control Systems, 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. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论