A Cellular Automaton that Computes Shortest Paths in Grid Graph

2021 ◽  
pp. 3-7
Author(s):  
Debopriya Barman ◽  
Sukanta Das
Keyword(s):  
Cellular Automaton ◽  
Shortest Paths ◽  
Grid Graph

A Graph-Search Based Navigation Algorithm for Traversing A Potentially Hazardous Area with Disambiguation

2012 ◽  
pp. 123-136 ◽  
Author(s):  
Xugang Ye ◽  
Carey E. Priebe
Keyword(s):  
Weight Function ◽  
Shortest Paths ◽  
Graph Search ◽  
Potential Hazard ◽  
Two Dimensional ◽  
Grid Graph ◽  
A Algorithm ◽  
Navigation Algorithm ◽  
Hazardous Area

The authors consider the problem of navigating an agent to safely and swiftly traverse a two dimensional terrain populated with possible hazards. Each potential hazard is marked with a probabilistic estimate of whether it is indeed true. In proximity to any of these potential hazards, the agent is able to disambiguate, at a cost, whether it is indeed true or false. The method presented in this paper is to discretize the terrain using a two dimensional grid with 8-adjacency and approximately solve the problem by dynamically searching for shortest paths using the A* algorithm in the positively weighted grid graph with changing weight function.

A Graph-Search Based Navigation Algorithm for Traversing A Potentially Hazardous Area with Disambiguation

2010 ◽  
Vol 1 (3) ◽  
pp. 14-27 ◽  
Author(s):  
Xugang Ye ◽  
Carey E. Priebe
Keyword(s):  
Weight Function ◽  
Shortest Paths ◽  
Graph Search ◽  
Potential Hazard ◽  
Two Dimensional ◽  
Grid Graph ◽  
A Algorithm ◽  
Navigation Algorithm ◽  
Hazardous Area

The authors consider the problem of navigating an agent to safely and swiftly traverse a two dimensional terrain populated with possible hazards. Each potential hazard is marked with a probabilistic estimate of whether it is indeed true. In proximity to any of these potential hazards, the agent is able to disambiguate, at a cost, whether it is indeed true or false. The method presented in this paper is to discretize the terrain using a two dimensional grid with 8-adjacency and approximately solve the problem by dynamically searching for shortest paths using the A* algorithm in the positively weighted grid graph with changing weight function.

A Probabilistic Cellular Automaton for Evolution

1995 ◽  
Vol 5 (9) ◽  
pp. 1129-1134 ◽  
Author(s):  
Nikolaus Rajewsky ◽  
Michael Schreckenberg
Keyword(s):  
Cellular Automaton ◽  
Probabilistic Cellular Automaton

Autómatas Celulares Aplicados al Comportamiento de Células de Cáncer Cervicouterino

2019 ◽  
Vol 6 (1) ◽  
pp. 44-49
Author(s):  
Tania Muñoz Jiménez ◽  
Aurora Torres Soto ◽  
María Dolores Torres Soto
Keyword(s):  
Cellular Automaton ◽  
Medical Model ◽  
Research Process ◽  
Simulation Algorithm ◽  
Stages Of Development ◽  
Literary Research ◽  
Migration Dynamics ◽  
Three Stages ◽  
And Migration ◽  
Best Parameters

En este documento se describe el desarrollo e implementación de un modelo para simular computacionalmente la dinámica del crecimiento y migración del cáncer cervicouterino, considerando sus principales características: proliferación, migración y necrosis, así como sus etapas de desarrollo. El modelo se desarrolló mediante un autómata celular con enfoques paralelo y secuencial. El autómata celular se basó en el modelo de Gompertz para simular las etapas de desarrollo de este cáncer, el cual se dividió en tres etapas cada una con diferentes comportamientos durante la simulación. Se realizó un diseño experimental con parámetros de entrada que se seleccionaron a partir de la investigación literaria y su discusión con médicos expertos. Al final del proceso de investigación, se logró obtener un algoritmo computacional de simulación muy bueno comparado con el modelo médico de Gompertz y se encontraron los mejores parámetros para su ejecución mediante un diseño factorial soportado estadísticamente. This paper describes the development and implementation of a model to computationally simulate the growth and migration dynamics of cervical cancer, considering its main characteristics: proliferation, migration and necrosis, as well as its stages of development. The model was developed by means of a cellular automaton with parallel and sequential approaches. The cellular automaton was based on the model of Gompertz to simulate the stages of development of this cancer, which was divided into three stages, each with different behaviors during the simulation. An experimental design was carried out with input parameters that were selected from literary research and its discussion with expert physicians. At the end of the research process, a very good simulation algorithm was obtained compared to the Gompertz medical model and the best parameters for its execution were found by means of a statistically supported factorial design.

Simulating Self-Regeneration and Self-Replication Processes Using Movable Cellular Automata with a Mutual Equilibrium Neighborhood

2020 ◽  
Vol 29 (4) ◽  
pp. 741-757
Author(s):  
Kateryna Hazdiuk ◽  
◽  
Volodymyr Zhikharevich ◽  
Serhiy Ostapov ◽  
◽  
...  
Keyword(s):  
Cellular Automata ◽  
Cellular Automaton ◽  
Three Dimensional ◽  
Computer Models ◽  
The Self ◽  
Model Construction ◽  
Natural Phenomena ◽  
Different Types ◽  
Movable Cellular Automata ◽  
Self Replication

This paper deals with the issue of model construction of the self-regeneration and self-replication processes using movable cellular automata (MCAs). The rules of cellular automaton (CA) interactions are found according to the concept of equilibrium neighborhood. The method is implemented by establishing these rules between different types of cellular automata (CAs). Several models for two- and three-dimensional cases are described, which depict both stable and unstable structures. As a result, computer models imitating such natural phenomena as self-replication and self-regeneration are obtained and graphically presented.

The Prototyping of a Shading Device Controlled by a Cellular Automaton

2010 ◽  
Vol 19 (2) ◽  
pp. 157-176 ◽  
Author(s):  
Machi Zawidzki ◽  
Ichiro Fujieda ◽  
Keyword(s):  
Cellular Automaton ◽  
Shading Device

eMap: A Web Application for Identifying and Visualizing Electron or Hole Hopping Pathways in Proteins

2019 ◽  
Author(s):  
Ruslan N. Tazhigulov ◽  
James R. Gayvert ◽  
Melissa Wei ◽  
Ksenia B. Bravaya
Keyword(s):  
Web Application ◽  
Shortest Paths ◽  
Coarse Grained ◽  
Decay Parameter ◽  
Electron Hole ◽  
Web Based ◽  
Aromatic Amino Acid Residue ◽  
Pathways Model ◽  
Visualization Tools ◽  
Effective Decay

<p>eMap is a web-based platform for identifying and visualizing electron or hole transfer pathways in proteins based on their crystal structures. The underlying model can be viewed as a coarse-grained version of the Pathways model, where each tunneling step between hopping sites represented by electron transfer active (ETA) moieties is described with one effective decay parameter that describes protein-mediated tunneling. ETA moieties include aromatic amino acid residue side chains and aromatic fragments of cofactors that are automatically detected, and, in addition, electron/hole residing sites that can be specified by the users. The software searches for the shortest paths connecting the user-specified electron/hole source to either all surface-exposed ETA residues or to the user-specified target. The identified pathways are ranked based on their length. The pathways are visualized in 2D as a graph, in which each node represents an ETA site, and in 3D using available protein visualization tools. Here, we present the capability and user interface of eMap 1.0, which is available at https://emap.bu.edu.</p>

Sign in / Sign up

Export Citation Format

Share Document