Different goals in multiscale simulations and how to reach them

In this paper we sum up our works on multiscale programs, mainly simulations. We first start with describing what multiscaling is about, how it helps perceiving signal from a background noise in a ?ow of data for example, for a direct perception by a user or for a further use by another program. We then give three examples of multiscale techniques we used in the past, maintaining a summary, using an environmental marker introducing an history in the data and finally using a knowledge on the behavior of the different scales to really handle them at the same time

A Lagrangian discretization multiagent approach for large-scale multimodal dynamic assignment

This paper develops a Lagrangian discretization multiagent model for large-scale multimodal simulation and assignment. For road traffic flow modeling, we describe the dynamics of vehicle packets based on a macroscopic model on the basis of a Lagrangian discretization. The metro/tram/train systems are modeled on constant speed on scheduled timetable/frequency over lines of operations. Congestion is modeled as waiting time at stations plus induced discomfort when the capacity of vehicle is achieved. For the bus system, it is modeled similar to cars with different speed settings, either competing for road capacity resources with other vehicles or moving on separated bus lines on the road network. For solving the large-scale multimodal dynamic traffic assignment problem, an effective-path-based cross entropy is proposed to approximate the dynamic user equilibrium. Some numerical simulations have been conducted to demonstrate its ability to describe traffic dynamics on road network.multimodal transportation systems; Lagrangian discretization; traffic assignment; multiagent systems

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

Preliminary Results of a Multiagent Traffic Simulation for Berlin

This paper provides an introduction to multi-agent traffic simulation. Metropolitan regions can consist of several million inhabitants, implying the simulation of several million travelers, which represents a considerable computational challenge. We reports on our recent case study of a real-world Berlin scenario. The paper explains computational techniques necessary to achieve results. It turns out that the difficulties there, because of data availability and because of the special situation of Berlin after the re-unification, are considerably larger than in previous scenarios that we have treated

Distributed agent-based traffic simulations

Modeling and simulation play an important role in transportation networks analysis. With the widespread of personalized real-time information sources, it is relevant for the simulation model to be individual-centered. The agent-based simulation is the most promising paradigm in this context. However, representing the movements of realistic numbers of travelers within reasonable execution times requires significant computational resources. It also requires relevant methods, architectures and algorithms that respect the characteristics of transportation networks. In this paper, we tackle the problem of using high-performance computing for agent-based traffic simulations. To do so, we define two generic agent-based simulation models, representing the existing sequential agent-based traffic simulations. The first model is macroscopic, in which travelers do not interact directly and use a fundamental diagram of traffic flow to continuously compute their speeds. The second model is microscopic, in which travelers interact with their neighbors to adapt their speeds to their surrounding environment. We define patterns to distribute these simulations in a high-performance environment. The first distributes agents equally between available computation units. The second pattern splits the environment over the different units. We finally propose a diffusive method to dynamically balance the load between units during execution. The results show that agent-based distribution is more efficient with macroscopic simulations, with a speedup of 6 compared to the sequential version, while environmentbased distribution is more efficient with microscopic simulations, with a speedup of 14. Our diffusive load-balancing algorithm improves further the performance of the environment based approach by 150%