The Complete Coverage Path Planning (CCPP) algorithm finds a collision free path while covering every accessible region within an environment. CCPP is fundamental to many real world robotic applications such as mine sweeping, cleaning, painting, surveillance, and agriculture field operations. The current state of the art coverage algorithms usually generate a linear path with sharp turns. Such a p...Show More
Optimal path for robot in collision free space is influenced by a number of factors such as path length, total number of turns, and execution time. A* is a well-known grid based path planning approach used for path planning of robots. In this paper, an efficient variation of A*, named Memory Efficient A* (MEA*), is proposed to find optimal path between start and goal point while avoiding obstacles...Show More
