Minimal time problem for discrete crowd models with a localized vector field - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Minimal time problem for discrete crowd models with a localized vector field

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.
Fichier principal
Vignette du fichier
MinTimeCDC.pdf (302.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01493143 , version 1 (22-03-2017)
hal-01493143 , version 2 (30-10-2017)
hal-01493143 , version 3 (30-10-2017)
hal-01493143 , version 4 (13-11-2017)
hal-01493143 , version 5 (17-03-2018)

Identifiers

Cite

Michel Duprez, Morgan Morancey, Francesco Rossi. Minimal time problem for discrete crowd models with a localized vector field. 57th IEEE Conference on Decision and Control (CDC), Dec 2018, Miami Beach, FL, United States. pp.1675-1680. ⟨hal-01493143v5⟩
438 View
241 Download

Altmetric

Share

Gmail Facebook X LinkedIn More