Not Logged In

Planning by Incremental Dynamic Programming

Full Text: sutton91planning.pdf PDF

This paper presents the basic results and ideas of dynamic programming as they relate most directly to the concerns of planning in AI. These form the theoretical basis for the incremental planning methods used in the integrated architecture Dyna. These incremental planning methods are based on continually updating an evaluation function and the situation-action mapping of a reactive system. Actions are generated by the reactive system and thus involve minimal delay, while the incremental planning process guarantees that the actions and evaluation function will eventually be optimal---no matter how extensive a search is required. These methods are well suited to stochastic tasks and to tasks in which a complete and accurate model is not available. For tasks too large to implement the situation-action mapping as a table, supervised-learning methods must be used, and their capabilities remain a significant limitation of the approach.

Citation

R. Sutton. "Planning by Incremental Dynamic Programming". International Workshop on Machine Learning, pp 353-357, January 1991.

Keywords: situation-action, supervised, limitation, machine learning
Category: In Workshop

BibTeX

@misc{Sutton:InternationalWorkshoponMachineLearning91,
  author = {Richard S. Sutton},
  title = {Planning by Incremental Dynamic Programming},
  Pages = {353-357},
  booktitle = {},
  year = 1991,
}

Last Updated: May 31, 2007
Submitted by Staurt H. Johnson

University of Alberta Logo AICML Logo