scholarly journals On unbounded solutions of Bellman's equation associated with optimal switching control problems with state constraints

1995 ◽  
Vol 31 (1) ◽  
pp. 1-17 ◽  
Author(s):  
R. L. V. Gonzalez ◽  
E. Rofman
Keyword(s):  
State Constraints ◽  
Switching Control ◽  
Control Problems ◽  
Optimal Switching ◽  
Unbounded Solutions ◽  
Bellman's Equation ◽  
Bellman’S Equation

scholarly journals Nonlinearly constrained optimal control problems

1992 ◽  
Vol 33 (4) ◽  
pp. 517-530 ◽  
Author(s):  
K. L. Teo ◽  
K. H. Wong
Keyword(s):  
Optimal Control ◽  
General Class ◽  
State Constraints ◽  
Computational Algorithm ◽  
Optimal Control Problems ◽  
Control Problems ◽  
Constrained Optimal Control ◽  
Continuous State ◽  
Constraint Transcription ◽  
Inequality Type

AbstractIn a paper by Teo and Jennings, a constraint transcription is used together with the concept of control parametrisation to devise a computational algorithm for solving a class of optimal control problems involving terminal and continuous state constraints of inequality type. The aim of this paper is to extend the results to a more general class of constrained optimal control problems, where the problem is also subject to terminal equality state constraints. For illustration, a numerical example is included.

Sign in / Sign up

Export Citation Format

Share Document