Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Hamilton Jacobi theory for optimal control problems with data measurable in time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vinter, R.B. ; Dept. of Electr. Eng., Imperial Coll., London, UK ; Wolenski, P.

Dynamic programming provides necessary and sufficient conditions on minimizing arcs in terms of solutions to the hamiltonian Jacobi equation or inequality. The hypotheses under which such results have previously been obtained typically require the data to be continuous in its time dependence. Results in which this restriction is lifted are presented. The right side of the differential inclusion is merely required to be measurable in time and Lipshitz continuous in the state variable and to satisfy the growth conditions of Valadier's existence theory. In this setting it is found that verification functions can be defined in terms of lower Dini solutions of the Hamilton Jacobi inequality. The value function is the upper envelope of the set of all verification functions

Published in:

Decision and Control, 1989., Proceedings of the 28th IEEE Conference on

Date of Conference:

13-15 Dec 1989