An Improved Cellular Automata-Based Model for Robot Path-Planning

Giordano B. S. Ferreira, Patricia A. Vargas, Gina M. B. Oliveira

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

18 Citations (Scopus)

Abstract

Cellular automata (CA) are able to represent high complex phenomena and can be naturally simulated by digital processors due to its intrinsic discrete nature. CA have been recently considered for path planning in autonomous robotics. In this work we started by adapting a model proposed by Ioannidis et al. to deal with scenarios with a single robot, turning it in a more decentralized approach. However, by simulating this model we noticed a problem that prevents the robot to continue on its path and avoid obstacles. A new version of the model was then proposed to solve it. This new model uses CA transition rules with Moore neighborhood and four possible states per cell. Simulations and experiments involving real e-puck robots were performed to evaluate the model. The results show a real improvement in the robot performance.
Original languageEnglish
Title of host publication Advances in Autonomous Robotics Systems. TAROS 2014.
Subtitle of host publicationConference Towards Autonomous Robotic Systems
EditorsM. Mistry, A. Leonardis, M. Witkowski, C. Melhuish
PublisherSpringer
Pages25-36
Volume8717
ISBN (Electronic)978-3-319-10401-0
ISBN (Print)978-3-319-10400-3
DOIs
Publication statusPublished - 2014

Publication series

NameLecture Notes in Computer Science
Volume8717
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'An Improved Cellular Automata-Based Model for Robot Path-Planning'. Together they form a unique fingerprint.

Cite this