Dynamic Programming with Continuous Independent Variable

Front Cover
Department of Electrical Engineering, Stanford University., 1964 - Programming (Mathematics) - 94 pages
0 Reviews
In this study a computational procedure for solving optimal control problems, called dynamic programming with continuous independent variable, has been developed. The new procedure, is based on iterative application of Bellman's principle of optimality. It differs from the conventional method in the choice of the time interval over which a given control is applied. Instead of using a fixed interval, the new procedure determines the time interval as the minimum time required for at least one of the state variables to change by one increment. Specialized computations near the boundaries of the block permit the optimal trajectories any desired degree of freedom in passing from block to block. This technique has been applied in a computer program which calculates minimum fuel trajectories for supersonic (Mach 3) aircraft under a variety of conditions and constraints. Computation of the optimal bounded control of linear plants has been studied in detail. (Author).

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

INTRODUCTION
1
Concept of Continuous Independent Variable
7
Procedure without Complete Control
18

7 other sections not shown

Common terms and phrases

Bibliographic information