Investigating a cellular automata model that performs three distance diffusion on a robot path planning
نویسندگان
چکیده
An improved cellular automata (CA) model is proposed and evaluated on a path planning problem for an autonomous robot. The objective is to construct a collision-free path from the robot’s initial position to the goal by applying the improved CA model and environment pre-processed images captured during its navigation. CA rules are used to enlarge obstacles and to perform three distance diffusion. Goal distance is spread by a CA rule using the free cells. Distance diffusion spread two new metrics used for cells inside the enlarged obstacle regions. The new distances are then used to plan routes when the robot needs to pass inside enlarged obstacle regions. The algorithm performs a new path planning at each n steps of robot navigation using its current position. Our inspiration came from the possibility to mimic the cognitive behaviour of desert ants, which re-plan their path to the goal constantly in time intervals, using only local cues. An e-puck robot was used in simulated scenarios to evaluate the new CA based adaptive path planning model. The simulations show promising results on the single robot’s performance confirming that the model could also be adapted for robot swarms.
منابع مشابه
Robot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملModeling Urban Sprawling of Tehran Metropolitan Area Based on PSO
The main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on TM and ETM+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. In this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...
متن کاملPattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach
FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...
متن کاملCellular Automata Based Path-planning Algorithm for Autonomous Mobile Robots
This paper presents the application of Cellular Automata (CA) model in solving the problem of path planning. It is shown that a CA allows the efficient computation of a path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace. The method was experimentally tested on an autonomous mobile robot on ...
متن کاملAn Algorithm for Robot Path Planning with Cellular Automata
The application of Cellular Automata to the problem of robot path planning is presented. It is shown that a Cellular Automata allows the efficient computation of an optimal collision free path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace for a mobile robot. The path computation is performe...
متن کامل