A Heuristic Search Planner Based on Component Services

KIPS Transactions on Computer and Communication Systems, Vol. 15, No. 2, pp. 159-170, Feb. 2008
10.3745/KIPSTB.2008.15.2.159, Full Text:


Nowadays, one of the important functionalities required from robot task planners is to generate plans to compose existing component services into a new service. In this paper, we introduce the design and implementation of a heuristic search planner, JPLAN, as a kernel module for component service composition. JPLAN uses a local search algorithm and planning graph heuristics. The local search algorithm, EHC , is an extended version of the Enforced Hill-Climbing(EHC) which have shown high efficiency applied in state-space planners including FF. It requires some amount of additional local search, but it is expected to reduce overall amount of search to arrive at a goal state and get shorter plans. We also present some effective heuristic extraction methods which are necessarily needed for search on a large state-space. The heuristic extraction methods utilize planning graphs that have been first used for plan generation in Graphplan. We introduce some planning graph heuristics and then analyze their effects on plan generation through experiments.

Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.

Cite this article
[IEEE Style]
I. C. Kim and H. C. Shin, "A Heuristic Search Planner Based on Component Services," KIPS Journal B (2001 ~ 2012) , vol. 15, no. 2, pp. 159-170, 2008. DOI: 10.3745/KIPSTB.2008.15.2.159.

[ACM Style]
In Cheol Kim and Hang Cheol Shin. 2008. A Heuristic Search Planner Based on Component Services. KIPS Journal B (2001 ~ 2012) , 15, 2, (2008), 159-170. DOI: 10.3745/KIPSTB.2008.15.2.159.