SYSYOct 8, 2016

Abstractions of Varying Decentralization Degree for Coupled Multi-Agent Systems

arXiv:1603.047801.22 citationsh-index: 65
Originality Synthesis-oriented
AI Analysis

Provides a formal method for multi-agent systems to adjust decentralization levels, but the results are theoretical without concrete performance numbers.

This work develops a decentralized abstraction framework for multi-agent systems under coupled constraints, allowing varying degrees of decentralization. Sufficient conditions on space and time discretization are provided to guarantee quantifiable transition possibilities in the abstract model.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes