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.

In this paper we present a new multi-scale method for reproducing traffic flow which couples a first-order macroscopic model with a second-order microscopic model, avoiding any interface or boundary conditions between them. The multi-scale model is characterized by the fact that microscopic and macroscopic descriptions are not spatially separated. On the contrary, the macro-scale is always active while the micro-scale is activated only if needed by the traffic conditions. The Euler-Godunov scheme associated to the model is conservative and it is able to reproduce typical traffic phenomena like stop & go waves.

Background. The three terms "panic", "irrationality", and "herding" are ubiquitous in the crowd dynamics literature and have a strong influence on both modelling and management practices. The terms are also commonly shared between the scientific and nonscientific domains. The pervasiveness of the use of these terms is to the point where their underlying assumptions have often been treated as common knowledge by both experts and lay persons. Yet, at the same time, the literature on crowd dynamics presents ample debate, contradiction, and inconsistency on these topics. Method. This review is the first to systematically revisit these three terms in a unified study to highlight the scope of this debate. We extracted from peer-reviewed journal articles direct quotes that offer a definition, conceptualisation, or supporting/contradicting evidence on these terms and/or their underlying theories. To further examine the suitability of the term herding, a secondary and more detailed analysis is also conducted on studies that have specifically investigated this phenomenon in empirical settings. Results. The review shows that (i) there is no consensus on the definition for the terms panic and irrationality and that (ii) the literature is highly divided along discipline lines on how accurate these theories/terminologies are for describing human escape behaviour. The review reveals a complete division and disconnection between studies published by social scientists and those from the physical science domain and also between studies whose main focus is on numerical simulation versus those with empirical focus. (iii) Despite the ambiguity of the definitions and the missing consensus in the literature, these terms are still increasingly and persistently mentioned in crowd evacuation studies. (iv) Different to panic and irrationality, there is relative consistency in definitions of the term herding, with the term usually being associated with '(blind) imitation'. However, based on the findings of empirical studies, we argue why, despite the relative consistency in meaning, (v) the term herding itself lacks adequate nuance and accuracy for describing the role of 'social influence' in escape behaviour. Our conclusions also emphasise the importance of distinguishing between the social influence on various aspects of evacuation behaviour and avoiding generalisation across various behavioural layers. Conclusions. We argue that the use of these three terms in the scientific literature does not contribute constructively to extending the knowledge or to improving the modelling capabilities in the field of crowd dynamics. This is largely due to the ambiguity of these terms, the overly simplistic nature of their assumptions, or the fact that the theories they represent are not readily verifiable. Recommendations. We suggest that it would be beneficial for advancing this research field that the phenomena related to these three terms are clearly defined by more tangible and quantifiable terms and be formulated as verifiable hypotheses, so they can be operationalized for empirical testing.

In this paper, we deal with a group variable in size 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.

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.

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.

In this paper we propose two numerical algorithms to solve a coupled PDE-ODE system which models a slow vehicle (bottleneck) moving on a road together with other cars. The resulting system is fully coupled because the dynamics of the slow vehicle depends on the density of cars and, at the same time, it causes a capacity drop in the road, thus limiting the car flux. The first algorithm, based on the Wave Front Tracking method, is suitable for theoretical investigations and convergence results. The second one, based on the Godunov scheme, is used for numerical simulations. The case of multiple bottlenecks is also investigated.

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.

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 modeling 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.

In this paper we propose a method to couple two or more explicit numerical schemes approximating the same time-dependent PDE, aiming at creating a new scheme which inherits 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.

3D printers based on the additive manufacturing technology 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 support structures (scaffolds) which make the object printable, to be removed at the end. In this paper, we propose a level set based 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.

Talk

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 [4, 5].

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 dynamic. 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 aim at steering the crowd towards the exits so to ease the evacuation and limit clogging effects, and locally optimal behavior of leaders is computed. Numerical simulations show the efficiency of the control techniques in both microscopic and mesoscopic settings. We also perform a real experiment with people to study the feasibility of such a bottom-up control technique.

Presentazione a convegno

Voce in enciclopedia

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 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.

In this paper we propose a LWR-like model for traffic flow on networks which allows 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, as- sociated 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 dis- tribution 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 offer insights into the existence of equilibria.

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.