Abstract
The design of domain independent heuristic functions often brings up experimental evidence that different heuristics perform well in different domains. A promising approach is to monitor and reduce the error associated with a given heuristic function even as the planner solves a problem. We extend this single-step-error adaptation to heuristic functions from Partial Order Causal Link (POCL) planning. The goal is to allow a partial order planner to observe the effective average-step-error during search. The preliminary evaluation shows that our approach improves the informativeness of the state-of-the-art heuristics. Our planner solves more problems by using the improved heuristics as compared to when it uses current heuristics in the selected domains.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arfaee, S.J., Zilles, S., Holte, R.C.: Learning heuristic functions for large state spaces. Artificial Intelligence 175(16), 2075–2098 (2011)
Bercher, P., Biundo, S.: Encoding partial plans for heuristic search. In: Proceedings of the 4th Workshop on Knowledge Engineering for Planning and Scheduling (KEPS 2013), pp. 11–15. Citeseer (2013)
Bercher, P., Geier, T., Biundo, S.: Using state-based planning heuristics for partial-order causal-link planning. In: Timm, I.J., Thimm, M. (eds.) KI 2013. LNCS, vol. 8077, pp. 1–12. Springer, Heidelberg (2013)
Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artificial Intelligence 90(1), 281–300 (1997)
Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129(1), 5–33 (2001)
Bonet, B., Loerincs, G., Geffner, H.: A robust and fast action selection mechanism for planning. In: AAAI/IAAI. pp. 714–719 (1997)
Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: AIPS, pp. 140–149. Citeseer (2000)
Hoffmann, J.: FF: The fast-forward planning system. AI Magazine 22(3), 57 (2001)
Jesús Virseda, J., Borrajo, D., Alcázar, V.: Learning heuristic functions for cost-based planning. Planning and Learning, 6 (2013)
Joslin, D., Pollack, M.E.: Least-cost flaw repair: A plan refinement strategy for partial-order planning (1994)
McAllester, D., Rosenblatt, D.: Systematic nonlinear planning (1991)
McDermott, D.: Using regression-match graphs to control search in planning. Artificial Intelligence 109(1), 111–159 (1999)
Nguyen, X., Kambhampati, S.: Extracting effective and admissible state space heuristics from the planning graph. In: AAAI/IAAI, pp. 798–805 (2000)
Nguyen, X., Kambhampati, S.: Reviving partial order planning. In: IJCAI, vol. 1, pp. 459–464 (2001)
Penberthy, J.S., Weld, D.S.: UCPOP: A sound, complete, partial order planner for ADL, pp. 103–114. Morgan Kaufmann (1992)
Samadi, M., Felner, A., Schaeffer, J.: Learning from multiple heuristics. In: AAAI, pp. 357–362 (2008)
Schattenberg, B.: Hybrid Planning And Scheduling. Ph.D. thesis, Ulm University, Institute of Artificial Intelligence (2009). URN: urn:nbn:de:bsz:289-vts-68953
Schubert, L., Gerevini, A.: Accelerating partial order planners by improving plan and goal choices. In: Proceedings of the Seventh International Conference on Tools with Artificial Intelligence, pp. 442–450. IEEE (1995)
Thayer, J.T., Dionne, A.J., Ruml, W.: Learning inadmissible heuristics during search. In: ICAPS (2011)
Weld, D.S.: AAAI-10 classic paper award: Systematic nonlinear planning a commentary. AI Magazine 32(1), 101 (2011)
Younes, H.L., Simmons, R.G.: On the role of ground actions in refinement planning. In: AIPS, pp. 54–62 (2002)
Younes, H.L., Simmons, R.G.: Versatile Heuristic Partial Order Planner. J. Artif. Intell. Res. (JAIR) 20, 405–430 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Shekhar, S., Khemani, D. (2015). Improving Heuristics On-the-fly for Effective Search in Plan Space. In: Hölldobler, S., , Peñaloza, R., Rudolph, S. (eds) KI 2015: Advances in Artificial Intelligence. KI 2015. Lecture Notes in Computer Science(), vol 9324. Springer, Cham. https://doi.org/10.1007/978-3-319-24489-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-24489-1_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24488-4
Online ISBN: 978-3-319-24489-1
eBook Packages: Computer ScienceComputer Science (R0)