Optimal randomized path planning for redundant manipulators based on Memory-Goal-Biasing. (5th July 2018)

• Record Type: Journal Article
• Authors: Han, Dong; Nie, Hong; Chen, Jinbao; Chen, Meng
• Is Part Of: International journal of advanced robotic systems. Volume 15:Number 4(2018:Jul./Aug.)
• Publication Date: 2018-07-05
• Subjects: Rapidly-exploring Random Tree -- manipulation planning -- local minimum -- redundant manipulator -- MoveIt!; Robotics -- Periodicals; Robotics; Periodicals; 629.892
• DOI: 10.1177/1729881418787049
• Languages: English
• ISSNs: 1729-8806

Abstract

Planning path rapidly and optimally is one of the key technologies for industrial manipulators. A novel method based on Memory-Goal-Biasing–Rapidly-exploring Random Tree is proposed to solve high-dimensional manipulation planning more rapidly and optimally. The tree extension of Memory-Goal-Biasing–Rapidly-exploring Random Tree can be divided into random extension and goal extension. In the goal extension, the nodes extended to the goal are recorded in a memory, and then the node closest to the goal is selected in the search tree excepting the nodes in the memory for overcoming the local minimum. In order to check collisions efficiently, the manipulator is simplified into several key points, and the obstacle area is appropriately enlarged for safety. Taking the redundant manipulator of Baxter robot as an example, the proposed algorithm is verified through MoveIt! software. The results show that Memory-Goal-Biasing–Rapidly-exploring Random Tree only takes a few seconds for the path planning of the redundant manipulator in some complex environments, and within an acceptable time, its optimization performance is better than that of traditional optimal method in terms of the obtained path costs and the corresponding standard deviation.