On Stable Multi-Agent Behavior in Face of Uncertainty

02/06/2013
by   Moshe Tennenholtz, et al.
0

A stable joint plan should guarantee the achievement of a designer's goal in a multi-agent environment, while ensuring that deviations from the prescribed plan would be detected. We present a computational framework where stable joint plans can be studied, as well as several basic results about the representation, verification and synthesis of stable joint plans.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2012

Decentralized Multi-agent Plan Repair in Dynamic Environments

Achieving joint objectives by teams of cooperative planning agents requi...
research
08/02/2022

Multi-Goal Multi-Agent Pickup and Delivery

In this work, we consider the Multi-Agent Pickup-and-Delivery (MAPD) pro...
research
01/03/2023

Correct-by-Design Teamwork Plans for Multi-Agent Systems

We propose Teamwork Synthesis, a version of the distributed synthesis pr...
research
11/03/2021

Deployment Optimization for Shared e-Mobility Systems with Multi-agent Deep Neural Search

Shared e-mobility services have been widely tested and piloted in cities...
research
08/30/2011

Proof System for Plan Verification under 0-Approximation Semantics

In this paper a proof system is developed for plan verification problems...
research
03/02/2022

STV+AGR: Towards Practical Verification of Strategic Ability Using Assume-Guarantee Reasoning

We present a substantially expanded version of our tool STV for strategy...
research
05/20/2020

Causality, Responsibility and Blame in Team Plans

Many objectives can be achieved (or may be achieved more effectively) on...

Please sign up or login with your details

Forgot password? Click here to reset