11,141 research outputs found
Agent Street: An Environment for Exploring Agent-Based Models in Second Life
Urban models can be seen on a continuum between iconic and symbolic. Generally speaking, iconic models are physical versions of the real world at some scaled down representation, while symbolic models represent the system in terms of the way they function replacing the physical or material system by some logical and/or mathematical formulae. Traditionally iconic and symbolic models were distinct classes of model but due to the rise of digital computing the distinction between the two is becoming blurred, with symbolic models being embedded into iconic models. However, such models tend to be single user. This paper demonstrates how 3D symbolic models in the form of agent-based simulations can be embedded into iconic models using the multi-user virtual world of Second Life. Furthermore, the paper demonstrates Second Life\'s potential for social science simulation. To demonstrate this, we first introduce Second Life and provide two exemplar models; Conway\'s Game of Life, and Schelling\'s Segregation Model which highlight how symbolic models can be viewed in an iconic environment. We then present a simple pedestrian evacuation model which merges the iconic and symbolic together and extends the model to directly incorporate avatars and agents in the same environment illustrating how \'real\' participants can influence simulation outcomes. Such examples demonstrate the potential for creating highly visual, immersive, interactive agent-based models for social scientists in multi-user real time virtual worlds. The paper concludes with some final comments on problems with representing models in current virtual worlds and future avenues of research.Agent-Based Modelling, Pedestrian Evacuation, Segregation, Virtual Worlds, Second Life
Guaranteed Cost Tracking for Uncertain Coupled Multi-agent Systems Using Consensus over a Directed Graph
This paper considers the leader-follower control problem for a linear
multi-agent system with directed communication topology and linear nonidentical
uncertain coupling subject to integral quadratic constraints (IQCs). A
consensus-type control protocol is proposed based on each agent's states
relative to its neighbors and leader's state relative to agents which observe
the leader. A sufficient condition is obtained by overbounding the cost
function. Based on this sufficient condition, a computational algorithm is
introduced to minimize the proposed guaranteed bound on tracking performance,
which yields a suboptimal bound on the system consensus control and tracking
performance. The effectiveness of the proposed method is demonstrated using a
simulation example.Comment: Accepted for presentation at the 2013 Australian Control conferenc
Extremism propagation in social networks with hubs
One aspect of opinion change that has been of academic interest is the impact of people with extreme opinions (extremists) on opinion dynamics. An agent-based model has been used to study the role of small-world social network topologies on general opinion change in the presence of extremists. It has been found that opinion convergence to a single extreme occurs only when the average number of network connections for each individual is extremely high. Here, we extend the model to examine the effect of positively skewed degree distributions, in addition to small-world structures, on the types of opinion convergence that occur in the presence of extremists. We also examine what happens when extremist opinions are located on the well-connected nodes (hubs) created by the positively skewed distribution. We find that a positively skewed network topology encourages opinion convergence on a single extreme under a wider range of conditions than topologies whose degree distributions were not skewed. The importance of social position for social influence is highlighted by the result that, when positive extremists are placed on hubs, all population convergence is to the positive extreme even when there are twice as many negative extremists. Thus, our results have shown the importance of considering a positively skewed degree distribution, and in particular network hubs and social position, when examining extremist transmission
The Repast Simulation/Modelling System for Geospatial Simulation
The use of simulation/modelling systems can simplify the implementation of agent-based models. Repast is one of the few simulation/modelling software systems that supports the integration of geospatial data especially that of vector-based geometries. This paper provides details about Repast specifically an overview, including its different development languages available to develop agent-based models. Before describing Repast’s core functionality and how models can be developed within it, specific emphasis will be placed on its ability to represent dynamics and incorporate geographical information. Once these elements of the system have been covered, a diverse list of Agent-Based Modelling (ABM) applications using Repast will be presented with particular emphasis on spatial applications utilizing Repast, in particular, those that utilize geospatial data
3D multi-agent models for protein release from PLGA spherical particles with complex inner morphologies
In order to better understand and predict the release of proteins from bioerodible micro- or nanospheres, it is important to know the influences of different initial factors on the release mechanisms. Often though it is difficult to assess what exactly is at the origin of a certain dissolution profile. We propose here a new class of fine-grained multi-agent models built to incorporate
increasing complexity, permitting the exploration of the role of different parameters, especially that of the internal morphology of the spheres, in the exhibited release profile. This approach, based on Monte-Carlo (MC) and Cellular Automata (CA) techniques, has permitted the testing of various assumptions and hypotheses about several experimental systems of nanospheres encapsulating proteins. Results have confirmed that this modelling approach
has increased the resolution over the complexity involved, opening promising perspectives for future developments, especially complementing in vitro experimentation
Going Stupid with EcoLab
In 2005, Railsback et al. proposed a very simple model ({\em Stupid
Model}) that could be implemented within a couple of hours, and later
extended to demonstrate the use of common ABM platform functionality. They
provided implementations of the model in several agent based modelling
platforms, and compared the platforms for ease of implementation of this simple
model, and performance. In this paper, I implement Railsback et al's Stupid
Model in the EcoLab simulation platform, a C++ based modelling platform,
demonstrating that it is a feasible platform for these sorts of models, and
compare the performance of the implementation with Repast, Mason and Swarm
versions
On fast-slow consensus networks with a dynamic weight
We study dynamic networks under an undirected consensus communication
protocol and with one state-dependent weighted edge. We assume that the
aforementioned dynamic edge can take values over the whole real numbers, and
that its behaviour depends on the nodes it connects and on an extrinsic slow
variable. We show that, under mild conditions on the weight, there exists a
reduction such that the dynamics of the network are organized by a
transcritical singularity. As such, we detail a slow passage through a
transcritical singularity for a simple network, and we observe that an exchange
between consensus and clustering of the nodes is possible. In contrast to the
classical planar fast-slow transcritical singularity, the network structure of
the system under consideration induces the presence of a maximal canard. Our
main tool of analysis is the blow-up method. Thus, we also focus on tracking
the effects of the blow-up transformation on the network's structure. We show
that on each blow-up chart one recovers a particular dynamic network related to
the original one. We further indicate a numerical issue produced by the slow
passage through the transcritical singularity
- …