Multi-Robot Coverage Path Planning based on Deep Reinforcement Learning

Xiaolin Zhou, Xiaojie Liu, Xingwei Wang, Shiguang Wu, Mingyang Sun
{"title":"Multi-Robot Coverage Path Planning based on Deep Reinforcement Learning","authors":"Xiaolin Zhou, Xiaojie Liu, Xingwei Wang, Shiguang Wu, Mingyang Sun","doi":"10.1109/CSE53436.2021.00015","DOIUrl":null,"url":null,"abstract":"The multi-robot coverage path planning (CPP) is the design of optimal motion sequence of robots, which can make robots execute the task covering all positions of the work area except the obstacles. In this article, the communication capability of the multi-robot system is applied, and a multi-robot CPP mechanism is proposed to control the robots to perform CPP tasks in an unknown environment. In this mechanism, an algorithm based on deep reinforcement learning is proposed, which can generate the next action for robots in real-time according to the current state of the robots. In addition, a real-time obstacle avoidance scheme for multi-robot is proposed based on the information interaction capability of multi-robot. Experiment results show that the method can plan the optimal path for multi-robot to complete the covering task in an unknown environment. Moreover, compared with other reinforcement learning methods, the algorithm proposed can efficiently learning with fast convergence speed and good stability.","PeriodicalId":6838,"journal":{"name":"2021 IEEE 24th International Conference on Computational Science and Engineering (CSE)","volume":"10 1","pages":"35-42"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 24th International Conference on Computational Science and Engineering (CSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE53436.2021.00015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The multi-robot coverage path planning (CPP) is the design of optimal motion sequence of robots, which can make robots execute the task covering all positions of the work area except the obstacles. In this article, the communication capability of the multi-robot system is applied, and a multi-robot CPP mechanism is proposed to control the robots to perform CPP tasks in an unknown environment. In this mechanism, an algorithm based on deep reinforcement learning is proposed, which can generate the next action for robots in real-time according to the current state of the robots. In addition, a real-time obstacle avoidance scheme for multi-robot is proposed based on the information interaction capability of multi-robot. Experiment results show that the method can plan the optimal path for multi-robot to complete the covering task in an unknown environment. Moreover, compared with other reinforcement learning methods, the algorithm proposed can efficiently learning with fast convergence speed and good stability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于深度强化学习的多机器人覆盖路径规划
多机器人覆盖路径规划(CPP)是设计机器人的最优运动序列,使机器人能够覆盖工作区域除障碍物外的所有位置。本文利用多机器人系统的通信能力,提出了一种多机器人CPP机制来控制机器人在未知环境下执行CPP任务。在该机制中,提出了一种基于深度强化学习的算法,可以根据机器人的当前状态实时生成机器人的下一个动作。此外,基于多机器人的信息交互能力,提出了一种多机器人实时避障方案。实验结果表明,该方法可以为多机器人在未知环境下完成覆盖任务规划最优路径。与其他强化学习方法相比,该算法具有学习效率高、收敛速度快、稳定性好等特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
25th IEEE International Conference on Computational Science and Engineering, CSE 2022, Wuhan, China, December 9-11, 2022 UAV-empowered Vehicular Networking Scheme for Federated Learning in Delay Tolerant Environments A novel sentiment classification based on “word-phrase” attention mechanism CFP- A New Approach to Predicting Fantasy Points of NFL Quarterbacks A K-nearest neighbor classifier based on homomorphic encryption scheme
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1