

![0_image_0.png](0_image_0.png)

(a) (b) (c)
mate models (Dean, Givan, Leach, 1997) and ecient planning algorithms that use these approximate models (Givan, Leach, Dean, 1997).

5.2 Reachability Analysis and Serial Problem Decomposition 5.2.1 Reachability Analysis all possible states. Regression, therefore, implicitly exploits certain reachability characterproblem decomposition In decomposition problem solving, the MDP is broken into several schematically in Figure 32(a), where regions and B are never explored in the backward are ever deemed relevant. While regions and B may be reachable from the start state, the optimal solution method: regions and B can be ignored if they are unlikely to transition
