A RRT based path planning algorithm for Rehabilitation robots

Conference: ISR/ROBOTIK 2010 - ISR 2010 (41st International Symposium on Robotics) and ROBOTIK 2010 (6th German Conference on Robotics)
06/07/2010 - 06/09/2010 at Munich, Germany

Proceedings: ISR/ROBOTIK 2010

Pages: 8Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Fragkopoulos, Christos; Gräser, Axel (Institute of Automation, University of Bremen, Otto-Hahn-Alle 1, NW1, 28359 Bremen, Germany)

This paper presents a new approach called Cell based Bi-directionall Rapidly exploring Random Trees (CellBiRRT) for manipulator motion that is able to handle pose constraints and to operate in difficult environments with high probability of collisions. The approach uses the idea of bi-directional RRT (Bi-RRT) and creates an algorithm that uses configuration (C-Space) and Cartesian space. It is achieved by decomposing the Cartesian space into cells, which will be used later as basis in order to reduce the free C-Space by generating N-dimensional cuboid regions. The results show that the method can be an acceptable solution to path planning problem, allowing a 7 Degrees of Freedom (DoF) robot arm to perform household’s activities, like moving and placing bottles or keeping horizontally a meal tray in order to serve handicapped people.