32 search results - page 5 / 7 » Planning with Durative Actions in Stochastic Domains |
ICTAI
2009
IEEE
13 years 3 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
AIPS
2008
13 years 8 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
AINA
2007
IEEE
13 years 9 months ago
2007
IEEE
Many Ubiquitous computing applications can be considered as planning and acting problems in environments characterised by uncertainty and partial observability. Such systems rely ...
ROBOCUP
2007
Springer
13 years 12 months ago
2007
Springer
Reinforcement learning is a paradigm under which an agent seeks to improve its policy by making learning updates based on the experiences it gathers through interaction with the en...
JAIR
2008
13 years 5 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...