In this work, we study the minimal time to steer a given crowd to a desired configuration. The control is a vector field, representing a perturbation of the crowd velocity, localized on a fixed control set. We characterize the minimal time for a discrete crowd model, both for exact and approximate controllability. This leads to an algorithm that computes the control and the minimal time. We finally present a numerical simulation.
Minimal time problem for discrete crowd models with a localized vector field
Rossi, Francesco
2019-01-01
Abstract
In this work, we study the minimal time to steer a given crowd to a desired configuration. The control is a vector field, representing a perturbation of the crowd velocity, localized on a fixed control set. We characterize the minimal time for a discrete crowd model, both for exact and approximate controllability. This leads to an algorithm that computes the control and the minimal time. We finally present a numerical simulation.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
MinTimeCDC.pdf
accesso aperto
Tipologia:
Versione Editoriale
Licenza:
Creative commons
Dimensione
303.97 kB
Formato
Adobe PDF
|
303.97 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.