guidance, flight mechanics and trajectory optimization

The algorithm for solving this problem will now be discussed. First, the
state space must be divided properly. To do this, an increment measure for
each coordinate must be defined. Let A. be the increment measure of
the it& coordinate so the extent of each%oordinate is Lj?,M& Us*, P?
where L, 14, N, and P are integers that are large enough to make the msximm'
value of each coordinate as close as possible to the maximum value needed
by that coordinate without exceeding that maximum value. For instance, if
the maximum value required by xl is 51, 324 ft. and it was decided to use
% = 1,000 ft., then L would be chosen as 51. Since there is a set of
terminal points, N and P must be chosen to accommodate max (;C,) and msx
(Pf), respectively.
The cost of all points ( -/S,,Z?~?~ , n23 , p,$ )
R = 0, &..,f
-m = 0, (...,M
77 = 0) /,...,n/
p = 0, (.*.,P
must be found as previously distiussed. For this particular case, the initial
point till be assumed to be (O,O,O,O>. The set of states that can result
from the first decision includesthe following points:
32