arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2210.07514cs.ROcs.SYeess.SY
收藏

基于强化学习和双引导的分散覆盖路径规划

Decentralized Coverage Path Planning with Reinforcement Learning and Dual Guidance

Shanghai Jiao Tong University(上海交通大学)

Yongkai Liu, Jiawei Hu, Wei Dong

摘要:

以分散的方式规划多机器人的覆盖路径,增强了覆盖任务处理不确定故障的鲁棒性。为了以分布式方式为每个机器人实现高效率,对复杂环境和合作代理意图的全面理解至关重要。不幸的是,现有的工作通常只考虑这些因素的一部分,导致不平衡的分区或不必要的重叠。为了解决这个问题,我们引入了一个分散的强化学习框架与双重指导训练每个代理,以解决分散的多覆盖路径规划问题,直接通过环境状态。由于分布式机器人需要其他意图来执行更好的覆盖效率,我们利用两种指导方法,人工势场和启发式指导,包括和整合其他意图到每个机器人的观察。通过我们构建的框架,结果表明我们的代理成功地学习确定自己的子区域,同时实现全覆盖,平衡的子区域和低重叠率。然后,我们在这些子区域内实现生成树覆盖,为每个机器人构建实际路线并完成给定的覆盖任务。我们的性能还与最先进的分散式方法进行了比较,显示重叠率最多降低10%,同时在类似环境中执行高效率。

英文摘要:

Planning coverage path for multiple robots in a decentralized way enhances robustness to coverage tasks handling uncertain malfunctions. To achieve high efficiency in a distributed manner for each single robot, a comprehensive understanding of both the complicated environments and cooperative agents intent is crucial. Unfortunately, existing works commonly consider only part of these factors, resulting in imbalanced subareas or unnecessary overlaps. To tackle this issue, we introduce a Decentralized reinforcement learning framework with dual guidance to train each agent to solve the decentralized multiple coverage path planning problem straightly through the environment states. As distributed robots require others intentions to perform better coverage efficiency, we utilize two guidance methods, artificial potential fields and heuristic guidance, to include and integrate others intentions into observations for each robot. With our constructed framework, results have shown our agents successfully learn to determine their own subareas while achieving full coverage, balanced subareas and low overlap rates. We then implement spanning tree cover within those subareas to construct actual routes for each robot and complete given coverage tasks. Our performance is also compared with the state of the art decentralized method showing at most 10 percent lower overlap rates while performing high efficiency in similar environments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑