Share Email Print
cover

Proceedings Paper

Complexity of computing reachable workspaces for redundant manipulators
Author(s): Tarek Khaled Alameldin; Michael A. Palis; Sanguthevar Rajasekaran; Norman I. Badler
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Details

Date Published: 1 February 1991
PDF: 9 pages
Proc. SPIE 1381, Intelligent Robots and Computer Vision IX: Algorithms and Techniques, (1 February 1991); doi: 10.1117/12.25153
Show Author Affiliations
Tarek Khaled Alameldin, Univ. of Pennsylvania (United States)
Michael A. Palis, Univ. of Pennsylvania (United States)
Sanguthevar Rajasekaran, Univ. of Pennsylvania (United States)
Norman I. Badler, Univ. of Pennsylvania (United States)


Published in SPIE Proceedings Vol. 1381:
Intelligent Robots and Computer Vision IX: Algorithms and Techniques
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top