Skip to main content
Article thumbnail
Location of Repository

Using Manhattan Paths for Manipulation Planning

By Juan Manuel Ahuactzin and Kamal Gupta


This paper deals with the manipulation planning problem, where the goal is to plan the motion of a robot so that it can move a given object from an initial configuration to a final configuration while avoiding collisions with the static obstacles in the environment. Our specific approach adapts Adraine's Clew Algorithm that has been shown effective for classical motion planning problem [1, 12]. In our approach, landmarks are placed in lower dimensional submanifolds of the composite configuration space. These landmarks represent stable grasps that are reachable from the initial configuration. From each new landmark, the planner attempts to reach the goal configuration by executing a local planner, again in a lower (but different) dimensional submanifold of the composite configuration space. We have implemented this approach and present initial experiments with a simple 2-dof planar arm among polygonal obstacles. Key Words : manipulation planning, regrasping, configuration space, landma..

Topics: space, landmarks
Year: 1995
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.