|
45
|
Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning
– David Joslin, Martha E. Pollack
- 1994
|
|
381
|
UCPOP: A Sound, Complete, Partial Order Planner for ADL
– J. Scott Penberthy, Daniel S. Weld
- 1992
|
|
41
|
Threat-removal strategies for partial-order planning
– Mark A. Peot
- 1993
|
|
358
|
Systematic Nonlinear Planning
– David Mcallester, David Rosenblitt
- 1991
|
|
852
|
Fast Planning Through Planning Graph Analysis
– Avrim L. Blum, Merrick L. Furst
- 1995
|
|
34
|
Flaw Selection Strategies for Partial-Order Planning
– Martha E. Pollack, David Joslin, Massimo Paolucci
- 1997
|
|
463
|
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
– Henry Kautz, Bart Selman
- 1996
|
|
1555
|
STRIPS: A new approach to the application of theorem proving to problem solving
– R E Fikes, N J Nilsson
- 1971
|
|
51
|
Reviving Partial Order Planning
– Xuanlong Nguyen, Subbarao Kambhampati
- 2001
|
|
96
|
Temporal Planning with Continuous Change
– J. Scott Penberthy, Daniel S. Weld
- 1994
|
|
241
|
Practical Planning: Extending the Classical AI Planning Paradigm
– D E Wilkins
- 1988
|
|
53
|
The First Law of Robotics (a call to arms)
– Daniel Weld, Oren Etzioni
- 1994
|
|
240
|
An introduction to least commitment planning
– Daniel S. Weld
- 1994
|
|
294
|
O-Plan: the Open Planning Architecture
– Ken Currie, Austin Tate, South Bridge
- 1990
|
|
42
|
Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning
– Alfonso Gerevini, Lenhart Schubert
- 1996
|
|
730
|
A formal basis for the heuristic determination of minimum cost paths
– P E Hart, N J Nilsson, B Raphael
- 1968
|
|
56
|
Using Regression-Match Graphs to Control Search in Planning
– Drew Mcdermott
- 1999
|
|
463
|
The FF planning system: Fast plan generation through heuristic search
– Jörg Hoffmann, Bernhard Nebel
- 2001
|
|
127
|
A Robust and Fast Action Selection Mechanism for Planning
– Blai Bonet, Gábor Loerincs, Héctor Geffner
- 1997
|
