Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Miguel, I. (2004). Dynamic CSP in Domain-independent AI Planning. In: Dynamic Flexible Constraint Satisfaction and its Application to AI Planning. Distinguished Dissertations. Springer, London. https://doi.org/10.1007/978-0-85729-378-7_5
Download citation
DOI: https://doi.org/10.1007/978-0-85729-378-7_5
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1048-4
Online ISBN: 978-0-85729-378-7
eBook Packages: Springer Book Archive