Convergent computational method for relaxed optimal control problems (Q916074): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Tomáš Roubíček / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Tomáš Roubíček / rank
Normal rank
 

Revision as of 04:14, 11 February 2024

scientific article
Language Label Description Also known as
English
Convergent computational method for relaxed optimal control problems
scientific article

    Statements

    Convergent computational method for relaxed optimal control problems (English)
    0 references
    1991
    0 references
    A class of relaxed optimal control problems for ordinary differential equations with a state-space constraint is considered. The discretization by the control parametrization method, formerly proposed by \textit{K. L. Teo} and \textit{C. J. Goh} [ibid. 60, No.1, 117-133 (1989; Zbl 0632.49017); Automatica 24, 3-18 (1988; Zbl 0637.49017)], is modified by admitting a tolerance in the state constraint, which enables one to prove a conditional convergence under certain additional qualification on the dynamics. Also, a counterexample is constructed, showing that the original, nonmodified discretization need not approximate the continuous problem.
    0 references
    relaxed optimal control
    0 references
    control parametrization method
    0 references
    state constraint
    0 references
    convergence
    0 references
    discretization
    0 references

    Identifiers