State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning

@article{Bryce2011StateAP,
  title={State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning},
  author={Daniel Bryce and William Cushing and Subbarao Kambhampati},
  journal={Artif. Intell.},
  year={2011},
  volume={175},
  pages={848-889}
}
Planning graphs have been shown to be a rich source of heurist ic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states, and the naive technique enumerates the graphs indiv idually. This is equivalent to solving an all-pairs shortest path problem by iterating a single-sour ce algorithm over each source. We introduce a structure, the state agnostic planning graph , that directly solves the all-pairs problem for the… CONTINUE READING