The optimal visiting problem is the optimization of a trajectory that has to touch or pass as close as possible to a collection of target points. The problem does not verify the dynamic programming principle, and it needs a specific formulation to keep track of the visited target points. In this paper, we introduce a hybrid approach by adding a discontinuous part of the trajectory switching between a group of discrete states related to the targets. Then, we show the well-posedness of the related Hamilton-Jacobi problem, by reformulating the optimal visiting as a collection of time-dependent optimal stopping problems.
A hybrid control framework for an optimal visiting problem / Bagagiolo, F.; Festa, A.; Marzufero, L.. - In: IFAC PAPERSONLINE. - ISSN 2405-8971. - 54:5(2021), pp. 241-246. [10.1016/j.ifacol.2021.08.505]
A hybrid control framework for an optimal visiting problem
Marzufero L.
2021
Abstract
The optimal visiting problem is the optimization of a trajectory that has to touch or pass as close as possible to a collection of target points. The problem does not verify the dynamic programming principle, and it needs a specific formulation to keep track of the visited target points. In this paper, we introduce a hybrid approach by adding a discontinuous part of the trajectory switching between a group of discrete states related to the targets. Then, we show the well-posedness of the related Hamilton-Jacobi problem, by reformulating the optimal visiting as a collection of time-dependent optimal stopping problems.File | Dimensione | Formato | |
---|---|---|---|
Bagagiolo_Hybrid_2021.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
443.27 kB
Formato
Adobe PDF
|
443.27 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.