Sciweavers

268 search results - page 25 / 54
» Solving multiagent assignment Markov decision processes
Sort
View
ICTAI
2009
IEEE
13 years 7 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
AI
2011
Springer
13 years 1 months ago
Decentralized MDPs with sparse interactions
In this work, we explore how local interactions can simplify the process of decision-making in multiagent systems, particularly in multirobot problems. We review a recent decision-...
Francisco S. Melo, Manuela M. Veloso
FSTTCS
2006
Springer
14 years 1 months ago
Testing Probabilistic Equivalence Through Reinforcement Learning
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
Josee Desharnais, François Laviolette, Sami...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 8 months ago
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
Sarah Filippi, Olivier Cappé, Aurelien Gari...
EOR
2006
66views more  EOR 2006»
13 years 9 months ago
Performance prediction of an unmanned airborne vehicle multi-agent system
Consider unmanned airborne vehicle (UAV) control agents in a dynamic multi-agent system. The agents must have a set of goals such as destination airport and intermediate positions...
Zhaotong Lian, Abhijit Deshmukh