Randomized Coordination Search for Scalable Multiagent Planning

Autonomous Agents and Multi-Agent Systems, pp. 1793-1794, 2015.

Cited by: 2|Views1
EI

Abstract:

Multiagent Markov Decision Processes (MMDPs) are difficult problems to solve due to the exponential increase in the size of the planning space in the number of agents. One of the most successful approaches for solving MMDPs utilizes coordination graphs (CGs), which encode the decouplings between the agents to reduce the dimension of the v...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments