Dynamic CSP in Domain-independent AI Planning

  • Ian Miguel
Part of the Distinguished Dissertations book series (DISTDISS)


This chapter introduces domain-independent AI Planning as an application domain for both dynamic and dynamic flexible CSP solution techniques, the latter development being discussed in Chapters 7 and 8. Recent advances in AI planning have established that the reduction of planning to a constraint satisfaction problem enables a gain in efficiency via the use of the dedicated search algorithms available in this field [82]. This chapter continues in this vein, presenting a novel technique which exploits (restriction/relaxation-based) dynamic CSP in order to further improve planner performance.


Planning Graph Action Node Constraint Satisfaction Problem Domain Element Plan Goal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • Ian Miguel
    • 1
  1. 1.University of YorkUSA

Personalised recommendations