Home /Research /Path planning of a Robot Manipulator using Retrieval RRT Strategy
MANIPULATION

Path planning of a Robot Manipulator using Retrieval RRT Strategy

Kyong-Sae Oh, Euntai Kim, Youngwan Cho

Year
2007
Citations
3
Access
Open access

Abstract

This paper presents an algorithm which extends the rapidly-exploring random tree (RRT) framework to deal with change of the task environments. This algorithm called the Retrieval RRT Strategy (RRS) combines a support vector machine (SVM) and RRT and plans the robot motion in the presence of the change of the surrounding environment. This algorithm consists of two levels. At the first level, the SVM is built and selects a proper path from the bank of RRTs for a given environment. At the second level, a real path is planned by the RRT planners for the: given environment. The suggested method is applied to the control of <TEX>$KUKA^{TM}$</TEX>, a commercial 6 DOF robot manipulator, and its feasibility and efficiency are demonstrated via the cosimulatation of <TEX>$MatLab^{TM}\;and\;RecurDyn^{TM}$</TEX>.

Keywords

Motion planningPath (computing)Computer scienceRobotTask (project management)Random treeSupport vector machineMATLABArtificial intelligenceSimulation

Related papers

Browse all MANIPULATION papers