The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs hard for modern probabilistic planners. Implicit dead ends, states with executable actions but no path to the goal, are particularly challenging; existing MDP solvers spend much time and memory identifying these states. As a first attempt to address this issue, we propose a machine learning algorithm called SIXTHSENSE. SIXTHSENSE helps existing MDP solvers by finding nogoods, conjunctions of literals whose truth in a state implies that the state is a dead end. Importantly, our learned nogoods are sound, and hence the states they identify are true dead ends. SIXTHSE...
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). ...
AbstractClosed-world inference—an essential component of many planning algorithms—is the process of ...
One traditional use of critical-path heuristic functions is as effective sufficient criteria for uns...
AbstractMarkov Decision Processes (MDPs) describe a wide variety of planning scenarios ranging from ...
Recent domain-determinization techniques have been very successful in many probabilistic planning pr...
Dead-end detection is a key challenge in automated planning, and it is rapidly growing in popularity...
There has been an astounding improvement in domain-independent planning for solvable instances over ...
Planning is a central research area in artificial intelligence, and a lot of effort has gone into co...
We introduce a state space search method that identifies dead-end states, analyzes the reasons for f...
In contrast to previous competitions, where the problems were goal-based, the 2011 International Pro...
International audienceMarkov Decision Processes (MDPs) are employed to model sequential decision-mak...
While MDPs are powerful tools for modeling sequential decision making problems under uncertainty, th...
Markov decision processes (MDP) offer a rich model that has been extensively used by the AI communit...
We consider online planning in Markov decision processes (MDPs). In online planning, the agent focus...
In real world environments the state is almost never completely known. Exploration is often expensiv...
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). ...
AbstractClosed-world inference—an essential component of many planning algorithms—is the process of ...
One traditional use of critical-path heuristic functions is as effective sufficient criteria for uns...
AbstractMarkov Decision Processes (MDPs) describe a wide variety of planning scenarios ranging from ...
Recent domain-determinization techniques have been very successful in many probabilistic planning pr...
Dead-end detection is a key challenge in automated planning, and it is rapidly growing in popularity...
There has been an astounding improvement in domain-independent planning for solvable instances over ...
Planning is a central research area in artificial intelligence, and a lot of effort has gone into co...
We introduce a state space search method that identifies dead-end states, analyzes the reasons for f...
In contrast to previous competitions, where the problems were goal-based, the 2011 International Pro...
International audienceMarkov Decision Processes (MDPs) are employed to model sequential decision-mak...
While MDPs are powerful tools for modeling sequential decision making problems under uncertainty, th...
Markov decision processes (MDP) offer a rich model that has been extensively used by the AI communit...
We consider online planning in Markov decision processes (MDPs). In online planning, the agent focus...
In real world environments the state is almost never completely known. Exploration is often expensiv...
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). ...
AbstractClosed-world inference—an essential component of many planning algorithms—is the process of ...
One traditional use of critical-path heuristic functions is as effective sufficient criteria for uns...