An Introduction to Least Commitment Planning
The DOI matches its OpenAlex record; 48 of the 48 references it cites were found in a registry or an index.
Abstract
Recent developments have clarified the process of generating partially ordered, partially specified sequences of actions whose execution will achive an agent's goal. This paper summarizes a progression of least commitment planners, starting with one that handles the simple strips representation, and ending with one that manages actions with disjunctive precondition, conditional effects and universal quantification over dynamic universes. Along the way we explain how Chapman's formulation of the Modal Truth Criterion is misleading and why his NP-completeness result for reasoning about plans with conditional effects does not apply to our planner. 1 I thank Franz Amador, Tony Barrett, Darren Cronquist, Denise Draper, Ernie Davis, Oren Etzioni, Nort Fowler, Rao Kambhampati, Craig Knoblock, Nick Kushmerick, Neal Lesh, Karen Lochbaum, Drew McDermott, Ramesh Patil, Kari Pulli, Ying Sun, Austin Tate and Mike Williamson for helpful comments, but retain sole responsibility for errors. This res...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
Fikes, R. E., & Nilsson, N. J. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90010-5 · Cited by 4,882 · cited 1×
“The acronym STRIPS stands for Stanford Research Institute problem solver, which is a famous and influential planner built in the 1970s to control an unstable mobile robot known affectionately as SHAKEY (Fikes and Nilsson 1971).”
BackgroundReiter, R. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90014-4 · Cited by 3,892
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“Another approach, called regression planning (Waldinger 1977), is outlined in algorithm 2. Instead of searching forward from the initial state (which is what PROGWS does), the REGWS algorithm (adapted from Nilsson [1980] ) searches backwards from the goal.”
MethodShoham, Y. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90034-9 · Cited by 2,041
Logical Foundations of Artificial Intelligence
(1987) · Elsevier eBooks · doi:10.1016/c2009-0-27551-9 · Cited by 1,567
Planning for conjunctive goals
Chapman, D. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90092-0 · Cited by 1,112
Introduction to artificial intelligence
(2011) · Choice Reviews Online · doi:10.5860/choice.49-0903 · Cited by 1,085
GPS, A PROGRAM THAT SIMULATES HUMAN THOUGHT
Newell, A., & Simon, H. A. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50040-6 · Cited by 807
UCPOP: a sound, complete, partial order planner for ADL
Penberthy, J. S., & Weld, D. S. (1992) · Cited by 676
Self-citation
Cited by
Fast planning through planning graph analysis
Blum, A. L., & Furst, M. L. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(96)00047-1 · Cited by 1,564
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
Boutilier, C., Dean, T., & Hanks, S. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.575 · Cited by 1,074
Bonet, B., & Geffner, H. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00108-4 · Cited by 959
Remote Agent: to boldly go where no AI system has gone before
Muscettola, N., Nayak, P. P., Pell, B., & Williams, B. C. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00068-x · Cited by 698
Narrative Planning: Balancing Plot and Character
Riedl, M. O., & Young, R. M. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2989 · Cited by 522
Artificial intelligence: foundations of computational agents
(2010) · Choice Reviews Online · doi:10.5860/choice.48-2130 · Cited by 415
Fast Planning Through Planning Graph Analysis.
Blum, A. L., & Furst, M. L. (1995) · doi:10.21236/ada303260 · Cited by 365
Intelligent agents on the Internet: Fact, fiction, and forecast
Etzioni, O., & Weld, D. S. (1995) · IEEE Expert · doi:10.1109/64.403956 · Cited by 324
Self-citationThe 1998 AI Planning Systems Competition
McDermott, D. M. (2000) · doi:10.1609/aimag.v21i2.1506 · Cited by 294
Hierarchical GUI test case generation using automated planning
Memon, A. M., Pollack, M. E., & Soffa, M. L. (2001) · IEEE Transactions on Software Engineering · doi:10.1109/32.908959 · Cited by 263
Metadata
- Authors
- Weld, D. S.
- Published
- 1994-12-15
- Volume
- 15
- Issue
- 4
- Pages
- 27-61
- OpenAlex
- W2164457256
- Cited by
- 581
- References
- 48
- FWCI
- 29.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.