Abstractions of Varying Decentralization Degree for Coupled Multi-Agent Systems
D. Boskos, D. V. Dimarogonas

TL;DR
This paper develops a flexible decentralized abstraction framework for multi-agent systems with coupled constraints, allowing for varying degrees of decentralization based on neighbor information.
Contribution
It introduces a formal measure of decentralization using m-neighbor sets and provides conditions for discretization that ensure accurate abstract models.
Findings
Defined m-neighbor sets as a measure of decentralization
Provided conditions for space and time discretization
Guaranteed extraction of transition systems with quantifiable possibilities
Abstract
In this report, we aim at the development of a decentralized abstraction framework for multi-agent systems under coupled constraints, with the possibility for a varying degree of decentralization. The methodology is based on the analysis employed in our recent work, where decentralized abstractions based exclusively on the information of each agent's neighbors were derived. In the first part of this report, we define the notion each agent's m-neighbor set, which constitutes a measure for the employed degree of decentralization. Then, sufficient conditions are provided on the space and time discretization that provides the abstract system's model, which guarantee the extraction of a transition system with quantifiable transition possibilities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetri Nets in System Modeling · Logic, Reasoning, and Knowledge · Scheduling and Optimization Algorithms
