Accelerating Partial Order Planners by Improving Plan and Goal Choices (1995)
| Venue: | In Proceedings of the Seventh International Conference on Tools with Artificial Intelligence |
| Citations: | 15 - 2 self |
BibTeX
@INPROCEEDINGS{Schubert95acceleratingpartial,
author = {Lenhart Schubert and Alfonso Gerevini},
title = {Accelerating Partial Order Planners by Improving Plan and Goal Choices},
booktitle = {In Proceedings of the Seventh International Conference on Tools with Artificial Intelligence},
year = {1995},
pages = {442--450},
publisher = {IEEE Computer Society Press}
}
OpenURL
Abstract
We describe some simple domain-independent improvements to plan-refinement strategies for well-founded partial order planning that promise to bring this style of planning closer to practicality. One suggestion concerns the strategy for selecting plans for refinement among the current (incomplete) candidate plans. We propose an A* heuristic that counts only steps and open conditions, while ignoring "unsafe conditions" (threats). A second suggestion concerns the strategy for selecting open conditions (goals) to be established next in a selected incomplete plan. Here we propose a variant of a strategy suggested by Peot & Smith and studied by Joslin & Pollack; the variant gives top priority to unmatchable open conditions (enabling the elimination of the plan), secondhighest priority to goals that can only be achieved uniquely, and otherwise uses LIFO prioritization. The preference for uniquely achievable goals is a "zerocommitment " strategy in the sense that the corresponding plan refinem...







