Skip to main content
Log in

Dynamic programming for free-time problems with endpoint constraints

  • Published:
Mathematics of Control, Signals and Systems Aims and scope Submit manuscript

Abstract

If we are able to find a local verification function associated with an admissible trajectory x(.), then x(.) is a local minimizer. It is of interest therefore to know when such local verification functions exist. In this paper it is shown that the existence of a local verification function is necessary for x(.) to be a local minimizer, under a normality hypothesis. The novelty of these results is that they treat problems with a general endpoint constraint and where the endtime is a choice variable. Here the value function of the original problem does not serve as a local verification function; instead it must be constructed from some derived problem. The data are allowed to be measurable in the time variable, and the normality hypothesis is expressed in terms of recent free-endtime necessary conditions of optimality for problems with measurable time dependence.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+
from €37.37 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price includes VAT (Netherlands)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Bardi, A boundary value problem for the minimum time function,SIAM J. Control Optim.,27 (1989), 778–785.

    Google Scholar 

  2. V. G. Boltyanskii, Sufficient conditions for optimality and justification of the dynamic programming method,SIAM J. Control,4 (1966), 326–361.

    Google Scholar 

  3. F. H. Clarke,Optimization and Nonsmooth Analysis, Wiley-Interscience, New York, 1983.

    Google Scholar 

  4. F. H. Clarke, P. D. Loewen, and R. B. Vinter, Differential inclusions with free time,Ann. Inst. Henri Poincaré Anal. Non Linéaire,5 (1988), 573–593.

    Google Scholar 

  5. F. H. Clarke and R. B. Vinter, Local optimality conditions and Lipschitzian solutions to the Hamilton-Jacobi equation,SIAM J. Control Optim.,21 (1983), 856–870.

    Google Scholar 

  6. L. C. Evans and M. R. James, The Hamilton-Jacobi-Bellman equation for time optimal control,SIAM J. Control Optim.,27 (1989), 1477–1489.

    Google Scholar 

  7. W. H. Fleming and R. W. Rishel,Deterministic and Stochastic Optimal Control, Springer-Verlag, New York, 1975.

    Google Scholar 

  8. H. Frankowska, Optimal trajectories associated to a solution of the contingent HamiltonJacobi equation,Appl. Math. Optim.,19 (1989), 291–311.

    Google Scholar 

  9. J. Kotsiopoulos, Characterization of Deterministic Optimal Processes with Discontinuous Trajectories, Ph.D. thesis, Imperial College, University of London, 1990.

  10. P. L. Lions,Generalized Solutions of Hamilton-Jacobi Equations, Pitman, Boston, 1982.

    Google Scholar 

  11. R. B. Vinter and P. R. Wolenski, Hamilton-Jacobi theory for optimal control problems with data measurable in time,SIAM J. Control Optim.,28 (1990), 1404–1419.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kotsiopoulos, J., Vinter, R.B. Dynamic programming for free-time problems with endpoint constraints. Math. Control Signal Systems 6, 180–193 (1993). https://doi.org/10.1007/BF01211747

Download citation

  • Received:

  • Revised:

  • Issue date:

  • DOI: https://doi.org/10.1007/BF01211747

Key words