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 KUKA™, a commercial 6 DOF robot manipulator, and its feasibility and efficiency are demonstrated via the cosimulatation of MatLab™ and RecurDyn™. [ABSTRACT FROM AUTHOR] Copyright of Enformatika is the property of World Academy of Science, Engineering & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Cite
CITATION STYLE
Oh, K.-S., Kim, E.-T., & Cho, Y.-W. (2007). Path planning of a Robot Manipulator using Retrieval RRT Strategy. International Journal of Fuzzy Logic and Intelligent Systems, 7(2), 138–142. https://doi.org/10.5391/ijfis.2007.7.2.138
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.