Planning by guided hill-climbing

Authors:
Seyed Ali Akramifar;Gholamreza Ghassem-Sani
Affiliations:
Computer Engineering Department, Sharif University of Technology, Tehran, Iran;Computer Engineering Department, Sharif University of Technology, Tehran, Iran
Venue:
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Year:
2007

Citing 7
Cited 1

Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Machine Learning

Machine Learning
Stochastic Hillclimbing as a Baseline Method for

Stochastic Hillclimbing as a Baseline Method for
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice
The FF planning system: fast plan generation through heuristic search

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

Journal of Artificial Intelligence Research
Macro-FF: improving AI planning with automatically learned macro-operators

Journal of Artificial Intelligence Research

Fast forward planning by guided enforced hill climbing

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a novel approach will be called guided hill climbing to improve the efficiency of hill climbing in the planning domains. Unlike simple hill climbing, which evaluates the successor states without any particular order, guided hill climbing evaluates states according to an order recommended by an auxiliary guiding heuristic function. Guiding heuristic function is a self-adaptive and cost effective function based on the main heuristic function of hill climbing. To improve the performance of the method in various domains, we defined several heuristic functions and created a mechanism to choose appropriate functions for each particular domain. We applied the guiding method to the enforced hill climbing, which has been used by the Fast Forward planning system (FF). The results show a significant improvement in the efficiency of FF in a number of domains.