论文信息 - The GRT Planner

The GRT Planner

� This article presents the GRT planner, a forward heuristic state-space planner, and comments on the results obtained from the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS’00) planning competition. The GRT planner works in two phases. In the preprocessing phase, it estimates the distances between the facts and the goals of the problem. During the search phase, the estimates are used to guide a forward-directed search. GRT participated in the STRIPS track of the competition and showed promising results. Although it did not gain any prize, it gave us good prospects for the future.

Ioannis P. Vlahavas | Ioannis Refanidis

[1] Ioannis P. Vlahavas,et al. The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning , 2001, J. Artif. Intell. Res..

[2] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[3] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[4] Ioannis P. Vlahavas,et al. Heuristic Planning with Resources , 2000, ECAI.

[5] Ioannis P. Vlahavas,et al. Exploiting State Constraints in Heuristic State-Space Planning , 2000, AIPS.

[6] Ioannis P. Vlahavas,et al. GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables , 1999, ECP.

[7] Blai Bonet,et al. A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[8] Ioannis Vlahavas,et al. On determining and completing incomplete states in STRIPS domains , 1999, Proceedings 1999 International Conference on Information Intelligence and Systems (Cat. No.PR00446).