Minimal time problem for discrete crowd models with a localized vector field
classification
🧮 math.AP
math.OC
keywords
crowdminimaltimecontroldiscretefieldlocalizedvector
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.