Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra's algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms' behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum's behavior, finding the minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From software to wetware. Springer, 201

Modeling, Evaluation, and Scale on Artificial Pedestrians: A Literature Review

Modeling pedestrian dynamics and their implementation in a computer are challenging and important issues in the knowledge areas of transportation and computer simulation. The aim of this article is to provide a bibliographic outlook so that the reader may have quick access to the most relevant works related to this problem. We have used three main axes to organize the article's contents: pedestrian models, validation techniques, and multiscale approaches. The backbone of this work is the classification of existing pedestrian models; we have organized the works in the literature under five categories, according to the techniques used for implementing the operational level in each pedestrian model. Then the main existing validation methods, oriented to evaluate the behavioral quality of the simulation systems, are reviewed. Furthermore, we review the key issues that arise when facing multiscale pedestrian modeling, where we first focus on the behavioral scale (combinations of micro and macro pedestrian models) and second on the scale size (from individuals to crowds). The article begins by introducing the main characteristics of walking dynamics and its analysis tools and concludes with a discussion about the contributions that different knowledge fields can make in the near future to this exciting area

From mindless masses to small groups: Conceptualizing collective behavior in crowd modeling.

Computer simulations are increasingly used to monitor and predict behavior at large crowd events, such as mass gatherings, festivals and evacuations. We critically examine the crowd modeling literature and call for future simulations of crowd behavior to be based more closely on findings from current social psychological research. A systematic review was conducted on the crowd modeling literature (N = 140 articles) to identify the assumptions about crowd behavior that modelers use in their simulations. Articles were coded according to the way in which crowd structure was modeled. It was found that 2 broad types are used: mass approaches and small group approaches. However, neither the mass nor the small group approaches can accurately simulate the large collective behavior that has been found in extensive empirical research on crowd events. We argue that to model crowd behavior realistically, simulations must use methods which allow crowd members to identify with each other, as suggested by self-categorization theory

The Fundamental Diagram of Pedestrian Movement Revisited

The empirical relation between density and velocity of pedestrian movement is not completely analyzed, particularly with regard to the `microscopic' causes which determine the relation at medium and high densities. The simplest system for the investigation of this dependency is the normal movement of pedestrians along a line (single-file movement). This article presents experimental results for this system under laboratory conditions and discusses the following observations: The data show a linear relation between the velocity and the inverse of the density, which can be regarded as the required length of one pedestrian to move. Furthermore we compare the results for the single-file movement with literature data for the movement in a plane. This comparison shows an unexpected conformance between the fundamental diagrams, indicating that lateral interference has negligible influence on the velocity-density relation at the density domain $1 m^{-2}<\rho<5 m^{-2}$. In addition we test a procedure for automatic recording of pedestrian flow characteristics. We present preliminary results on measurement range and accuracy of this method.Comment: 13 pages, 9 figure