Abstract
In this paper we propose a new approach, the robot path planning with cellular automata. The idea is based on maximum clearance technique that preserves the distance of the robot to obstacles as far as possible. An existing approach is implemented using Voronoi diagram that generates the candidate paths that are safe from collision with the obstacles. In fact, maximum clearance method can be solved analytically using the deformation retraction, but this approach is applicable for the continuous environment only and it requires a lot of function computation. Hence, we solve this problem using a particular rule of cellular automata to perform the process of computation that can be done efficiently. Our approach is suitable for path planning in a grid-based environment.