Cellular Automata over Hexagonal and Triangular Tessellations for Path Planning
Jasmeena Tariq1, A. Kumaravel2
1Jasmeena Tariq, research scholar at, Computer Applications, Bharath Institute of Higher Education and Research, Chennai.
2A. Kumaravel, Professor and Dean, School of Computing, Bharath University, Chennai.

Manuscript received on November 17., 2019. | Revised Manuscript received on November 24 2019. | Manuscript published on 30 November, 2019. | PP: 12395-12398 | Volume-8 Issue-4, November 2019. | Retrieval Number: D7941118419/2019©BEIESP | DOI: 10.35940/ijrte.D7941.118419

Open Access | Ethics and Policies | Cite  | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Exploring unknown terrains demand for the sophisticated algorithms for path planning in case of multi-robot systems. Robots searching for common goals are complicated as they need to avoid collisions. We need to provide paths for all robots which should be collision free and should take less amount of time. Usually these algorithms use square tessellations in this type of investigations, which leads to the lack of variation and enlargement of neighborhood. In this paper we present the construction of a cellular automaton over triangular and hexagonal tessellations and show the complexity for the same.
Keywords: Cellular Automata, Complexity, Tessellations, Multi-Robot Systems, Path Planning.
Scope of the Article: Problem Solving and Planning.