85 search results - page 3 / 17 » Solving Stochastic Planning Problems with Large State and Ac... |
141
click to vote
JAIR
2008
15 years 1 months ago
2008
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...
AIPS
1994
15 years 3 months ago
1994
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
129
click to vote
AAAI
2008
15 years 4 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
123
click to vote
ICTAI
2000
IEEE
15 years 5 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
108
click to vote
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...