A mathematical framework for a crowd motion model

Source abstract

In a previous paper, we proposed a model for crowd motion, together with a numerical algorithm, especially designed to handle highly packed situations. This model rests on two principles: We first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people; The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here the underlying mathematical framework, and we explain how recent results by J.F. Edmond and L. Thibault on the sweeping process in the prox-regular case can be adapted to handle this situation, in terms of well-posedness as well as convergence of the numerical algorithm.