A comprehensive robot collision avoidance scheme by two-dimensional geometric modeling

Avoiding collisions is the primary objective for a robot moving in a workspace with obstacles. The conventional obstacle avoidance algorithms suffer from the drawbacks due to considerable approximations and lack of flexibility. The proposed obstacle avoidance algorithms are developed based upon the geometric modeling of robot workspace using quadtree data structure. Quadtree is a hierarchical decomposition method in which the region is recursively divided into four contiguous squares. A quadtree is generated from the polygonal representation of the obstacles in the workspace, called the obstacle-quadtree. By examining the obstacle-quadtree, nodes that can allow safe passage for the mobile robot are identified By connecting all such nodes, a set of collision-free paths are generated and subsequently the optimal path is chosen, The advantages of the proposed algorithms include: (a) a quick computation of the shortest path for the mobile robot, (b) flexibility to merge different parts of the robot environment to investigate different navigation strategies, and (c) ability to vary the required accuracy of collision detection by changing the resolution