基于深度强化学习和递归神经网络的多 AGV 路由规划方法

IF 15.3 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Yishuai Lin;Gang Hue;Liang Wang;Qingshan Li;Jiawei Zhu
{"title":"基于深度强化学习和递归神经网络的多 AGV 路由规划方法","authors":"Yishuai Lin;Gang Hue;Liang Wang;Qingshan Li;Jiawei Zhu","doi":"10.1109/JAS.2023.123300","DOIUrl":null,"url":null,"abstract":"Dear Editor, This letter presents a multi-automated guided vehicles (AGV) routing planning method based on deep reinforcement learning (DRL) and recurrent neural network (RNN), specifically utilizing proximal policy optimization (PPO) and long short-term memory (LSTM). Compared to traditional AGV pathing planning methods using genetic algorithm, ant colony optimization algorithm, etc., our proposed method has a higher degree of adaptability to deal with temporary changes of tasks or sudden failures of AGVs. Furthermore, our novel routing method, which uses LSTM to take into account temporal step information, provides a more optimized performance in terms of rewards and convergence speed as compared to existing PPO-based routing methods for AGVs.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"11 7","pages":"1720-1722"},"PeriodicalIF":15.3000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10198708","citationCount":"0","resultStr":"{\"title\":\"A Multi-AGV Routing Planning Method Based on Deep Reinforcement Learning and Recurrent Neural Network\",\"authors\":\"Yishuai Lin;Gang Hue;Liang Wang;Qingshan Li;Jiawei Zhu\",\"doi\":\"10.1109/JAS.2023.123300\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dear Editor, This letter presents a multi-automated guided vehicles (AGV) routing planning method based on deep reinforcement learning (DRL) and recurrent neural network (RNN), specifically utilizing proximal policy optimization (PPO) and long short-term memory (LSTM). Compared to traditional AGV pathing planning methods using genetic algorithm, ant colony optimization algorithm, etc., our proposed method has a higher degree of adaptability to deal with temporary changes of tasks or sudden failures of AGVs. Furthermore, our novel routing method, which uses LSTM to take into account temporal step information, provides a more optimized performance in terms of rewards and convergence speed as compared to existing PPO-based routing methods for AGVs.\",\"PeriodicalId\":54230,\"journal\":{\"name\":\"Ieee-Caa Journal of Automatica Sinica\",\"volume\":\"11 7\",\"pages\":\"1720-1722\"},\"PeriodicalIF\":15.3000,\"publicationDate\":\"2023-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10198708\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ieee-Caa Journal of Automatica Sinica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10198708/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ieee-Caa Journal of Automatica Sinica","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10198708/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

亲爱的编辑,这封信提出了一种基于深度强化学习(DRL)和递归神经网络(RNN)的多自动导引车(AGV)路径规划方法,特别是利用了近端策略优化(PPO)和长短期记忆(LSTM)。与使用遗传算法、蚁群优化算法等的传统 AGV 路径规划方法相比,我们提出的方法具有更高的适应性,可应对任务的临时变化或 AGV 的突然故障。此外,与现有的基于 PPO 的 AGV 路径规划方法相比,我们的新型路径规划方法使用 LSTM 考虑了时间阶跃信息,在奖励和收敛速度方面具有更优化的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Multi-AGV Routing Planning Method Based on Deep Reinforcement Learning and Recurrent Neural Network
Dear Editor, This letter presents a multi-automated guided vehicles (AGV) routing planning method based on deep reinforcement learning (DRL) and recurrent neural network (RNN), specifically utilizing proximal policy optimization (PPO) and long short-term memory (LSTM). Compared to traditional AGV pathing planning methods using genetic algorithm, ant colony optimization algorithm, etc., our proposed method has a higher degree of adaptability to deal with temporary changes of tasks or sudden failures of AGVs. Furthermore, our novel routing method, which uses LSTM to take into account temporal step information, provides a more optimized performance in terms of rewards and convergence speed as compared to existing PPO-based routing methods for AGVs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ieee-Caa Journal of Automatica Sinica
Ieee-Caa Journal of Automatica Sinica Engineering-Control and Systems Engineering
CiteScore
23.50
自引率
11.00%
发文量
880
期刊介绍: The IEEE/CAA Journal of Automatica Sinica is a reputable journal that publishes high-quality papers in English on original theoretical/experimental research and development in the field of automation. The journal covers a wide range of topics including automatic control, artificial intelligence and intelligent control, systems theory and engineering, pattern recognition and intelligent systems, automation engineering and applications, information processing and information systems, network-based automation, robotics, sensing and measurement, and navigation, guidance, and control. Additionally, the journal is abstracted/indexed in several prominent databases including SCIE (Science Citation Index Expanded), EI (Engineering Index), Inspec, Scopus, SCImago, DBLP, CNKI (China National Knowledge Infrastructure), CSCD (Chinese Science Citation Database), and IEEE Xplore.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信