Modeling rationality to control self-organization of crowds: An environmental approach

Abstract

In this paper we propose a classification of crowd models in built environments based on the assumed pedestrian ability to foresee the movements of other walkers. At the same time, we introduce a new family of macroscopic models, which make it possible to tune the degree of predictiveness (i.e., rationality) of the individuals. By means of these models we describe both the natural behavior of pedestrians, i.e., their expected behavior according to their real limited predictive ability, and a target behavior, i.e., a particularly efficient behavior one would like them to assume (for, e.g., logistic or safety reasons). Then we tackle a challenging shape optimization problem, which consists in controlling the environment in such a way that the natural behavior is as close as possible to the target one, thereby inducing pedestrians to behave more rationally than what they would naturally do. We present numerical tests which elucidate the role of rational/predictive abilities and show some promising results about the shape optimization problem.

References in corpus (1)

• The Dynamics of Crowd Disasters: An Empirical Study

Cited by in corpus (10)

• Invisible control of self-organizing agents leaving unknown environments
• Handling obstacles in pedestrian simulations: models and optimization
• Mean Field Games with state constraints: from mild to pointwise solutions of the PDE system
• Kinetic-controlled hydrodynamics for traffic models with driver-assist vehicles
• Mathematical models and methods for crowd dynamics control
• Robust Design Optimization for Egressing Pedestrians in Unknown Environments
• Residence time of symmetric random walkers in a strip with large reflective obstacles
• Kinetic derivation of Aw-Rascle-Zhang-type traffic models with driver-assist vehicles
• Sharp semi-concavity in a non-autonomous control problem and $L^p$ estimates in an optimal-exit MFG
• A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks