Abstract
One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an increase in the size of the model to be solved. We introduce a reformulation of the planning problem in which the problem is described as a meta-CSP, which controls the search of an underlying SAT solver. Our results show that this approach solves a greater number of problems than both Maxplan and Blackbox, and our analysis discusses the advantages and disadvantages of searching in the backwards direction.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Helmert, M.: Complexity results for standard benchmark domains in planning. Artificial Intelligence 143(2), 219–262 (2003)
Helmert, M.: New complexity results for classical planning benchmarks. In: ICAPS 2006. Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, pp. 52–61 (2006)
Blum, A., Furst, M.: Fast planning through planning graph analysis. In: IJCAI 1995. Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 1636–1642 (1995)
Nebel, B., Dimopoulos, Y., Koehler, J.: Ignoring Irrelevant Facts and Operators in Plan Generation. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 338–350. Springer, Heidelberg (1997)
Long, D., Fox, M.: Efficient implementation of the plan graph in STAN. Journal of Artificial Intelligence Research 10, 87–115 (1999)
Kautz, H.A., McAllester, D., Selman, B.: Encoding plans in propositional logic. In: KR 1996. Proceedings of the Fifth International Conference on the Principle of Knowledge Representation and Reasoning, pp. 374–384 (1996)
Xing, Z., Chen, Y., Zhang, W.: Maxplan: Optimal planning by decomposed satisfiability and backward reduction. In: ICAPS 2006. Proceedings of the Fifth International Planning Competition, International Conference on Automated Planning and Scheduling (2006)
Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research (JAIR) 14, 253–302 (2001)
Slaney, J., Thiebaux, S.: Linear time near-optimal planning in the blocks world. In: AAAI 1996. Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, Oregon, USA, pp. 1208–1214. AAAI Press / The MIT Press, Cambridge (1996)
Moffitt, M.D., Pollack, M.E.: Optimal Rectangle Packing: A Meta-CSP Approach. In: Proceedings of the 16th International Conference on Automated Planning and Scheduling, pp. 93–102 (2006)
Hoffmann, J., Porteous, J., Sebastia, L.: Ordered Landmarks in Planning. Journal of Artificial Intelligence Research (JAIR) 22, 215–278 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gregory, P., Long, D., Fox, M. (2007). A Meta-CSP Model for Optimal Planning. In: Miguel, I., Ruml, W. (eds) Abstraction, Reformulation, and Approximation. SARA 2007. Lecture Notes in Computer Science(), vol 4612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73580-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-73580-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73579-3
Online ISBN: 978-3-540-73580-9
eBook Packages: Computer ScienceComputer Science (R0)