05.08.2013 Views

guidance, flight mechanics and trajectory optimization

guidance, flight mechanics and trajectory optimization

guidance, flight mechanics and trajectory optimization

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

2.4 LIMITING PROCESS IN DYNAMIC PROGRAMMING<br />

The previous sections have delt exclusively with the computational<br />

aspects of Dynamic Programing <strong>and</strong> have shown how the Principle of Optima-<br />

lity can be used to systematize the search procedure for finding an optimal<br />

decision sequence. As mentioned in Section 2.1, Dynamic Programming is<br />

also a valuable theoretical tool in that it can be used to develop additional<br />

properties of the optimal decision sequence. For example, it is well known<br />

that the optimal solution for the problem of Lagrange (Section 2.2.2) must<br />

satisfy the Euler-Lagrange equation. This differential equation, as well<br />

as other conditions resulting from either an application of the classical<br />

Calculus of Variations or the Pontryagin Maximum Principle, can also be<br />

developed through Dynamic Programming.<br />

To develop these additional properties, the multi-stage decision<br />

process must be considered in the limit as the separation between neigh-<br />

boring states <strong>and</strong> decisions go to zero (i.e., as the process becomes continuous).<br />

That is, the problem is first discretized <strong>and</strong> a finite number of states <strong>and</strong><br />

decisions considered just as in the computational approach of the previous<br />

sections. The Principle of Optimality is then used to develop a recursive<br />

equation by which the numerical values of the optimal decision sequence<br />

are computed. (Th is equation was not given an explicit statement in the<br />

previous sections since it was reasonably obvious there how the Principle<br />

of Optimality was to be used in the search process.) By considering the<br />

discretized process in the limit (i.e., allowing it to become a continuous<br />

process again), the recursive equation which governs the search procedure<br />

in the discrete case becomes a first-order , partial differential equation.<br />

From this partial differential equation, many additional properties of the<br />

optimal decision sequence can be developed.<br />

It should be mentioned that in some cases the limiting process outlined<br />

does not exist <strong>and</strong> the passage to the limit leads to an erroneous result.<br />

While this situation does occur in physically meaningful problems <strong>and</strong>, there-<br />

fore, cannot be classed as pathological, it occurs infrequently enough as<br />

to cause little concern. Some examples of this phenomenon will be given<br />

later on.<br />

2.4.1 Recursive Equation for the Problem of Lagrange<br />

Consider the one-dimensional Lagrange problem of minimizing the<br />

integral<br />

61<br />

(2.4.1)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!