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 diculties. 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
About an Optimal Visiting Problem / Benetton, Michela; Bagagiolo, Fabio. - ELETTRONICO. - (2010), pp. 1-25.
About an Optimal Visiting Problem
Bagagiolo, Fabio
2010-01-01
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 diculties. 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| File | Dimensione | Formato | |
|---|---|---|---|
|
UMT_743.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
290.42 kB
Formato
Adobe PDF
|
290.42 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
