Sciweavers

3 search results - page 1 / 1
» Anytime Algorithms for Solving Possibilistic MDPs and Hybrid...
Sort
View
ICTAI
2006
IEEE
13 years 9 months ago
A New Hybrid GA-MDP Algorithm For The Frequency Assignment Problem
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...
Lhassane Idoumghar, René Schott
AAAI
2008
13 years 6 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
JAIR
2008
107views more  JAIR 2008»
13 years 3 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld