Obstacle avoidance for a power line inspection robot

Abstract

This paper presents an obstacle avoidance solution for an existing power line inspection robot (PLIR) prototype. The PLIR's workspace environment is represented by a discretised 3D map, which is used for obstacle avoidance manoeuvre planning for both known and unknown obstacles. Obstacles are represented in this workspace using a union of axis aligned bounding boxes. The Lazy Theta* algorithm is then used to find the shortest 3D graph path around the obstacle. The resulting path nodes are used to generate a B-spline trajectory. The trajectory is simulated to check for collisions and, if collision free, is used to command the actual robot. Experimental results show that this obstacle avoidance strategy is successful, with the prototype robot being able to manoeuvre around an obstacle in laboratory tests.