A look-ahead B&B search for cost-based planning

Authors:
Raquel Fuentetaja;Daniel Borrajo;Carlos Linares López
Affiliations:
Departamento de Informática, Universidad Carlos III de Madrid;Departamento de Informática, Universidad Carlos III de Madrid;Departamento de Informática, Universidad Carlos III de Madrid
Venue:
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Year:
2009

Citing 6
Cited 2

Heuristics for Planning with Action Costs Revisited

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Landmarks revisited

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search

Journal of Artificial Intelligence Research
Sapa: a multi-objective metric temporal planner

Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables

Journal of Artificial Intelligence Research
Temporal planning using subgoal partitioning and resolution in SGPlan

Journal of Artificial Intelligence Research

Using the relaxed plan heuristic to select goals in oversubscription planning problems

CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Using linear programming to solve clustered oversubscription planning problems for designing e-courses

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.