Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

About an Optimal Visiting Problem

About an Optimal Visiting Problem 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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Optimization Springer Journals

About an Optimal Visiting Problem

Download PDF
21 pages

Loading next page...
 
/lp/springer_journal/about-an-optimal-visiting-problem-KRuwRCYXSU

References (14)

Publisher
Springer Journals
Copyright
Copyright © 2012 by Springer Science+Business Media, LLC
Subject
Mathematics; Mathematical Methods in Physics; Systems Theory, Control; Theoretical, Mathematical and Computational Physics; Calculus of Variations and Optimal Control; Optimization; Numerical and Computational Physics
ISSN
0095-4616
eISSN
1432-0606
DOI
10.1007/s00245-011-9150-0
Publisher site
See Article on Publisher Site

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

Journal

Applied Mathematics and Optimization – Springer Journals

Published: Feb 1, 2012

There are no references for this article.