Abstract
We introduce a new approach to planning in STRIPS-like domains based on an incremental local search process. This approach arises as an attempt to combine the advantages of a graph-based analysis and a partial-order planner. The search process is carried out by a four-stage algorithm. The starting point is a graph, which totally or partially encodes the planning problem. The aim of the second phase is to obtain a first set of actions of a solution plan, the third stage guarantees the completeness and optimality of the generated solution and the fourth stage, a partial-order planner, completes the process by finding the missing actions of the final solution plan, if any.
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
Blum A. L., Furst M.L.: Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90:281–300 (1997).
Chapman D.: Planning for Conjuntive Goals. Artificial Intelligence 32(3):333–377 (1987).
Fox M., Long D.: STAN public source code. http://www.dur.ac.uk/CompSci/research/stanstuff/ (1999)
Gerevini A., Schubert L.: Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning. Journal of Artificial Intelligence Research 5:95–137 (1996)
Gerevini A., Serina I.: Fast Planning through Greedy Action Graphs. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), 503–510 (1999)
Kautz H., Selman Blackbox Planner 3.6. http://www.research.att.com/kautz/blackbox/ (1999)
Kautz H., Selman The role of domain-specific knowledge in the planning as satisfiability framework. In Proceedings of the 4th International Conference on AI Planning Systems (AIPS-98), 181–189 (1998)
Penberthy J.S., Weld, D.S.: UCPOP: A Sound, Complete, Partial Order Planner for ADL. In Proceedings of the 1992 International Conference on Principles of Knowledge Representation and Reasoning, 103–114 (1992). Morgan Kaufmann, Los Altos, CA
Sebastia L., Onaindia E., Marzal E.: Improving expressivity and efficiency in Partial-Order Causal Link Planners. In Proceedings of the 18th Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG-99), 124–136 (1999)
Sebastia L., Onaindia E., Marzal E.: A Graph-Based Approach for POCL Planning. In Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-00), 531–535 (2000)
Onaindia E., Sebastia L., Marzal E.: 4SP: A four-stage planning process. In Proceedings of the ECAI-00 Workshop on New Results on Planning and Scheduling (PuK 2000), 115–129 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Onaindia, E., Sebastia, L., Marzal, E. (2001). Incremental Local Search for Planning Problems. In: Nareyek, A. (eds) Local Search for Planning and Scheduling. LSPS 2000. Lecture Notes in Computer Science(), vol 2148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45612-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-45612-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42898-5
Online ISBN: 978-3-540-45612-4
eBook Packages: Springer Book Archive