Sciweavers

268 search results - page 17 / 54
» Solving multiagent assignment Markov decision processes
Sort
View
IDEAL
2003
Springer
14 years 2 months ago
Agent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
Yi Tang, Jiming Liu, Xiaolong Jin
HICSS
2000
IEEE
139views Biometrics» more  HICSS 2000»
14 years 2 months ago
Air Cargo Transport by Multi-Agent based Planning
Most major airlines decide to take new strategies for the competition in the air cargo industry. They are concerned with assigning cargo over flights in creative ways. This paper ...
Keqiang Zhu, M. W. Ludema, Rob E. C. M. van der He...
AAAI
2007
14 years 2 hour ago
Scaling Up: Solving POMDPs through Value Based Clustering
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen ...
NIPS
2000
13 years 11 months ago
Using Free Energies to Represent Q-values in a Multiagent Reinforcement Learning Task
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
Brian Sallans, Geoffrey E. Hinton
ATAL
2008
Springer
13 years 11 months ago
Exploiting locality of interaction in factored Dec-POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...
Frans A. Oliehoek, Matthijs T. J. Spaan, Shimon Wh...