Abstract
Conventional methods for AI planning use highly specific representations and search methods that can hardly be adapted or extended. Recently, approaches based on more general search frameworks like propositional satisfiability, operations research and constraint programming have been developed. This paper presents a model for domain-independent planning based on an extension of constraint programming. The extension makes it possible to explore the search space without the need to focus on plan length, and to favor other criteria like resource-related properties.
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.
References
Ambite, J. L., and Knoblock, C. A. 1997. Planning by Rewriting: Efficiently Generating High-Quality Plans. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 706–713.
Blum, A. L., and Furst, M. L. 1997. Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90: 281–300.
Bockmayr, A., and Dimopoulos, D. 1998. Mixed Integer Programming Models for Planning Problems. In Working Notes of the CP98 Workshop on Constraint Problem Reformulation.
Ehrig, H.; Pfender, M.; and Schneider, H. J. 1973. Graph Grammars: An Algebraic Approach. In Proceedings of the 14th Annual Symposium on Switching and Automata Theory (SWAT), 167–180.
El-Kholy, A., and Richards, B. 1996. Temporal and Resource Reasoning in Planning: the porcPLAN approach. In Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI-96), 614–618.
Fikes, R. E., and Nilsson, N. 1971. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 5(2): 189–208.
Kautz, H., and Selman, B. 1996. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1194–1201.
Kautz, H., and Walser, J. P. 1999. State-space Planning by Integer Optimization. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), 526–533.
Muscettola, N. 1994. HSTS: Integrating Planning and Scheduling. In Zweben, M., and Fox, M. S. (eds.), Intelligent Scheduling, Morgan Kaufmann, 169–212.
Nareyek, A. 1998. A Planning Model for Agents in Dynamic and Uncertain Real-Time Environments. In Proceedings of the Workshop on Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments at the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS-98), Technical Report, WS-98–02, 7–14. AAAI Press, Menlo Park, California.
Nareyek, A. 1999. Structural Constraint Satisfaction. In Papers from the 1999 AAAI Workshop on Configuration, Technical Report, WS-99–05, 76–82. AAAI Press, Menlo Park, California.
Nareyek, A. 1999. Applying Local Search to Structural Constraint Satisfaction. In Proceedings of the IJCAI-99 Workshop on Intelligent Workflow and Process Management: The New Frontier for AI in Business.
Penberthy, J. S., and Weld, D. S. 1992. UCPOP: A Sound, Complete, Partial Order Planner for ADL. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (KR′92), 102–114.
Rintanen, J., and Jungholt, H. 1999. Numeric State Variables in Constraint-based Planning. In Proceedings of the Fifth European Conference on Planning (ECP-99).
Rozenberg, G. ed. 1997. The Handbook of Graph Grammars. Volume I: Foundations. Reading, World Scientific.
Van Beek, P., and Chen, X. 1999. CPlan: A Constraint Programming Approach to Planning. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), 585–590.
Verfaillie, G., and Schiex, T. 1994. Solution Reuse in Dynamic Constraint Satisfaction Problems. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), 307–312.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Nareyek, A. (2000). AI Planning in a Constraint Programming Framework. In: Hommel, G. (eds) Communication-Based Systems. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9608-4_13
Download citation
DOI: https://doi.org/10.1007/978-94-015-9608-4_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5399-2
Online ISBN: 978-94-015-9608-4
eBook Packages: Springer Book Archive