Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning
- 31 July 1995
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 76 (1-2), 167-238
- https://doi.org/10.1016/0004-3702(94)00076-d
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A comparative analysis of partial order planning and task reduction planningACM SIGART Bulletin, 1995
- Relating the performance of partial-order planning algorithms to domain featuresACM SIGART Bulletin, 1995
- Multi-contributor causal structures for planning: a formalization and evaluationArtificial Intelligence, 1994
- AN EVALUATION OF THE TEMPORAL COHERENCE HEURISTIC IN PARTIAL-ORDER PLANNINGComputational Intelligence, 1994
- Partial-order planning: Evaluating possible efficiency gainsArtificial Intelligence, 1994
- Statistical methods for analyzing speedup learning experimentsMachine Learning, 1994
- Automatic recognition of tractability in inference relationsJournal of the ACM, 1993
- Formalizing planning knowledge for hierarchical planningComputational Intelligence, 1990
- Synthesizing plans that contain actions with context‐dependent effects1Computational Intelligence, 1988
- Planning in a hierarchy of abstraction spacesArtificial Intelligence, 1974