The DOI matches its Crossref record.
Grasp analysis as linear matrix inequality problems
Abstract
Three important problems in the study of grasping and manipulation by multi-fingered robotic hands are: 1) given a grasp characterised by a set of contact points and the associated contact models, determine if the grasp has force closure; 2) if the grasp does not have force closure, determine if the fingers are able to apply a specified resultant wrench on the object; and 3) compute "optimal" contact forces if the answer to problem (2) is affirmative. In this paper, based on an early result by Buss-Hashimoto-Moore (1996), which transforms the nonlinear friction cone constraints into positive definiteness of certain symmetric matrices, we further cast the friction cone constraints into linear matrix inequalities (LMIs) and formulate all three of the problems stated above as a set of convex optimization problems involving LMIs. We perform simulation studies to show the simplicity and efficiency of the LMI formulation to the three problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Robotic grasping and contact: a review
Bicchi, A., & Kumar, V. (2002) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844081 · Cited by 1,069
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Miller, A. T., & Allen, P. K. (2004) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2004.1371616 · Cited by 1,023
Hands for dexterous manipulation and robust grasping: a difficult road toward simplicity
Bicchi, A. (2000) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.897777 · Cited by 895
Dual arm manipulation—A survey
Smith, C., Karayiannidis, Y., Nalpantidis, L., Gratal, X., Qi, P., Dimarogonas, D. V., & Kragic, D. (2012) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2012.07.005 · Cited by 560
Grasp quality measures: review and performance
Roa, M. A., & Suárez, R. (2015) · Autonomous Robots · doi:10.1007/s10514-014-9402-3 · Cited by 445
Metadata
- Authors
- Han, L., Trinkle, J. C., & Li, Z.
- Venue
- Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C)
- Publisher
- IEEE
- Published
- 2003-01-20
- Volume
- 2
- Pages
- 1261-1268
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1901378578
- Cited by
- 238
- References
- 0
- FWCI
- 32.09
- 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
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.