Paper Title:
OHCP: A Local Search Planner Based on Ordered Hill Climbing Algorithm and Local-Minimal Restart Strategy
  Abstract

This paper describes OHCP, a fast planner using local search based on Ordered Hill Climbing (OHC) search algorithm and local-minimal restart strategy. OHC is used as a basis of a heuristic planner in conjunction with relaxed planning graph heuristic. A novel approach is proposed in OHC framework to extract useful information from relaxed plans to preorder all promising neighborhoods, which can cut down the frequency of calling the heuristic evaluation procedure. In order to preserve completeness and improve search effort, a new restart strategy for complete search from local minimal is proposed when the local search guided by OHC fails. The ideas are implemented in our planner OHCP. Experimental results show strong performance of the proposed planner on recent international planning competition domains.

  Info
Periodical
Advanced Materials Research (Volumes 219-220)
Edited by
Helen Zhang, Gang Shen and David Jin
Pages
1683-1688
DOI
10.4028/www.scientific.net/AMR.219-220.1683
Citation
R. S. Liang, H. Ma, M. Huang, "OHCP: A Local Search Planner Based on Ordered Hill Climbing Algorithm and Local-Minimal Restart Strategy", Advanced Materials Research, Vols. 219-220, pp. 1683-1688, 2011
Online since
March 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Guo Sheng Сhen
Chapter 17: Plant Protection and Biotechnology
Abstract:Due to human factors, plant introduction that makes the introduced plants cross over insurmountable space boundary under the natural brings...
5351