mlsanityData to 14 Oct 2026

Probabilistic Plan Synthesis for Coupled Multi-Agent Systems

arXiv 1704.01432 ↗First posted 5 Apr 2017eess.SY cs.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper presents a fully automated procedure for controller synthesis for multi-agent systems under the presence of uncertainties. We model the motion of each of the N agents in the environment as a Markov Decision Process (MDP) and we assign to each agent one individual high-level formula given in Probabilistic Computational Tree Logic (PCTL). Each agent may need to collaborate with other agents in order to achieve a task. The collaboration is imposed by sharing actions between the agents. We aim to design local control policies such that each agent satisfies its individual PCTL formula. The proposed algorithm builds on clustering the agents, MDP products construction and controller policies design. We show that our approach has better computational complexity than the centralized case, which traditionally suffers from very high computational demands.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 5 Apr 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.