The DOI matches its Crossref record.
Easily computable optimum grasps in 2-D and 3-D
Abstract
We consider the problem of finding optimum force closure grasps of two and three-dimensional objects. Our focus is on grasps which are useful in practice, namely grasps with a small number of fingers, with friction at the contacts. Assuming frictional contact and rounded finger tips-very mild assumptions in practice-we give new upper (and lower) bounds on the number of fingers necessary to achieve force closure grasps of 2-D and 3-D objects. We develop an optimality criterion based on the notion of decoupled wrenches, and use this criterion to derive optimum two and three finger grasps of 2-D objects, and optimum three finger grasps for 2-D objects. We present a simple O(n) algorithm for computing these optimum grasps for convex polygons, a O(n log n) algorithm for nonconvex polygons, and an O(n/sup 3/) algorithm for polyhedra. In studying these optimum grasps, we derive several interesting theoretical results concerning grasp geometry.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Automatic grasp planning using shape primitives
Miller, A. T., Knoop, S., Christensen, H. I., & Allen, P. K. (2004) · 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422) · doi:10.1109/robot.2003.1241860 · Cited by 705
Synergies Between Affordance and Geometry: 6-DoF Grasp Detection via Implicit Representations
Jiang, Z., Zhu, Y., Svetlik, M., Fang, K., & Zhu, Y. (2021) · Robotics: Science and Systems XVII · doi:10.15607/rss.2021.xvii.024 · Cited by 122
Synergies Between Affordance and Geometry: 6-DoF Grasp Detection via Implicit Representations
Jiang, Z., Zhu, Y., Svetlik, M., Fang, K., & Zhu, Y. (2021) · arXiv · doi:10.48550/arxiv.2104.01542 · Cited by 122
Metadata
- Authors
- Mirtich, B., & Canny, J.
- Venue
- Proceedings of the 1994 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-17
- Pages
- 739-747
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1925324831
- Cited by
- 234
- References
- 0
- FWCI
- 22.82
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Easily computable optimum grasps in 2-D and 3-D. https://app.cochat.ai/papers/10.1109/robot.1994.351399
- The paper
- Mirtich, B., & Canny, J. (2002). Easily computable optimum grasps in 2-D and 3-D. Proceedings of the 1994 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/robot.1994.351399
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.