Title :
Free time problems with endpoint constraints: a dynamic programming approach
Author_Institution :
Imperial Coll., London, UK
Abstract :
Suppose a verification function associated with an admissible state trajectory x ( ) can be found. Then x ( ) is a local minimizer. So it would be desirable to know when verification functions exist. It is shown that a verification function, appropriately defined, always exists under a normality hypothesis. These results improve on earlier ones since they treat problems with a free end-time and a general endpoint constraint
Keywords :
dynamic programming; optimal control; admissible state trajectory; dynamic programming; free time problems; general endpoint constraint; local minimizer; normality hypothesis; optimal control; verification function; Dynamic programming; Educational institutions; Extrapolation; Hydrogen; Jacobian matrices; Optimal control; Sufficient conditions; Time measurement;
Conference_Titel :
Decision and Control, 1991., Proceedings of the 30th IEEE Conference on
Conference_Location :
Brighton
Print_ISBN :
0-7803-0450-0
DOI :
10.1109/CDC.1991.261300
