MATH-PHJun 3, 2010
Multiscale modeling of granular flows with application to crowd dynamicsEmiliano Cristiani, Benedetto Piccoli, Andrea Tosin
In this paper a new multiscale modeling technique is proposed. It relies on a recently introduced measure-theoretic approach, which allows to manage the microscopic and the macroscopic scale under a unique framework. In the resulting coupled model the two scales coexist and share information. This allows to perform numerical simulations in which the trajectories and the density of the particles affect each other. Crowd dynamics is the motivating application throughout the paper.
NANov 6, 2012
A patchy Dynamic Programming scheme for a class of Hamilton-Jacobi-Bellman equationsSimone Cacace, Emiliano Cristiani, Maurizio Falcone et al.
In this paper we present a new algorithm for the solution of Hamilton-Jacobi-Bellman equations related to optimal control problems. The key idea is to divide the domain of computation into subdomains which are shaped by the optimal dynamics of the underlying control problem. This can result in a rather complex geometrical subdivision, but it has the advantage that every subdomain is invariant with respect to the optimal dynamics, and then the solution can be computed independently in each subdomain. The features of this dynamics-dependent domain decomposition can be exploited to speed up the computation and for an efficient parallelization, since the classical transmission conditions at the boundaries of the subdomains can be avoided. For their properties, the subdomains are patches in the sense introduced by Ancona and Bressan [ESAIM Control Optim. Calc. Var., 4 (1999), pp. 445-471]. Several examples in two and three dimensions illustrate the properties of the new method.
NADec 23, 2013
Can local single-pass methods solve any stationary Hamilton-Jacobi-Bellman equation?Simone Cacace, Emiliano Cristiani, Maurizio Falcone
The use of local single-pass methods (like, e.g., the Fast Marching method) has become popular in the solution of some Hamilton-Jacobi equations. The prototype of these equations is the eikonal equation, for which the methods can be applied saving CPU time and possibly memory allocation. Then, some natural questions arise: can local single-pass methods solve any Hamilton-Jacobi equation? If not, where the limit should be set? This paper tries to answer these questions. In order to give a complete picture, we present an overview of some fast methods available in literature and we briefly analyze their main features. We also introduce some numerical tools and provide several numerical tests which are intended to exhibit the limitations of the methods. We show that the construction of a local single-pass method for general Hamilton-Jacobi equations is very hard, if not impossible. Nevertheless, some special classes of problems can be actually solved, making local single-pass methods very useful from the practical point of view.
NASep 16, 2011
Numerical approximation of Nash equilibria for a class of non-cooperative differential gamesSimone Cacace, Emiliano Cristiani, Maurizio Falcone
In this paper we propose a numerical method to obtain an approximation of Nash equilibria for multi-player non-cooperative games with a special structure. We consider the infinite horizon problem in a case which leads to a system of Hamilton-Jacobi equations. The numerical method is based on the Dynamic Programming Principle for every equation and on a global fixed point iteration. We present the numerical solutions of some two-player games in one and two dimensions. The paper has an experimental nature, but some features and properties of the approximation scheme are discussed.
NAFeb 24, 2017
A level set based method for fixing overhangs in 3D printingSimone Cacace, Emiliano Cristiani, Leonardo Rocchi
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.
NADec 1, 2015
Blending Brownian motion and heat equationEmiliano Cristiani
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.
NAFeb 22, 2019
An interface-free multi-scale multi-order model for traffic flowEmiliano Cristiani, Elisa Iacomini
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.
LGMar 21, 2023
Inverting the Fundamental Diagram and Forecasting Boundary Conditions: How Machine Learning Can Improve Macroscopic Models for Traffic FlowMaya Briani, Emiliano Cristiani, Elia Onofri
In this paper, we aim at developing new methods to join machine learning techniques and macroscopic differential models for vehicular traffic estimation and forecast. It is well known that data-driven and model-driven approaches have (sometimes complementary) advantages and drawbacks. We consider here a dataset with flux and velocity data of vehicles moving on a highway, collected by fixed sensors and classified by lane and by class of vehicle. By means of a machine learning model based on an LSTM recursive neural network, we extrapolate two important pieces of information: 1) if congestion is appearing under the sensor, and 2) the total amount of vehicles which is going to pass under the sensor in the next future (30 min). These pieces of information are then used to improve the accuracy of an LWR-based first-order multi-class model describing the dynamics of traffic flow between sensors. The first piece of information is used to invert the (concave) fundamental diagram, thus recovering the density of vehicles from the flux data, and then inject directly the density datum in the model. This allows one to better approximate the dynamics between sensors, especially if an accident happens in a not monitored stretch of the road. The second piece of information is used instead as boundary conditions for the equations underlying the traffic model, to better reconstruct the total amount of vehicles on the road at any future time. Some examples motivated by real scenarios will be discussed. Real data are provided by the Italian motorway company Autovie Venete S.p.A.
NAMay 18, 2016
Blended numerical schemes for the advection equation and conservation lawsSimone Cacace, Emiliano Cristiani, Roberto Ferretti
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.
CVSep 19, 2023
An overview of some mathematical techniques and problems linking 3D vision to 3D printingEmiliano Cristiani, Maurizio Falcone, Silvia Tozza
Computer Vision and 3D printing have rapidly evolved in the last 10 years but interactions among them have been very limited so far, despite the fact that they share several mathematical techniques. We try to fill the gap presenting an overview of some techniques for Shape-from-Shading problems as well as for 3D printing with an emphasis on the approaches based on nonlinear partial differential equations and optimization. We also sketch possible couplings to complete the process of object manufacturing starting from one or more images of the object and ending with its final 3D print. We will give some practical examples of this procedure.
DSMay 15
The Wolf and the Cello: Modelling and design of multiple resonance suppressors in large string instrumentsSimone Cacace, Emiliano Cristiani, Francesca L. Ignoto
The wolf note is an acoustic instability that occurs in large bowed string instruments when a strong body resonance interacts with the vibrating string, producing amplitude modulation and loss of tonal control. Various wolf suppressors - tuned mass dampers attached to the string or to the instrument body - are used in practice to mitigate this effect. In this paper, we propose a mathematical model describing the coupled dynamics of a string and a two-dimensional body equipped with one or two wolf suppressors. Both string and body include elastic (second-order) and stiffness (fourth-order) contributions and can be excited either by plucking or bowing. Three performance indicators are introduced: The first one perceives the wolf-tone appearance, the second one quantifies the attenuation of the notes possibly caused by the wolf suppressor, and the third one measures the acoustic fidelity (in terms of spectrum) with respect to the original instrument. The proposed numerical tests give insights about optimal tuning and placement of one or two suppressors, achieving effective wolf-note suppression while preserving as much as possible the global tonal balance.
LGApr 1, 2025
Detection of Anomalous Vehicular Traffic and Sensor Failures Using Data Clustering TechniquesDavide Moretti, Elia Onofri, Emiliano Cristiani
The increasing availability of traffic data from sensor networks has created new opportunities for understanding vehicular dynamics and identifying anomalies. In this study, we employ clustering techniques to analyse traffic flow data with the dual objective of uncovering meaningful traffic patterns and detecting anomalies, including sensor failures and irregular congestion events. We explore multiple clustering approaches, i.e partitioning and hierarchical methods, combined with various time-series representations and similarity measures. Our methodology is applied to real-world data from highway sensors, enabling us to assess the impact of different clustering frameworks on traffic pattern recognition. We also introduce a clustering-driven anomaly detection methodology that identifies deviations from expected traffic behaviour based on distance-based anomaly scores. Results indicate that hierarchical clustering with symbolic representations provides robust segmentation of traffic patterns, while partitioning methods such as k-means and fuzzy c-means yield meaningful results when paired with Dynamic Time Warping. The proposed anomaly detection strategy successfully identifies sensor malfunctions and abnormal traffic conditions with minimal false positives, demonstrating its practical utility for real-time monitoring. Real-world vehicular traffic data are provided by Autostrade Alto Adriatico S.p.A.
HCNov 19, 2019
Measurement and analysis of visitors' trajectories in crowded museumsPietro Centorrino, Alessandro Corbetta, Emiliano Cristiani et al.
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.
SOC-PHApr 9, 2019
Robust Design Optimization for Egressing Pedestrians in Unknown EnvironmentsEmiliano Cristiani, Daniele Peri
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.
NASep 11, 2017
Sensitivity analysis of the LWR model for traffic forecast on large networks using Wasserstein distanceMaya Briani, Emiliano Cristiani, Elisa Iacomini
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.
OCOct 3, 2009
Initialization of the Shooting Method via the Hamilton-Jacobi-Bellman ApproachEmiliano Cristiani, Pierre Martinon
The aim of this paper is to investigate from the numerical point of view the possibility of coupling the Hamilton-Jacobi-Bellman (HJB) equation and Pontryagin's Minimum Principle (PMP) to solve some control problems. A rough approximation of the value function computed by the HJB method is used to obtain an initial guess for the PMP method. The advantage of our approach over other initialization techniques (such as continuation or direct methods) is to provide an initial guess close to the global minimum. Numerical tests involving multiple minima, discontinuous control, singular arcs and state constraints are considered. The CPU time for the proposed method is less than four minutes up to dimension four, without code parallelization.