Cellular Automata over Hexagonal and Triangular Tessellations for Path Planning

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.