Market-based Risk Allocation for Multi-agent Systems

This paper proposes Market-based Iterative Risk Allocation (MIRA), a new market-based distributed planning algorithm for multi-agent systems under uncertainty. In large coordination problems, from power grid management to multi-vehicle missions, multiple agents act collectively in order to optimize...

Full description

Bibliographic Details
Main Authors: Ono, Masahiro (Contributor), Williams, Brian Charles (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery, 2012-01-03T17:09:56Z.
Subjects:
Online Access:Get fulltext
LEADER 02205 am a22002053u 4500
001 67892
042 |a dc 
100 1 0 |a Ono, Masahiro  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Aeronautics and Astronautics  |e contributor 
100 1 0 |a Williams, Brian Charles  |e contributor 
100 1 0 |a Williams, Brian Charles  |e contributor 
100 1 0 |a Ono, Masahiro  |e contributor 
700 1 0 |a Williams, Brian Charles  |e author 
245 0 0 |a Market-based Risk Allocation for Multi-agent Systems 
260 |b Association for Computing Machinery,   |c 2012-01-03T17:09:56Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/67892 
520 |a This paper proposes Market-based Iterative Risk Allocation (MIRA), a new market-based distributed planning algorithm for multi-agent systems under uncertainty. In large coordination problems, from power grid management to multi-vehicle missions, multiple agents act collectively in order to optimize the performance of the system, while satisfying mission constraints. These optimal plans are particularly susceptible to risk when uncertainty is introduced. We present a distributed planning algorithm that minimizes the system cost while ensuring that the probability of violating mission constraints is below a user-specified level. We build upon the paradigm of risk allocation (Ono & Williams 2008), in which the planner optimizes not only the sequence of actions, but also its allocation of risk among each constraint at each time step. We extend the concept of risk allocation to multi-agent systems by highlighting risk as a commodity that is traded in a computational market. The equilibrium price of risk that balances the supply and demand is found by an iterative price adjustment process called tˆatonnement (also known as Walrasian auction). Our work is distinct from the classical tˆatonnement approach in that we use Brent's method to provide fast guaranteed convergence to the equilibrium price. The simulation results demonstrate the efficiency of the proposed distributed planner. 
546 |a en_US 
655 7 |a Article 
773 |t Proceedings of the Ninth International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2010