John L. Pollock
Decision-theoretic planning attempts to combine the resources of classical AI planning theory and contemporary decision theory. The basic idea is that plans are assigned expected values, and the planning agent chooses between competing plans in terms of those expected values. This complicates the search for plans in predictable ways, and the natural inclination of the planning theorist is to turn immediately to the task of modifying existing algorithms or finding new algorithms for use in decisiontheoretic- planning. The purpose of this paper is to emphasize that there are logical problems that must be solved before the decisiontheoretic- planning task is even well defined, and to propose solutions to those problems.