An Introduction to Least Commitment Planning

Daniel S. Weld

Abstract


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.

Full Text:

PDF


DOI: http://dx.doi.org/10.1609/aimag.v15i4.1109

Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.