Open AccessCellular Automata over Hexagonal and Triangular Tessellations for Path Planning
Author(s) -
Jasmeena Tariq*,
A. Kumaravel
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d7941.118419
Subject(s) - cellular automaton , motion planning , hexagonal crystal system , path (computing) , robot , terrain , computer science , square (algebra) , hexagonal tiling , tessellation (computer graphics) , theoretical computer science , variation (astronomy) , automaton , algorithm , combinatorics , mathematics , artificial intelligence , computer graphics (images) , geometry , geography , cartography , physics , chemistry , astrophysics , programming language , crystallography
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.