Journal of Convex Analysis 23 (2016), No. 2, 567--601
Copyright Heldermann Verlag 2016
Measure Sweeping Processes
Simone Di Marino
Lab. de Mathématiques, Université Paris-Sud-Saclay, 91405 Orsay, France
simone.dimarino@math.u-psud.fr
Bertrand Maury
Lab. de Mathématiques, Université Paris-Sud-Saclay, 91405 Orsay, France
bertrand.maury@math.u-psud.fr
Filippo Santambrogio
Lab. de Mathématiques, Université Paris-Sud-Saclay, 91405 Orsay, France
filippo.santambrogio@math.u-psud.fr
We propose and analyze a natural extension of the Moreau sweeping process: given a family of moving convex sets (C(t))t , we look for the evolution of a probability density ρt , constrained to be supported on C(t). We describe in detail three cases: in the first, particles do not interact with each other and stay at rest unless pushed by the moving boundary; in the second they interact via a maximal density constraint ρ ≤ 1, so that they are not only pushed by the boundary, but also by the other particles; in the third case particles are submitted to Brownian diffusion, reflected along the moving boundary. We prove existence, uniqueness and approximation results by using techniques from optimal transport, and we provide numerical illustrations.
Keywords: Sweeping process, optimal transportation, Wasserstein distance, differential inclusion, subdifferential, rotor router model.
MSC: 35R37, 35R05, 49J45, 49J53
[ Fulltext-pdf (555 KB)] for subscribers only.