SearcharxivSearch

arXiv · 1803.09206

Agent-Based Implementation of Particle Hopping Traffic Model With Stochastic and Queuing Elements

Abstract

Lagging or halted traffic is bothersome. As such, it is desirable to have a model that can begin to determine the efficiency of various traffic standardizations. Our model intended to create a multifaceted realistic simulation of traffic flow while considering several factors. These factors included: passing conventions, e.g., right except to pass (REP) rule, system perturbation caused by insertion of an accident into the system, accessible number of lanes available with the REP, various human factors such as variation of individual maximum speed and likelihood to pass. A succession of models were created from a variation on an existing single-lane traffic model and adding extra dimensionality to the lattice to include multiple lanes, passing conventions, stochastic elements for individuality, and queuing rules to movement algorithms. We found that the REP is an effective means of increasing the critical density that a system can support. Eliminating human factors and thereby automating the system, results in a 160% increase in the sustainable critical density of the system. The number of lanes increases the critical density of the system, but the maximum efficiency of the speed distribution remains the same. Excluding system automation, the optimal speed distribution for drivers maximal speed was found to be Beta(5,5). Accidents in stable systems can cause small local jams without causing global jams.

Explore related subjects

Keep this discovery

BibTeXRIS

Camilla Champion, Cody Champion. 2018-03-25. Agent-Based Implementation of Particle Hopping Traffic Model With Stochastic and Queuing Elements. https://arxiv.org/abs/1803.09206

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG

The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab

Any type of attractor basin (classic-graph) created in DDLab can now be visualised, manipulated, and deconstructed as a drag/drop ``interactive state transition graph'' (istr-graph). The new istr-graph applies to subtrees, single basins, the basin of attraction field, compression, and all other classic-graph parameters. This is an important update on the pre-existing ``interactive basin of attraction field graph'' (ibaf-graph) specific to just the complete uncompressed field, but the ibaf-graph is nevertheless retained for some of its unique attributes. These issues are discussed with a focus on the scope and implementation of the new istr-graph.

nlin.CG

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG