Abstract
In this paper, we propose a fast motion planning method for 6 DOF manipulator based on a maze-searching algorithm. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
