Accession Number : AD0615109

Title :   FEASIBLE CONTROL COMPUTATIONS USING DYNAMIC PROGRAMMING.

Descriptive Note : Physical and mathematical sciences research paper,

Corporate Author : AIR FORCE CAMBRIDGE RESEARCH LABS L G HANSCOM FIELD MASS

Personal Author(s) : Kahne,Stephen J.

Report Date : APR 1965

Pagination or Media Count : 25

Abstract : The application of Bellman's dynamic programming technique to realistic control problems has generally been precluded by excessive storage requirements inherent in the method. In this paper, the notion of state mobility is described and shown to be valuable in reducing certain classes of dynamic programming calculations to manageable size. The scheme requires one simple calculation at each stage of the process. In many cases even this calculation may be omitted. It results in the reduction of the range of allowable 'state' variables to be scanned. The amount of reduction varies from problem to problem. A simple example exhibits a fifty percent reduction. This corresponds to a fifty percent reduction in storage requirements for the problem. Reductions of one or two orders of magnitude appear possible for certain classes of problems. (Author)

Descriptors :   (*OPTIMIZATION, CONTROL), (*DYNAMIC PROGRAMMING, CONTROL), CALCULUS OF VARIATIONS, FEASIBILITY STUDIES, SEQUENTIAL ANALYSIS, OPERATIONS RESEARCH, DYNAMICS

Distribution Statement : APPROVED FOR PUBLIC RELEASE