Global path planning for multi-robot with cellular automata

In this paper we propose an approach, the global path planning for multi-robot system with cellular automata. The idea is to calculate the distance from all possible robot positions to the goal. The candidate path is determined by selecting the neighboring cells with the smallest value. We solve this problem using a particular rule of cellular automata to perform the process of computation. This process can be performed efficiently. Our approach is suitable for path planning in a grid-based environment.