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

基于学习激励函数加权的二部图匹配用于多机器人任务分配

Bigraph Matching Weighted with Learnt Incentive Function for Multi-Robot Task Allocation

University at Buffalo(布法罗大学)

Steve Paul, Nathan Maurer, Souma Chowdhury

AI总结:

针对多机器人任务分配中启发式规则推导困难的问题,提出融合图强化学习与改进胶囊注意力网络的二部图匹配方法,性能与专家启发式方法相当且鲁棒性更强。

摘要:

大多数现实世界的多机器人任务分配(MRTA)问题需要快速高效的决策,通常借助遗传算法、基于拍卖的方法和二部图匹配方法等启发式辅助方法实现。与端到端(学习型)神经网络MRTA策略相比,这些方法的形式通常具备更好的可解释性。然而,推导合适的启发式规则可能繁琐且有风险,若问题过于复杂,在某些情况下甚至不切实际。这引发了一个问题:这些启发式规则能否被学习?为此,本文专门构建了一个图强化学习(GRL)框架,为MRTA的二部图匹配方法学习启发式规则或激励函数。具体而言,采用胶囊注意力策略模型来学习如何为连接任务集合与机器人集合的二部图中的任务/机器人配对(边)赋予权重。本文对原始胶囊注意力网络架构进行了根本性改进:新增机器人状态图编码模块,以及两个基于多头注意力的解码器,其输出用于构建对数正态分布矩阵,可从中采样得到正的二部图权重。实验发现,这种加入GRL推导激励函数的新型二部图匹配方法性能与采用专家指定启发式规则的原始二部图匹配方法相当,且前者具有显著的鲁棒性优势。在训练过程中,学习到的激励策略最初会逐渐接近专家指定的激励函数,随后会略微偏离其变化趋势。

英文摘要:

Most real-world Multi-Robot Task Allocation (MRTA) problems require fast and efficient decision-making, which is often achieved using heuristics-aided methods such as genetic algorithms, auction-based methods, and bipartite graph matching methods. These methods often assume a form that lends better explainability compared to an end-to-end (learnt) neural network based policy for MRTA. However, deriving suitable heuristics can be tedious, risky and in some cases impractical if problems are too complex. This raises the question: can these heuristics be learned? To this end, this paper particularly develops a Graph Reinforcement Learning (GRL) framework to learn the heuristics or incentives for a bipartite graph matching approach to MRTA. Specifically a Capsule Attention policy model is used to learn how to weight task/robot pairings (edges) in the bipartite graph that connects the set of tasks to the set of robots. The original capsule attention network architecture is fundamentally modified by adding encoding of robots' state graph, and two Multihead Attention based decoders whose output are used to construct a LogNormal distribution matrix from which positive bigraph weights can be drawn. The performance of this new bigraph matching approach augmented with a GRL-derived incentive is found to be at par with the original bigraph matching approach that used expert-specified heuristics, with the former offering notable robustness benefits. During training, the learned incentive policy is found to get initially closer to the expert-specified incentive and then slightly deviate from its trend.

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

↑