Reachable Grasps on a Polygon: The Convex Rope Algorithm

Michael A. Peshkin, Arthur C. Sanderson

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

An algorithm that finds the externally visible vertices of a polygon is described. This algorithm generates a new geometric construction, termed the convex ropes of each visible vertex. The convex ropes give the range of angles from which each vertex is visible, and they give all the pairs of vertices which are reachable by a straight robot finger. All of the convex ropes can be found in expected time order n, where n is the number of vertices of the polygon. We discuss the application of this geometric construction to automated grasp planning. The algorithm may also be useful in image interpretation and graphics where efficient computation of visible points is important. The direct application of the algorithm is restricted to two dimensions since sequential ordering of vertices is required. Extention to three dimensions would rely on well chosen intersecting or projective planes.

Original languageEnglish (US)
Pages (from-to)53-58
Number of pages6
JournalIEEE Journal on Robotics and Automation
Volume2
Issue number1
DOIs
StatePublished - Mar 1986

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Engineering(all)
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Reachable Grasps on a Polygon: The Convex Rope Algorithm'. Together they form a unique fingerprint.

Cite this