##

12.1.3 Algorithms for Probabilistic I-Spaces (POMDPs)

For the probabilistic case, the methods of Section
10.2 cannot be applied because
is a
continuous space. Dynamic programming methods for continuous state
spaces, as covered in Section 10.6, are needed. The main
difficulty is that the dimension of grows linearly with the
number of states in . If there are states in , the
dimension of is . Since the methods of Section
10.6 suffer from the curse of dimensionality, the general
dynamic programming techniques are limited to problems in which
has only a few states.

**Subsections**

Steven M LaValle
2012-04-20