Abstract
A new algorithm for path planning and obstacle avoidance for redundant planar robots is proposed. The task of path planning is formulated as a sequence of nonlinear programming problems. For each problem, the objective is to minimize the distance between the current location of the end-effector and a desired location. Two penalties are added to each objective function to ensure that the robot is not colliding with any obstacle and that its links are not crossed over. The effects of mechanical stops and limits for maximum joint movements are also incorporated as inequality constraints. The algorithm uses an adaptive scheme to activate the fewest number of the outboardmost joints, and none of the inboard ones if possible, to reach a desired location. The algorithm is especially useful when the number of joints is large. © 1996 John Wiley & Sons, Inc.
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.
