Dynamic CSP in Domain-independent AI Planning
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 . This chapter continues in this vein, presenting a novel technique which exploits (restriction/relaxation-based) dynamic CSP in order to further improve planner performance.
KeywordsPlanning Graph Action Node Constraint Satisfaction Problem Domain Element Plan Goal
Unable to display preview. Download preview PDF.