A MOVING OBSTACLES PLANNER ALGORITHM FOR A SIX-WHEELED SURVEYING ROBOT

Abstract. Nowadays, robotic systems such as ground vehicle robots are mostly used in many industrial and military applications. Therefore, the path planning problem in the robotics domain is very important. Moving Obstacles Planner (MOP) algorithms have got the researchers interests in recent years and some of the most recent ones have been implemented in Robot Operating System (ROS) which is an open source middle wear to work with robots. This paper aims to compare the state-of-the-art MOP algorithms including Rapidly exploring Random Tree (RRT) and those implemented in the ROS navigation stack such as Dynamic Window Approach (DWA) local planner coupled with Dijkstra and A* as global planners on a six-wheeled robot known as MOOR in simulation environment. The results reveal that all of these algorithms have been designed for a square shape footprint robot and thus have limitations for MOOR with a rectangular footprint shape.