Motion Planning for 6 DOF Robot Arm Based on Maze-searching

  • Kamoi R
  • Sato K
  • Sakai H
  • et al.
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we propose a fast motion planning method for 6 DOF manipulator based on a maze-searching algo-rithm. Proposed method is utilizing the CPFS (Closest Point First Search) algorithm similar to the Bug2 algorithm proposed by Lumelsky. We have modified CPFS algorithm with FAP (Footprint Avoidance Procedure) in order to guarantee that the planning does not fall into the deadlock situation. At the beginning of the planning, the initial configuration of 6 DOF robot moves straight toward goal configuration . When the path meets collision configuration, the path is generated along the boundary between free-and collision-configuration. Using computer simulation, we evaluate the proposed method with calculation time. As a result, the proposed method can generate a path with 10 times shorter than the RRT method.

Cite

CITATION STYLE

APA

Kamoi, R., Sato, K., Sakai, H., & Takeyama, S. (2010). Motion Planning for 6 DOF Robot Arm Based on Maze-searching. Journal of the Robotics Society of Japan, 28(8), 915–922. https://doi.org/10.7210/jrsj.28.915

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free