Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Communications of the ACM
RoboCup: The Robot World Cup Initiative
AGENTS '97 Proceedings of the first international conference on Autonomous agents
Multi-agent reinforcement learning: independent vs. cooperative agents
Readings in agents
The dynamics of reinforcement learning in cooperative multiagent systems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Multiagent systems: a modern approach to distributed artificial intelligence
Multiagent systems: a modern approach to distributed artificial intelligence
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
How to solve it: modern heuristics
How to solve it: modern heuristics
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Nonserial Dynamic Programming
Context-specific multiagent coordination and planning with factored MDPs
Eighteenth national conference on Artificial intelligence
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
Statistics and Computing
Planning under uncertainty in complex structured environments
Planning under uncertainty in complex structured environments
Planning, learning and coordination in multiagent decision processes
TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Efficient solution algorithms for factored MDPs
Journal of Artificial Intelligence Research
VWM: An Improvement to Multiagent Coordination in Highly Dynamic Environments
MATES '07 Proceedings of the 5th German conference on Multiagent System Technologies
Rational Passing Decision Based on Region for the Robotic Soccer
RoboCup 2007: Robot Soccer World Cup XI
| Hi-index | 0.00 |
Coordination, as a key issue in fully cooperative multiagent systems, raises a number of challenges. A crucial one among them is to efficiently find the optimal joint action in an exponential joint action space. Variable elimination offers a viable solution to this problem. Using their algorithm, each agent can choose an optimal individual action resulting in the optimal behavior for the whole agents. However, the worst-case time complexity of this algorithm grows exponentially with the number of agents. Moreover, variable elimination can only report an answer when the whole algorithm terminates. Therefore, it is unsuitable in real-time systems. In this paper, we propose an anytime algorithm, called the simulated annealing algorithm, as an approximation alternative to variable elimination. We empirically show that our algorithm can compute nearly optimal results with a small fraction of the time that variable elimination takes to find the solution to the same coordination problem.