论文标题

多代理分散的信念在图表上传播

Multi-Agent Decentralized Belief Propagation on Graphs

论文作者

Chen, Yitao, Vasal, Deepanshu

论文摘要

我们考虑了交互式可观察到的马尔可夫决策过程(i-pomdps)的问题,其中代理位于通信网络的节点上。具体来说,我们假设所有消息都有某种消息类型。此外,每个代理商都根据交互信念状态,本地观察到的信息以及通过网络从其邻居接收的消息做出个人决策。在这种情况下,代理的集体目标是通过与邻居交换信息来最大化全球平均的回报。我们提出了针对该问题的分散信念传播算法,并证明了我们的算法的融合。最后,我们显示了框架的多个应用程序。我们的工作似乎是针对网络多代理I-POMDPS的分散信念传播算法的首次研究。

We consider the problem of interactive partially observable Markov decision processes (I-POMDPs), where the agents are located at the nodes of a communication network. Specifically, we assume a certain message type for all messages. Moreover, each agent makes individual decisions based on the interactive belief states, the information observed locally and the messages received from its neighbors over the network. Within this setting, the collective goal of the agents is to maximize the globally averaged return over the network through exchanging information with their neighbors. We propose a decentralized belief propagation algorithm for the problem, and prove the convergence of our algorithm. Finally we show multiple applications of our framework. Our work appears to be the first study of decentralized belief propagation algorithm for networked multi-agent I-POMDPs.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源