arXiv subjects

Emiliano Cristiani

Publications and source records attributed to Emiliano Cristiani.

At least 37 records · Page 2Linked to original sources

arXiv2019

Measurement and analysis of visitors' trajectories in crowded museums

We tackle the issue of measuring and analyzing the visitors' dynamics in crowded museums. We propose an IoT-based system -- supported by artificial intelligence models -- to reconstruct the visitors' trajectories throughout the museum spaces. Thanks to this tool, we are able to gather wide ensembles of visitors' trajectories, allowing useful insights for the facility management and the preservation of the art pieces. Our contribution comes with one successful use case: the Galleria Borghese in Rome, Italy.

cs.HC↗

arXiv2019

Understanding Mass Transfer Directions via Data-Driven Models with Application to Mobile Phone Data

The aim of this paper is to solve an inverse problem which regards a mass moving in a bounded domain. We assume that the mass moves following an unknown velocity field and that the evolution of the mass density can be described by partial differential equations (PDEs), which is also unknown. The input data of the problems are given by some snapshots of the mass distribution at certain times, while the sought output is the velocity field that drives the mass along its displacement. To this aim, we put in place an algorithm based on the combination of two methods: first, we use the Dynamic Mode Decomposition to create a mathematical model describing the mass transfer; second, we use the notion of Wasserstein distance (also known as earth mover's distance) to reconstruct the underlying velocity field that is responsible for the displacement. Finally, we consider a real-life application: the algorithm is employed to study the travel flows of people in large populated areas using, as input data, density profiles (i.e. the spatial distribution) of people in given areas at different time instances. This kind of data are provided by the Italian telecommunication company TIM and are derived by mobile phone usage.

math.NA↗

arXiv2019

Robust Design Optimization for Egressing Pedestrians in Unknown Environments

In this paper, we deal with a size-variable group of pedestrians moving in a unknown confined environment and searching for an exit. Pedestrian dynamics are simulated by means of a recently introduced microscopic (agent-based) model, characterized by an exploration phase and an egress phase. First, we study the model to reveal the role of its main parameters and its qualitative properties. Second, we tackle a robust optimization problem by means of the Particle Swarm Optimization method, aiming at reducing the time-to-target by adding in the walking area multiple obstacles optimally placed and shaped. Robustness is sought against the number of people in the group, which is an uncertain quantity described by a random variable with given probability density distribution.

physics.soc-ph↗

arXiv2019

An interface-free multi-scale multi-order model for traffic flow

In this paper we present a new kind of model for traffic flow which couples a first-order macroscopic approach with a second-order microscopic approach, avoiding any interface or boundary conditions between them. The Euler-Godunov scheme associated to the model is conservative and it is able to reproduce typical traffic phenomena like stop & go waves.

math.NA↗

arXiv2018

Comparing comparisons between vehicular traffic states in microscopic and macroscopic first-order models

In this paper we deal with the analysis of the solutions of traffic flow models at multiple scales, both in the case of a single road and of road networks. We are especially interested in measuring the distance between traffic states (as they result from the mathematical modeling) and investigating whether these distances are somehow preserved passing from the microscopic to the macroscopic scale. By means of both theoretical and numerical investigations, we show that, on a single road, the notion of Wasserstein distance fully catches the human perception of distance independently of the scale, while in the case of networks it partially loses its nice properties.

math.OC↗

arXiv2018

Understanding Human Mobility Flows from Aggregated Mobile Phone Data

In this paper we deal with the study of travel flows and patterns of people in large populated areas. Information about the movements of people is extracted from coarse-grained aggregated cellular network data without tracking mobile devices individually. Mobile phone data are provided by the Italian telecommunication company TIM and consist of density profiles (i.e. the spatial distribution) of people in a given area at various instants of time. By computing a suitable approximation of the Wasserstein distance between two consecutive density profiles, we are able to extract the main directions followed by people, i.e. to understand how the mass of people distribute in space and time. The main applications of the proposed technique are the monitoring of daily flows of commuters, the organization of large events, and, more in general, the traffic management and control.

physics.soc-ph↗

arXiv2017

Sensitivity analysis of the LWR model for traffic forecast on large networks using Wasserstein distance

In this paper we investigate the sensitivity of the LWR model on network to its parameters and to the network itself. The quantification of sensitivity is obtained by measuring the Wasserstein distance between two LWR solutions corresponding to different inputs. To this end, we propose a numerical method to approximate the Wasserstein distance between two density distributions defined on a network. We found a large sensitivity to the traffic distribution at junctions, the network size, and the network topology.

math.NA↗

arXiv2017

Reducing complexity of multiagent systems with symmetry breaking: an application to opinion dynamics with polls

In this paper we investigate the possibility of reducing the complexity of a system composed of a large number of interacting agents, whose dynamics feature a symmetry breaking. We consider first order stochastic differential equations describing the behavior of the system at the particle (i.e., Lagrangian) level and we get its continuous (i.e., Eulerian) counterpart via a kinetic description. However, the resulting continuous model alone fails to describe adequately the evolution of the system, due to the loss of granularity which prevents it from reproducing the symmetry breaking of the particle system. By suitably coupling the two models we are able to reduce considerably the necessary number of particles while still keeping the symmetry breaking and some of its large-scale statistical properties. We describe such a multiscale technique in the context of opinion dynamics, where the symmetry breaking is induced by the results of some opinion polls reported by the media.

physics.soc-ph↗

arXiv2017

A level set based method for fixing overhangs in 3D printing

3D printers based on the Fused Decomposition Modeling create objects layer-by-layer dropping fused material. As a consequence, strong overhangs cannot be printed because the new-come material does not find a suitable support over the last deposed layer. In these cases, one can add some support structures (scaffolds) which make the object printable, to be removed at the end. In this paper we propose a level set method to create object-dependent support structures, specifically conceived to reduce both the amount of additional material and the printing time. We also review some open problems about 3D printing which can be of interests for the mathematical community.

math.NA↗

arXiv2016

Handling obstacles in pedestrian simulations: models and optimization

In this paper we are concerned with the simulation of crowds in built environments, where obstacles play a role in the dynamics and in the interactions among pedestrians. First of all, we review the state-of-the-art of the techniques for handling obstacles in numerical simulations. Then, we introduce a new modelling technique which guarantees both impermeability and opacity of the obstacles, and does not require ad hoc runtime interventions to avoid collisions. Most important, we solve a complex optimization problem by means of the Particle Swarm Optimization method in order to exploit the so-called Braess's paradox. More precisely, we reduce the evacuation time from a room by adding in the walking area multiple obstacles optimally placed and shaped.

math.OC↗

arXiv2016

Invisible control of self-organizing agents leaving unknown environments

In this paper we are concerned with multiscale modeling, control, and simulation of self-organizing agents leaving an unknown area under limited visibility, with special emphasis on crowds. We first introduce a new microscopic model characterized by an exploration phase and an evacuation phase. The main ingredients of the model are an alignment term, accounting for the herding effect typical of uncertain behavior, and a random walk, accounting for the need to explore the environment under limited visibility. We consider both metrical and topological interactions. Moreover, a few special agents, the leaders, not recognized as such by the crowd, are "hidden" in the crowd with a special controlled dynamics. Next, relying on a Boltzmann approach, we derive a mesoscopic model for a continuum density of followers, coupled with a microscopic description for the leaders' dynamics. Finally, optimal control of the crowd is studied. It is assumed that leaders exploit the herding effect in order to steer the crowd towards the exits and reduce clogging. Locally-optimal behavior of leaders is computed. Numerical simulations show the efficiency of the optimization methods in both microscopic and mesoscopic settings. We also perform a real experiment with people to study the feasibility of the proposed bottom-up crowd control technique.

math.OC↗

arXiv2016

Blended numerical schemes for the advection equation and conservation laws

In this paper we propose a method to couple two or more explicit numerical schemes approximating the same time-dependent PDE, aiming at creating new schemes which inherit advantages of the original ones. We consider both advection equations and nonlinear conservation laws. By coupling a macroscopic (Eulerian) scheme with a microscopic (Lagrangian) scheme, we get a new kind of multiscale numerical method.

math.NA↗

arXiv2015

Blending Brownian motion and heat equation

In this short communication we present an original way to couple the Brownian motion and the heat equation. More in general, we suggest a way for coupling the Langevin equation for a particle, which describes a single realization of its trajectory, with the associated Fokker-Planck equation, which instead describes the evolution of the particle's probability density function. Numerical results show that it is indeed possible to obtain a regularized Brownian motion and a Brownianized heat equation still preserving the global statistical properties of the solutions. The results also suggest that the more macroscale leads the dynamics the more one can reduce the microscopic degrees of freedom.

math.NA↗

arXiv2015

On the micro-to-macro limit for first-order traffic flow models on networks

Connections between microscopic follow-the-leader and macroscopic fluid-dynamics traffic flow models are already well understood in the case of vehicles moving on a single road. Analogous connections in the case of road networks are instead lacking. This is probably due to the fact that macroscopic traffic models on networks are in general ill-posed, since the conservation of the mass is not sufficient alone to characterize a unique solution at junctions. This ambiguity makes more difficult to find the right limit of the microscopic model, which, in turn, can be defined in different ways near the junctions. In this paper we show that a natural extension of the first-order follow-the-leader model on networks corresponds, as the number of vehicles tends to infinity, to the LWR-based multi-path model introduced in [Bretti et al., Discrete Contin. Dyn. Syst. Ser. S, 7 (2014)] and [Briani and Cristiani, Netw. Heterog. Media, 9 (2014)].

math.DS↗

arXiv2015

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

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.

math.OC↗

arXiv2015

A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks

In this paper we propose a LWR-like model for traffic flow on networks which allows one to track several groups of drivers, each of them being characterized only by their destination in the network. The path actually followed to reach the destination is not assigned a priori, and can be chosen by the drivers during the journey, taking decisions at junctions. The model is then used to describe three possible behaviors of drivers, associated to three different ways to solve the route choice problem: 1. Drivers ignore the presence of the other vehicles; 2. Drivers react to the current distribution of traffic, but they do not forecast what will happen at later times; 3. Drivers take into account the current and future distribution of vehicles. Notice that, in the latter case, we enter the field of differential games, and, if a solution exists, it likely represents a global equilibrium among drivers. Numerical simulations highlight the differences between the three behaviors and suggest the existence of multiple Wardrop equilibria.

math.OC↗

arXiv2014

An easy-to-use algorithm for simulating traffic flow on networks: theoretical study

In this paper we study a model for traffic flow on networks based on a hyperbolic system of conservation laws with discontinuous flux. Each equation describes the density evolution of vehicles having a common path along the network. In this formulation the junctions apparently disappear since each path is considered as a single uninterrupted road. We consider a Godunov-based approximation scheme for the system which is very easy to implement. Besides basic properties like the conservation of cars and positive bounded solutions, the scheme exhibits nice properties, being able to select automatically a reasonable solution at junctions without requiring external procedures (e.g., maximization of the flux via a linear programming method). Moreover, the scheme can be interpreted as a discretization of the traffic models with buffer, although any buffer is introduced here. Finally, we show how the scheme can be recast in the framework of the classical theory of traffic flow on networks, where a conservation law has to be solved on each arc of the network. This is achieved by solving the Riemann problem for a modified equation, and showing that its solution corresponds to the one computed by the numerical scheme.

math.NA↗

arXiv2014

Two semi-Lagrangian fast methods for Hamilton-Jacobi-Bellman equations

In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton-Jacobi-Bellman (HJB) equations and we compare the results with an accelerated version of the Fast Sweeping Method (FSM). We find that FIM can be indeed used to solve HJB equations with no relevant modifications with respect to the original algorithm proposed for the eikonal equation, and that it overcomes FSM in many cases. Observing the evolution of the active list of nodes for FIM, we recover another numerical validation of the arguments recently discussed in [Cacace et al., SISC 36 (2014), A570-A587] about the impossibility of creating local single-pass methods for HJB equations.

math.NA↗