Constraint Based Planning with Composable Substate Graphs

@inproceedings{Gregory2010ConstraintBP,
  title={Constraint Based Planning with Composable Substate Graphs},
  author={Peter Gregory and Derek Long and Maria Fox},
  booktitle={ECAI},
  year={2010}
}
Constraint satisfaction techniques provide powerful inference algorithms that can prune choices during search. Constraint-based approaches provide a useful complement to heuristic search optimal planners. We develop a constraint-based model for cost-optimal planning that uses global constraints to improve the inference in planning. The key novelty in our approach is in a transformation of the SAS input that adds a form of macro-action to fully connect chains of composable operators. This… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Long , ‘ PDDL 2 . 1 : An extension of PDDL for expressing temporal planning domains ’

  • D.
  • Journal of AI Research
  • 2009

Kautz and Bart Selman , ‘ Planning as satisfiability ’

  • A. Henry
  • 2007

Similar Papers

Loading similar papers…