Open AccessAn Introduction to Least Commitment Planning
Author(s) -
Weld Daniel S.
Publication year - 1994
Publication title -
ai magazine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
DOI - 10.1609/aimag.v15i4.1109
Subject(s) - planner , precondition , modal , computer science , simple (philosophy) , completeness (order theory) , representation (politics) , process (computing) , artificial intelligence , mathematics , programming language , epistemology , political science , mathematical analysis , philosophy , chemistry , politics , polymer chemistry , law
Recent developments have clarified the process of generating partially ordered, partially specified sequences of actions whose execution will achieve an agent's goal. This article summarizes a progression of least commitment planners, starting with one that handles the simple strips representation and ending with ucpop , a planner that manages actions with disjunctive precondition, conditional effects, and universal quantification over dynamic universes. Along the way, I 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 ucpop .