arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.14220cs.ITcs.LGcs.MAcs.SYeess.SYmath.IT
收藏

面向任务的多智能体通信数据压缩

Task-Oriented Data Compression for Multi-Agent Communications Over Bit-Budgeted Channels

University of Luxembourg(卢森堡大学);Centre for Security Reliability and Trust(安全、可靠性与信任中心)

Arsham Mostaani, Thang X. Vu, Symeon Chatzinotas, Björn Ottersten

摘要:

机器间通信的各种应用正在兴起。无论是自动驾驶汽车还是万物互联,机器都比以往任何时候都更加紧密地连接在一起,以提高它们完成给定任务的性能。在传统的通信中,目标往往是重建基本信息,而在新兴的面向任务的范式下,通信的目标是使接收端能够做出更明智的决定或更精确的估计/计算。出于这些最新的发展,在本文中,我们进行了间接设计的通信在多智能体系统(MAS)中,代理合作,以最大限度地提高平均折扣的一个阶段的奖励合作任务的总和。由于代理之间的比特预算通信,每个代理应该有效地表示其本地观察和通信的抽象版本的观察,以提高协作任务的性能。我们首先表明,这个问题可以近似为一种形式的数据量化问题,我们称之为面向任务的数据压缩(TODC)。然后,我们引入状态聚合信息压缩算法(SAIC)来解决制定的TODC问题。结果表明,SAIC是能够实现接近最优的性能方面所取得的折扣奖励的总和。将该算法应用于几何一致性问题,并将其性能与几个基准进行了比较。数值实验证实了这种间接设计方法的承诺面向任务的多智能体通信。

英文摘要:

Various applications for inter-machine communications are on the rise. Whether it is for autonomous driving vehicles or the internet of everything, machines are more connected than ever to improve their performance in fulfilling a given task. While in traditional communications the goal has often been to reconstruct the underlying message, under the emerging task-oriented paradigm, the goal of communication is to enable the receiving end to make more informed decisions or more precise estimates/computations. Motivated by these recent developments, in this paper, we perform an indirect design of the communications in a multi-agent system (MAS) in which agents cooperate to maximize the averaged sum of discounted one-stage rewards of a collaborative task. Due to the bit-budgeted communications between the agents, each agent should efficiently represent its local observation and communicate an abstracted version of the observations to improve the collaborative task performance. We first show that this problem can be approximated as a form of data-quantization problem which we call task-oriented data compression (TODC). We then introduce the state-aggregation for information compression algorithm (SAIC) to solve the formulated TODC problem. It is shown that SAIC is able to achieve near-optimal performance in terms of the achieved sum of discounted rewards. The proposed algorithm is applied to a geometric consensus problem and its performance is compared with several benchmarks. Numerical experiments confirm the promise of this indirect design approach for task-oriented multi-agent communications.

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

↑