179 search results - page 25 / 36 » Using Classical Planners to Solve Nondeterministic Planning ... |
119
Voted
AAAI
2008
15 years 4 months ago
2008
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hind...
111
Voted
AIPS
2006
15 years 3 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
100
click to vote
MICAI
2000
Springer
15 years 5 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
122
click to vote
AAAI
1997
15 years 3 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
113
click to vote
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...