Skip to main content
Log in

About an Optimal Visiting Problem

  • Published:
Applied Mathematics & Optimization Aims and scope Submit manuscript

Abstract

In this paper we are concerned with the optimal control problem consisting in minimizing the time for reaching (visiting) a fixed number of target sets, in particular more than one target. Such a problem is of course reminiscent of the famous “Traveling Salesman Problem” and brings all its computational difficulties. Our aim is to apply the dynamic programming technique in order to characterize the value function of the problem as the unique viscosity solution of a suitable Hamilton–Jacobi equation. We introduce some “external” variables, one per target, which keep in memory whether the corresponding target is already visited or not, and we transform the visiting problem in a suitable Mayer problem. This fact allows us to overcome the lacking of the Dynamic Programming Principle for the originary problem. The external variables evolve with a hysteresis law and the Hamilton–Jacobi equation turns out to be discontinuous

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bagagiolo, F.: Dynamic programming for some optimal control problems with hysteresis. Nonlinear Differ. Equ. Appl. 9, 149–174 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bagagiolo, F.: Viscosity solutions for an optimal control problem with Preisach hysteresis nonlinearities. ESAIM Control Optim. Calc. Var. 10, 271–294 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bardi, M., Capuzzo Dolcetta, I.: Optimal Control and Viscosity Solution of Hamilton–Jacobi–Bellman Equation. Birkhäuser, Boston (1997)

    Book  Google Scholar 

  4. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9, 61–63 (1962)

    Article  MATH  Google Scholar 

  5. Benetton, M.: Su di un problema di visita ottima. Master Thesis in Mathematics, University of Trento, July 2010

  6. Crandall, M.G., Lions, P.L.: Viscosity solutions of Hamilton–Jacobi equations. Trans. Am. Math. Soc. 277, 1–42 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  7. Crandall, M.G., Evans, L.C., Lions, P.L.: Some properties of viscosity solutions of Hamilton–Jacobi equations. Trans. Am. Math. Soc. 282, 487–502 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  8. Day, M.V.: Neumann-type boundary conditions for Hamilton–Jacobi equations in smooth domains. Appl. Math. Optim. 53, 359–381 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gudovich, A., Quincampoix, M.: Optimal control with hysteresis nonlinearity and multidimensional play operator. SIAM J. Control Optim. 42, 788–807 (2011)

    Article  MathSciNet  Google Scholar 

  10. Ilchmann, A., Logemann, H., Ryan, E.P.: Tracking with prescribed transient performance for hysteretic systems. SIAM J. Control Optim. 48, 4731–4752 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ishii, H.: A boundary value problem of the Dirichlet type for the Hamilton–Jacobi equations. Ann. Sc. Norm. Super. Pisa, Cl. Sci. 16, 105–135 (1989)

    MATH  Google Scholar 

  12. Lions, P.L.: Neumann type boundary conditions for Hamilton–Jacobi equations. Duke Math. J. 52, 793–820 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Soner, H.M.: Optimal control with state-space constraint. SIAM J. Control Optim. 24, 552–561 (1983)

    Article  MathSciNet  Google Scholar 

  14. Visintin, A.: Differential Models of Hysteresis. Springer, Heidelberg (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabio Bagagiolo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bagagiolo, F., Benetton, M. About an Optimal Visiting Problem. Appl Math Optim 65, 31–51 (2012). https://doi.org/10.1007/s00245-011-9150-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00245-011-9150-0

Keywords

Navigation