Minimal time problem for discrete crowd models with a localized vector field
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Minimal time problem for discrete crowd models with a localized vector field |
|---|---|
| Author / Organization | Michel Duprez, Morgan Morancey, Francesco Rossi |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2018 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-254625 |
| Original Source Link | Visit Source Page on hal.science » |