52 research outputs found

    Cellular Automata Applications in Shortest Path Problem

    Full text link
    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

    MemCA: all-memristor design for deterministic and probabilistic cellular automata hardware realization

    Get PDF
    © 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksInspired by the behavior of natural systems, Cellular Automata (CA) tackle the demanding long-distance information transfer of conventional computers by the massive parallel computation performed by a set of locally-coupled dynamical nodes. Although CA are envisioned as powerful deterministic computers, their intrinsic capabilities are expanded after the memristor’s probabilistic switching is introduced into CA cells, resulting in new hybrid deterministic and probabilistic memristor-based CA (MemCA). In the proposed MemCA hardware realization, memristor devices are incorporated in both the cell and rule modules, composing the very first all-memristor CA hardware, designed with mixed CMOS/Memristor circuits. The proposed implementation accomplishes high operating speed and reduced area requirements, exploiting also memristor as an entropy source in every CA cell. MemCA’s functioning is showcased in deterministic and probabilistic operation, which can be externally modified by the selection of programming voltage amplitude, without changing the design. Also, the proposed MemCA system includes a reconfigurable rule module implementation that allows for spatial and temporal rule inhomogeneity.Peer ReviewedPostprint (published version

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

    Get PDF
    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

    Hybrid agent-based and social force simulation for modelling human evacuation egress

    Get PDF
    Simulation has become one of the popular techniques to model evacuation scenarios. Simulation is used as an instrumental for examining human movement during both normal and emergencies such as evacuation. During an evacuation, people will be in a panic situation and egress behaviour that will find the way out from a dangerous place to a safe place. Two well-known techniques in simulation that can incorporate human behaviour inside the simulation models are Agent-Based Simulation and Social Force Simulation. ABS is using the concept of a multi-agent system that consists of decentralized agents which can be autonomous, responsive and proactive. Meanwhile, SFS is a physical force to drive humans dynamically to perform egress actions and human self-organised behaviour in a group. However, the main issue in modelling both ABS or SFS alone is due to their characteristic as ABS have difficulty in modelling the force element and collective behaviours while SFS does not focus on free movements during the evacuation. This behaviour was due to the structure of humans (agents) inside ABS is decentralized which resulting collision among agents and the desired formation of evacuation was not achieved. On the other hand, in a single SFS model, the human was not proactive in finding the way out which was not reflecting the actual behaviour of humans during the evacuation. Both ABS and SFS are potential techniques to be combined due to their characteristics of self-learning and free movement in ABS and self organization in SFS. The research methodology based on modelling and simulation (M&S) life-cycle has been utilized for this work; consists of three main phases, namely preliminary study, model development and validation and verification and finally the experimentation and the results analysis. The M&S life-cycle was utilized aligned with the research aim which is to investigate the performance of the combined ABS and SFS in modelling the egress behaviour during evacuation. To achieve the aim, five evacuation factors have been chosen namely obstacles, the number of exits, exit width, triggered alarm time, and the number of people that have been the most chosen factors in the literature review. Next, three simulation models (using techniques: SFS, ABS and hybrid ABS/SFS) have been developed, verified, and validated based on the real case study data. Various simulation scenarios that will influence the human evacuation movement based on the evacuation factors were modelled and analysed. The simulation results were compared based on the chosen performance measurement parameters (PMP): evacuation time, velocity, flow rate, density and simulation time (model execution time). The simulation results analysis revealed that SFS, ABS, and hybrid ABS/ SFS were found suitable to model evacuation egress (EE) based on the reported PMP. The smallest standard error (SSE) values reported 66% for hybrid ABS/ SFS, 17% for ABS and 17% for SFS where the highest percentage of SSE indicated the most accurate. Based on the experiment results, the hybrid ABS/ SFS revealed a better performance with high effectiveness and accuracy in the simulation model behaviour when modelling various evacuation egress scenarios compared to single ABS and SFS. Thus, hybrid ABS/ SFS was found the most appropriate technique for modelling EE as agents in the hybrid technique were communicating to each other by forming a decentralised control for smooth and safe EE movement. In addition, the impactful factors that affected the result accuracy were exits, the exit width (size), the obstacle and the number of people. Conclusively, this thesis contributed the hybrid ABS/ SFS model for modelling human behaviour during evacuation in a closed area such as an office building to the body of knowledge. Hence, this research was found significant to assist the practitioners and researchers to study the closer representation of human EE behaviour by considering the hybrid ABS/SFS model and the impactful factors of evacuation

    Sublinear Computation Paradigm

    Get PDF
    This open access book gives an overview of cutting-edge work on a new paradigm called the “sublinear computation paradigm,” which was proposed in the large multiyear academic research project “Foundations of Innovative Algorithms for Big Data.” That project ran from October 2014 to March 2020, in Japan. To handle the unprecedented explosion of big data sets in research, industry, and other areas of society, there is an urgent need to develop novel methods and approaches for big data analysis. To meet this need, innovative changes in algorithm theory for big data are being pursued. For example, polynomial-time algorithms have thus far been regarded as “fast,” but if a quadratic-time algorithm is applied to a petabyte-scale or larger big data set, problems are encountered in terms of computational resources or running time. To deal with this critical computational and algorithmic bottleneck, linear, sublinear, and constant time algorithms are required. The sublinear computation paradigm is proposed here in order to support innovation in the big data era. A foundation of innovative algorithms has been created by developing computational procedures, data structures, and modelling techniques for big data. The project is organized into three teams that focus on sublinear algorithms, sublinear data structures, and sublinear modelling. The work has provided high-level academic research results of strong computational and algorithmic interest, which are presented in this book. The book consists of five parts: Part I, which consists of a single chapter on the concept of the sublinear computation paradigm; Parts II, III, and IV review results on sublinear algorithms, sublinear data structures, and sublinear modelling, respectively; Part V presents application results. The information presented here will inspire the researchers who work in the field of modern algorithms

    Cellular automata simulations of field scale flaming and smouldering wildfires in peatlands

    Get PDF
    In peatland wildfires, flaming vegetation can initiate a smouldering fire by igniting the peat underneath, thus, creating a positive feedback to climate change by releasing the carbon that cannot be reabsorbed by the ecosystem. Currently, there are very few models of peatland wildfires at the field-scale, hindering the development of effective mitigation strategies. This lack of models is mainly caused by the complexity of the phenomena, which involves 3-D spread and km-scale domains, and the very large computational resources required. This thesis aims to understand field-scale peatland wildfires, considering flaming and smouldering, via cellular automata, discrete models that use simple rules. Five multidimensional models were developed: two laboratory-scale models for smouldering, BARA and BARAPPY, and three field-scale models for flaming and smouldering, KAPAS, KAPAS II, and SUBALI. The models were validated against laboratory experiments and field data. BARA accurately simulates smouldering of peat with realistic moisture distributions and predicts the formation of unburned patches. BARAPPY brings physics into BARA and predicts the depth of burn profile, but needs 240 times more computational resources. KAPAS showed that the smouldering burnt area decreases exponentially with higher peat moisture content. KAPAS II integrates daily temporal variation of moisture content, and revealed that the omission of this temporal variation significantly underestimates the smouldering burnt area in the long term. SUBALI, the ultimate model of the thesis, integrates KAPAS II with BARA and considers the ground water table to predict the carbon emission of peatland wildfires. Applying SUBALI to Indonesia, it predicts that in El Niño years, 0.40 Gt-C in 2015 (literature said 0.23 to 0.51 Gt-C) and 0.16 Gt-C in 2019 were released, and 75% of the emission is from smouldering. This thesis provides knowledge and models to understand the spread of flaming and smouldering wildfires in peatlands, which can contribute to efforts to minimise the negative impacts of peatland wildfires on people and the environment, through faster-than-real-time simulations, to find the optimum firefighting strategy and to assess the vulnerability of peatland in the event of wildfires.Open Acces

    CBM Progress Report 2009

    Get PDF

    Modelling of crowd behaviour during indoor/outdoor evacuation

    Get PDF
    In pedestrian dynamics, there are forces that usually define the trajectories between the moving individuals. These can be more easily understood in corresponding video scenes where the crowd movement arrives also from the application of such forces like Newton laws as friction and action-reaction. Nevertheless, the complexity of the individuals' movement insinuates that, between them, there are also more complex or "invisible" unknown forces as the ones described by psychological terms that apply and dictate the crowd movement. In this thesis, we want to indicate the existence of those forces by modeling the movement of a human as an oscillation described by rhythms and/or frequencies perceived from its environment. Moreover, we intend to describe with the help of appropriate computational tools and detection and tracking software, the movement of a crowd as a network of rhythms and show that the correlation among the individuals' rhythm can lead to phenomena of synchronization and self-organization of the moving crowd
    corecore