Collision-Free Path Planning of Articulated Manipulators

[+] Author and Article Information
Zvi Shiller, Yu-Rwei Gwo

Department of Mechanical Aerospace and Nuclear Engineering, University of California, Los Angeles, Los Angeles, CA 90024-1597

J. Mech. Des 115(4), 901-908 (Dec 01, 1993) (8 pages) doi:10.1115/1.2919285 History: Received August 01, 1991; Revised March 01, 1992; Online June 02, 2008


A method is presented to efficiently compute a collision free path for manipulators with polyhedral links moving among polyhedral obstacles. The method is based on an analytical representation of the boundaries of configuration space obstacles (CSOB), obtained by modeling the contacts between manipulator links and obstacle as higher kinematic pairs. The contact conditions and manipulator kinematics are expressed in terms of homogeneous transformations, providing analytic relations between the joint angles and the contact variables. The set of joint angles associated with permissible contact variables forms the boundary of the CSOB. Using these analytical relations, the free space is efficiently divided into free-cells. Each contiguous set of free-cells is then represented by a connected graph that is of polynomial complexity in the number of geometric features of the obstacles and links. The shortest collision-free path on the graph is found using a best-first search. Examples are presented which demonstrate the method for a two link planar manipulator.

Copyright © 1993 by The American Society of Mechanical Engineers
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In