Skip to main content

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

  • Conference paper
Advances in Autonomous Robotics Systems (TAROS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8717))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arkin, R.C.: Behavior-based robotics. MIT Press (1998)

    Google Scholar 

  2. Zhang, Y., Fattahi, N., Li, W.: Probabilistic roadmap with self-learning for path planning of a mobile robot in a dynamic and unstructured environment. In: Mechatronics and Automation (ICMA), pp. 1074–1079 (2013)

    Google Scholar 

  3. Ramer, C., Reitelshofer, S., Franke, J.: A robot motion planner for 6-DOF industrial robots based on the cell decomposition of the workspace. In: 2013 44th International Symposium on Robotics (ISR), pp. 1–4 (2013)

    Google Scholar 

  4. Jianjun, Y., Hongwei, D., Guanwei, W., Lu, Z.: Research about local path planning of moving robot based on improved artificial potential field. In: Control and Decision Conference (CCDC), pp. 2861–2865 (2013)

    Google Scholar 

  5. Mitchell, M.: Computation in cellular automata: A selected review. Non-standard Computation, 385–390 (1996)

    Google Scholar 

  6. Oliveira, G., Martins, L.G.A., de Carvalho, L.B., Fynn, E.: Some investigations about synchronization and density classification tasks in one-dimensional and two-dimensional cellular automata rule spaces. Electronic Notes in Theoretical Computer Science 252, 121–142

    Google Scholar 

  7. Behring, C., Bracho, M., Castro, M., Moreno, J.A.: An Algorithm for Robot Path Planning with Cellular Automata. In: Proc. of the 4th Int. Conf. on Cellular Automata for Research and Industry, pp. 11–19 (2000)

    Google Scholar 

  8. Soofiyani, F.R., Rahmani, A.M., Mohsenzadeh, M.: A Straight Moving Path Planner for Mobile Robots in Static Environments Using Cellular Automata. In: Int. Conf. on Computational Intelligence, Communication Systems and Networks, pp. 67–71 (2010)

    Google Scholar 

  9. Rosenberg, A.: Cellular ANTomata. Paral. and Distributed Processing and Applications, 78–90 (2007)

    Google Scholar 

  10. Cyberbotics. Webots 7: robot simulator (2013), http://www.cyberbotics.com/overview

  11. E-puck Education Robot, http://www.e-puck.org

  12. Akbarimajd, A., Lucas, C.: A New Architecture to Execute CAs-Based Path-Planning Algorithm in Mobile Robots. In: IEEE Int. Conf. on Mechatronics, pp. 478–482 (2006)

    Google Scholar 

  13. Akbarimajd, A., Hassanzadeh, A.: A novel cellular automata based real time path planning method for mobile robots. Int. Journal of Engineering Research and Applications (2011)

    Google Scholar 

  14. Ioannidis, K., Sirakoulis, G.C., Andreadis, I.: A Cellular Automaton Collision- Free Path Planner Suitable for Cooperative Robots. In: Panhellenic Conf. on Informatics (2008)

    Google Scholar 

  15. Ioannidis, K., Sirakoulis, G., Andreadis, I.: Cellular ants: A method to create collision free trajectories for a cooperative robot team. Robotics and Autonomous Systems (2011)

    Google Scholar 

  16. Shu, C., Buxton, H.: Parallel path planning on the distributed array processor. Parallel Computing 21(11), 1749–1767 (1995)

    Article  Google Scholar 

  17. Marchese, F.: A reactive planner for mobile robots with generic shapes and kinematics on variable terrains. In: Proc. Advanced Robotics, ICAR 2005, pp. 23–30 (2005)

    Google Scholar 

  18. Tzionas, P., Thanailakis, A., Tsalides, P.: Collision-free path planning for a diamond-shaped robot using two-dimensional CA. IEEE Trans. on Rob. and Automation (1997)

    Google Scholar 

  19. Vargas, P.A., Di Paolo, E.A., Harvey, I., Husbands, P.: The Horizons of Evolutionary Robotics. MIT Press (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ferreira, G.B.S., Vargas, P.A., Oliveira, G.M.B. (2014). An Improved Cellular Automata-Based Model for Robot Path-Planning. In: Mistry, M., Leonardis, A., Witkowski, M., Melhuish, C. (eds) Advances in Autonomous Robotics Systems. TAROS 2014. Lecture Notes in Computer Science(), vol 8717. Springer, Cham. https://doi.org/10.1007/978-3-319-10401-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10401-0_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10400-3

  • Online ISBN: 978-3-319-10401-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics