656 search results - page 32 / 132 » Complexity of finite-horizon Markov decision process problem... |
168
click to vote
ISSS
1999
IEEE
15 years 10 months ago
1999
IEEE
The policy optimization problem for dynamic power management has received considerable attention in the recent past. We formulate policy optimization as a constrained optimization...
355
click to vote
Publication
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
204
click to vote
ICTAI
2006
IEEE
16 years 20 hour ago
2006
IEEE
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...
192
click to vote
IJRR
2010
15 years 4 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
170
click to vote
AIPS
1998
15 years 7 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...