Chapter
18
Uncertainty with
Neoclassical Techniques
18.1 Introduction
In Chapters 16 and 17, we discussed two approaches devised to solve the problem
of planning under uncertainty: planning based on Markov Decision Processes and
planning based on model checking. In addition, some approaches originally devised
for classical planning problems have been extended to deal with some form of
uncertainty. Some of them are based on plan-space planning, state-space planning,
planning-graph techniques, and planning as satisfiability.
In this chapter, we focus on extensions to two neoclassical techniques, planning
as satisfiability (Section 18.2) and planning-graph techniques (Section 18.3), while
other approaches are mentioned in Section 18.4. We limit our discussion ...