---
title: "Synthesis of Communication Policies for Multi-Agent Systems Robust to Communication Restrictions"
authors:
  - "Saleh Soudijani"
  - "Rayna Dimitrova"
doi: "10.24963/ijcai.2025/30"
url: "https://ijcai.org/proceedings/2025/30"
pdf: "https://ijcai.org/proceedings/2025/0030.pdf"
venue: "Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence"
year: 2025
pages: "257-266"
track: "Main Track"
keywords:
  - "Agent-based and Multi-agent Systems: MAS: Multi-agent planning"
  - "Planning and Scheduling: PS: Markov decisions processes"
  - "Agent-based and Multi-agent Systems: MAS: Agent communication"
  - "Planning and Scheduling: PS: Distributed and multi-agent planning"
---

# Synthesis of Communication Policies for Multi-Agent Systems Robust to Communication Restrictions

Saleh Soudijani, Rayna Dimitrova

*Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence*, pages 257-266. DOI: [10.24963/ijcai.2025/30](https://doi.org/10.24963/ijcai.2025/30)

## Abstract

We study stochastic multi-agent systems in which agents must cooperate to maximize the probability of achieving a common reach-avoid objective. 
In many applications, during the execution of the system, the communication between the agents can be constrained by restrictions on the bandwidth currently available for exchanging local-state information between the agents. 
In this paper, we propose a method for computing joint action and communication policies for the group of agents that aim to satisfy the communication restrictions as much as possible while achieving the optimal reach-avoid probability when communication is unconstrained. Our method synthesizes a pair of action and communication policies robust to restrictions on the number of agents allowed to communicate. To this end, we introduce a novel cost function that measures the amount of information exchanged beyond what the communication policy allows. We evaluate our approach experimentally on a range of benchmarks and demonstrate that it is capable of computing pairs of action and communication policies that satisfy the communication restrictions, if such exist.