DYNAMIC PROGRAMMING USING SHIFT VECTORS.
Abstract
A new procedure is presented to handle the excessive computer storage requirements of dynamic programming. The procedure consists in describing the state of the system in terms of a new quantity called a shift vector, and performing the conventional dynamic programming algorithm. The procedure is applicable to systems described by coupled nonlinear difference and differential equations, and to a small class of distributed parameter systems. Shift vectors have the property of evolving in time with a reduced number of degrees of freedom. This property of shift vectors allows one to decompose the state space into blocks, so that data can be efficiently interchanged between primary and secondary computer memories. A secondary result is that the shift vector description allows one to perform interpolation calculations required in conventional dynamic programming in a greatly reduced state space. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1967
- Accession Number
- AD0824039
Entities
People
- Peter J. Wong
Organizations
- Stanford University