Abstract
Pattern databases (PDBs) are memory-based abstraction heuristics that are constructed prior to the planning process which, if expressed symbolically, yield a very efficient representation. Recent work in the automatic generation of symbolic PDBs has established it as one of the most successful approaches for cost-optimal domain-independent planning. In this paper, we contribute two planners, both using bin-packing for its pattern selection. In the second one, we introduce a greedy selection algorithm called Partial-Gamer, which complements the heuristic given by bin-packing. We tested our approaches on the benchmarks of the last three International Planning Competitions, optimal track, getting very competitive results, with this simple and deterministic algorithm.
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
Notes
- 1.
The average heuristic value has shown empirically that it is a good metric. While it is not the solution to evaluating the pattern selection problem perfectly, it is a good approximation up to this point.
References
Bäckström, C.: Equivalence and tractability results for SAS+ planning. In: KR, pp. 126–137 (1992)
Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1–2), 165–204 (1994)
Culberson, J.C., Schaeffer, J.: Pattern databases. Comput. Intell. 14(4), 318–334 (1998)
Dósa, G.: The tight bound of first fit decreasing bin-packing algorithm is FFD(i) \({\le }\) 11/9opt (i)+ 6/9. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 1–11. Springer, Berlin (2007). https://doi.org/10.1007/978-3-540-74450-4_1
Edelkamp, S.: Symbolic pattern databases in heuristic search planning. In: AIPS, pp. 274–283 (2002)
Edelkamp, S.: Automated creation of pattern database search heuristics. In: Edelkamp, S., Lomuscio, A. (eds.) MoChArt 2006. LNCS (LNAI), vol. 4428, pp. 35–50. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74128-2_3
Edelkamp, S.: Planning with pattern databases. In: Sixth European Conference on Planning (2014)
Fikes, R.E., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3–4), 189–208 (1971)
Franco, S., Torralba, A., Lelis, L.H., Barley, M.: On creating complementary pattern databases. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 4302–4309. AAAI Press (2017)
Garey, M.R., Johnson, D.S.: Computers and Intractibility, A Guide to the Theory of NP-Completeness. Freeman & Company, New York (1979)
Gaschnig, J.: A problem similarity approach to devising heuristics: first results, pp. 434–441 (1979)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)
Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning, pp. 1007–1012 (2007)
Haslum, P., Bonet, B., Geffner, H., et al.: New admissible heuristics for domain-independent planning. In: AAAI, vol. 5, pp. 9–13 (2005)
Helmert, M.: A planning heuristic based on causal graph analysis, pp. 161–170 (2004)
Helmert, M.: The fast downward planning system. J. Artif. Intell. Res. 26, 191–246 (2006)
Holland, J.: Adaption in natural and artificial systems. Ph.D. thesis, University of Michigan (1975)
Holte, R., Newton, J., Felner, A., Meshulam, R., Furcy, D.: Multiple pattern databases, pp. 122–131 (2004)
Holte, R.C., Hernádvölgyi, I.T.: A space-time tradeoff for memory-based heuristics. In: AAAI/IAAI, pp. 704–709. Citeseer (1999)
Katz, M., Domshlak, C.: Optimal additive composition of abstraction-based admissible heuristics. In: ICAPS, pp. 174–181 (2008)
Kissmann, P., Edelkamp, S.: Improving cost-optimal domain-independent symbolic planning. In: Twenty-Fifth AAAI Conference on Artificial Intelligence (2011)
Korf, R.E.: Finding optimal solutions to Rubik’s cube using pattern databases, pp. 700–705 (1997)
Korf, R.E., Felner, A.: Disjoint pattern database heuristics. In: Chips Challenging Champions: Games, Computers and Artificial Intelligence, pp. 13–26. Elsevier (2002)
McDermott, D.: The 1998 AI planning systems competition. In: AI Magazine, pp. 35–55 (1998)
Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Boston (1984)
Pommerening, F., Helmert, M., Röger, G., Seipp, J.: From non-negative to general operator cost partitioning. In: Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)
Preditis, A.: Machine discovery of admissible heuristics. Mach. Learn. 12, 117–142 (1993)
Seipp, J., Helmert, M.: Counterexample-guided Cartesian abstraction refinement for classical planning. J. Artif. Intell. Res. 62, 535–577 (2018)
Seipp, J., Keller, T., Helmert, M.: A comparison of cost partitioning algorithms for optimal classical planning. In: Twenty-Seventh International Conference on Automated Planning and Scheduling (2017)
Valtorta, M.: A result on the computational complexity of heuristic estimates for the A* algorithm. Inf. Sci. 34, 48–59 (1984)
Yang, F., Culberson, J., Holte, R., Zahavi, U., Felner, A.: A general theory of additive state space abstractions. J. Artif. Intell. Res. 32, 631–662 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Moraru, I., Edelkamp, S., Franco, S., Martinez, M. (2019). Simplifying Automated Pattern Selection for Planning with Symbolic Pattern Databases. In: Benzmüller, C., Stuckenschmidt, H. (eds) KI 2019: Advances in Artificial Intelligence. KI 2019. Lecture Notes in Computer Science(), vol 11793. Springer, Cham. https://doi.org/10.1007/978-3-030-30179-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-30179-8_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30178-1
Online ISBN: 978-3-030-30179-8
eBook Packages: Computer ScienceComputer Science (R0)