Let C(t), t >0, be a Lipschitz set-valued map with closed and (mildly non-)convex values and f(t; x; u) be a map, Lipschitz continuous w.r.t. x. We consider the problem of reaching a target S within the graph of C subject to the di

The minimum time function for the controlled Moreau's sweeping process

Palladino M
2016

Abstract

Let C(t), t >0, be a Lipschitz set-valued map with closed and (mildly non-)convex values and f(t; x; u) be a map, Lipschitz continuous w.r.t. x. We consider the problem of reaching a target S within the graph of C subject to the di
weak and strong invariance, dynamic programming, Hamilton Jacobi inequalities, one-sided Lipschitz dynamics
File in questo prodotto:
File Dimensione Formato  
PostPrint_2016_SIAMJControlOptim_54_Colombo.pdf

non disponibili

Tipologia: Documento in Post-print
Licenza: Creative commons
Dimensione 502.07 kB
Formato Adobe PDF
502.07 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.12571/7694
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 22
  • ???jsp.display-item.citation.isi??? 21
social impact