Abstract
This paper focuses on heuristic cost-based planning. We propose a combination of a heuristic designed to deal with this planning model together with the usage of look-ahead states based on relaxed plans to speed-up the search. The search algorithm is a modified Best-First Search (BFS) performing Branch and Bound (B&B) to improve the last solution found. The objective of the work is to obtain a good balance between the quality of the plans and the search time. The experiments show that the combination is effective in most of the evaluated domains.
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
Benton, J., van den Briel, M., Kambhampati, S.: A hibrid linear programming and relaxed plan heuristic for partial satisfaction planning problems. In: Proc. of the 17th ICAPS, pp. 34–41 (2007)
Bryce, D., Kambhampati, S.: How to skin a planning graph for fun and profit: A tutorial on planning graph based reachability heuristics. AI Magazine 28(1), 47–83 (2007)
Chen, Y., Hsu, C., Wah, B.: Temporal planning using subgoal partitioning and resolution in SGPlan. JAIR 26, 323–369 (2006)
Do, M.B., Kambhampati, S.: Sapa: A scalable multi-objective heuristic metric temporal planner. JAIR 20, 155–194 (2003)
Gerevini, A., Saetti, A., Serina, I.: Planning with numerical expressions in LPG. In: Proc. of the 16th ECAI, pp. 667–671 (2004)
Hoffmann, J.: The Metric-FF planning system: Translating “ignoring delete lists” to numeric state variables. JAIR 20, 291–341 (2003)
Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. JAIR 14, 253–302 (2001)
Keyder, E., Geffner, H.: Heuristics for planning with action costs revisited. In: Proc. of the 18th ECAI (2008)
Richter, S., Helmert, M., Westphal, M.: Landmarks revisited. In: Proc. of the 23rd AAAI, pp. 975–982 (2008)
Sapena, O., Onaindía, E.: Handling numeric criteria in relaxed planning graphs. In: Lemaître, C., Reyes, C.A., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 114–123. Springer, Heidelberg (2004)
Vidal, V.: A lookahead strategy for heuristic search planning. In: Proc. of the 14th ICAPS, pp. 150–159 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fuentetaja, R., Borrajo, D., López, C.L. (2010). A Look-Ahead B&B Search for Cost-Based Planning. In: Meseguer, P., Mandow, L., Gasca, R.M. (eds) Current Topics in Artificial Intelligence. CAEPIA 2009. Lecture Notes in Computer Science(), vol 5988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14264-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-14264-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14263-5
Online ISBN: 978-3-642-14264-2
eBook Packages: Computer ScienceComputer Science (R0)