Online Abstractions for Interconnected Multi-Agent Control Systems

In this report, we aim at the development of an online abstraction framework for multi-agent systems under coupled constraints. The motion capabilities of each agent are abstracted through a finite state transition system in order to capture reachability properties of the coupled multi-agent system over a finite time horizon in a decentralized manner. In the first part of this work, we define online abstractions by discretizing an overapproximation of the agents' reachable sets over the horizon. Then, sufficient conditions relating the discretization and the agent's dynamics properties are provided, in order to quantify the transition possibilities of each agent.Comment: 22 pages. arXiv admin note: text overlap with arXiv:1603.0478

Розробка мультиагентної системи обробки даних для забезпечення екологічного моніторингу

В статті запропоновано авторське бачення мультиагентної системи для потреб здійснення екологічного моніторнигу. Визначено суть мультиагентної системи та її агентів, описано властивості і завдання мультиагентної системи. Зроблена спроба дослідити принципи використання мультиагентних систем в Державній системі екологічного моніторингу довкілляIn article suggests author's vision of multi-agent system for the purpose of implementation of ecological monitoring. Determined the essence of multi-agent systems and its agents, and describes the properties of multi-agent problem. Attempt to investigate the use of the principles of multi-agent systems in the state system of ecological monitoring of the environmen

A modal logic for reasoning on consistency and completeness of regulations

In this paper, we deal with regulations that may exist in multi-agent systems in order to regulate agent behaviour and we discuss two properties of regulations, that is consistency and completeness. After defining what consistency and completeness mean, we propose a way to consistently complete incomplete regulations. In this contribution, we extend previous works and we consider that regulations are expressed in a first order modal deontic logic

Learning Individual Policies in Large Multi-agent Systems through Local Variance Minimization

In multi-agent systems with large number of agents, typically the contribution of each agent to the value of other agents is minimal (e.g., aggregation systems such as Uber, Deliveroo). In this paper, we consider such multi-agent systems where each agent is self-interested and takes a sequence of decisions and represent them as a Stochastic Non-atomic Congestion Game (SNCG). We derive key properties for equilibrium solutions in SNCG model with non-atomic and also nearly non-atomic agents. With those key equilibrium properties, we provide a novel Multi-Agent Reinforcement Learning (MARL) mechanism that minimizes variance across values of agents in the same state. To demonstrate the utility of this new mechanism, we provide detailed results on a real-world taxi dataset and also a generic simulator for aggregation systems. We show that our approach reduces the variance in revenues earned by taxi drivers, while still providing higher joint revenues than leading approaches.Comment: arXiv admin note: substantial text overlap with arXiv:2003.0708

Automated Verification of Quantum Protocols using MCMAS

We present a methodology for the automated verification of quantum protocols using MCMAS, a symbolic model checker for multi-agent systems The method is based on the logical framework developed by D'Hondt and Panangaden for investigating epistemic and temporal properties, built on the model for Distributed Measurement-based Quantum Computation (DMC), an extension of the Measurement Calculus to distributed quantum systems. We describe the translation map from DMC to interpreted systems, the typical formalism for reasoning about time and knowledge in multi-agent systems. Then, we introduce dmc2ispl, a compiler into the input language of the MCMAS model checker. We demonstrate the technique by verifying the Quantum Teleportation Protocol, and discuss the performance of the tool.Comment: In Proceedings QAPL 2012, arXiv:1207.055