Adaptive path planning and obstacle avoidance for a robot with a large degree of redundancy
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.
Mobile robots; Robots – Motion – Programming
Applied Mathematics | Artificial Intelligence and Robotics | Computer-Aided Engineering and Design | Computer Engineering | Computer Sciences | Mechanical Engineering | Robotics
Use Find in Your Library, contact the author, or use interlibrary loan to garner a copy of the article. Publisher copyright policy allows author to archive post-print (author’s final manuscript). When post-print is available or publisher policy changes, the article will be deposited
Li, J. Z. and Trabia, M. B. (1996), Adaptive path planning and obstacle avoidance for a robot with a large degree of redundancy. J. Robotic Syst., 13: 163–176. doi: 10.1002/(SICI)1097-4563(199603)13:3<163::AID-ROB4>3.0.CO;2-Q
Li, J. Z.,
Adaptive path planning and obstacle avoidance for a robot with a large degree of redundancy.
Journal of Robotic Systems, 13(3),