1964
DOI: 10.1109/tac.1964.1105637
|View full text |Cite
|
Sign up to set email alerts
|

An iterative procedure for computing time-optimal controls

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

1966
1966
1996
1996

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(4 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…For linear systems, methods of solution to the minimumtime control problems are well known (See, for example, Neustadt, 1960;Eaton, 1962;Knudsen, 1964;Athans and Falb, 1966. ) In most linear systems, the minimum-time control is of the bang-bang type, in which the control functions are at their upper or lower bounds.…”
Section: Methods Of Solutionmentioning
confidence: 99%
“…For linear systems, methods of solution to the minimumtime control problems are well known (See, for example, Neustadt, 1960;Eaton, 1962;Knudsen, 1964;Athans and Falb, 1966. ) In most linear systems, the minimum-time control is of the bang-bang type, in which the control functions are at their upper or lower bounds.…”
Section: Methods Of Solutionmentioning
confidence: 99%
“…This is impossible to do directly since G is not square. Knudsen (15) overcomes thi-difficulty at by augmenting G with an (a + 1) row which is independent of the others. However, for the control problem considered in this report and, in general, for systems to which the algorithm applies, the problem associated with G being non-square can be solved in a number of ways…”
Section: A4andi4 Evaluating G "mentioning
confidence: 99%
“…Second, providing the initial (terminal) state point does not lie on a switching hypersurface which contains optimal trajectories (i.e., h1 + h 2 3) then the previously described difficulties will not occur if (g, tf) is close enough to (9, tf). In general, this means that in the region where Iyk 0.2 and T:yI.10 the derived and optimal steering functions must have the same shape [15]. This condition will not be satisfied if the "guess" for the optimal control corresponding to states which lie within this region is "bad" or if during the flooding process (1f)i+l ((1o)i+l) is separated from (vf), ((1o),) by a switchin& hypersarface.…”
Section: Selection Of the Iterative Scale Factormentioning
confidence: 99%
“…However, optimal controllers n-hich directly implement the maximum principle are impractical for most systems because of their complexity. Such controllers must always have available a computer capable of rapidly solving the differential equations of the system and then computing the control input as a function of time for every initial condition [2], [ 3 ] . They u-ill usually require an on-line digital computer.…”
mentioning
confidence: 99%