Multi-level agent-based modeling with the Influence Reaction principle

This paper deals with the specification and the implementation of multi-level agent-based models, using a formal model, IRM4MLS (an Influence Reaction Model for Multi-Level Simulation), based on the Influence Reaction principle. Proposed examples illustrate forms of top-down control in (multi-level) multi-agent based-simulations

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

Modeling Location Choice of Secondary Activities with a Social Network of Cooperative Agents

Activity-based models in transportation science focus on the description of human trips and activities. Modeling the spatial decision for so-called secondary activities is addressed in this paper. Given both home and work locations, where do individuals perform activities such as shopping and leisure? Simulation of these decisions using random utility models requires a full enumeration of possible outcomes. For large data sets, it becomes computationally unfeasible because of the combinatorial complexity. To overcome that limitation, a model is proposed in which agents have limited, accurate information about a small subset of the overall spatial environment. Agents are interconnected by a social network through which they can exchange information. This approach has several advantages compared with the explicit simulation of a standard random utility model: (a) it computes plausible choice sets in reasonable computing times, (b) it can be extended easily to integrate further empirical evidence about travel behavior, and (c) it provides a useful framework to study the propagation of any newly available information. This paper emphasizes the computational efficiency of the approach for real-world examples

Evoplex: A platform for agent-based modeling on networks

Agent-based modeling and network science have been used extensively to advance our understanding of emergent collective behavior in systems that are composed of a large number of simple interacting individuals or agents. With the increasing availability of high computational power in affordable personal computers, dedicated efforts to develop multi-threaded, scalable and easy-to-use software for agent-based simulations are needed more than ever. Evoplex meets this need by providing a fast, robust and extensible platform for developing agent-based models and multi-agent systems on networks. Each agent is represented as a node and interacts with its neighbors, as defined by the network structure. Evoplex is ideal for modeling complex systems, for example in evolutionary game theory and computational social science. In Evoplex, the models are not coupled to the execution parameters or the visualization tools, and there is a user-friendly graphical interface which makes it easy for all users, ranging from newcomers to experienced, to create, analyze, replicate and reproduce the experiments.Comment: 6 pages, 5 figures; accepted for publication in SoftwareX [software available at https://evoplex.org

Distributed monitoring and control of future power systems via grid computing

It is now widely accepted within the electrical power supply industry that future power systems operates with significantly larger numbers of small-scale highly dispersed generation units that use renewable energy sources and also reduce carbon dioxide emissions. In order to operate such future power systems securely and efficiently it will be necessary to monitor and control output levels and scheduling when connecting such generation to a power system especially when it is typically embedded at the distribution level. Traditional monitoring and control technology that is currently employed at the transmission level is highly centralized and not scalable to include such significant increases in distributed and embedded generation. However, this paper proposes and demonstrates the adoption of a relatively new technology 'grid computing' that can provide both a scalable and universally adoptable solution to the problems associated with the distributed monitoring and control of future power systems

Distributed multi-agent algorithm for residential energy management in smart grids

Distributed renewable power generators, such as solar cells and wind turbines are difficult to predict, making the demand-supply problem more complex than in the traditional energy production scenario. They also introduce bidirectional energy flows in the low-voltage power grid, possibly causing voltage violations and grid instabilities. In this article we describe a distributed algorithm for residential energy management in smart power grids. This algorithm consists of a market-oriented multi-agent system using virtual energy prices, levels of renewable energy in the real-time production mix, and historical price information, to achieve a shifting of loads to periods with a high production of renewable energy. Evaluations in our smart grid simulator for three scenarios show that the designed algorithm is capable of improving the self consumption of renewable energy in a residential area and reducing the average and peak loads for externally supplied power

Scalable Planning and Learning for Multiagent POMDPs: Extended Version

Online, sample-based planning algorithms for POMDPs have shown great promise in scaling to problems with large state spaces, but they become intractable for large action and observation spaces. This is particularly problematic in multiagent POMDPs where the action and observation space grows exponentially with the number of agents. To combat this intractability, we propose a novel scalable approach based on sample-based planning and factored value functions that exploits structure present in many multiagent settings. This approach applies not only in the planning case, but also in the Bayesian reinforcement learning setting. Experimental results show that we are able to provide high quality solutions to large multiagent planning and learning problems

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