MétaCan
Menu
Back to cohort
Record W2160062944 · doi:10.1109/robot.2001.933087

Multi-metric comparison of optimal 2D grasp planning algorithms

2002· article· en· W2160062944 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobot Manipulation and Learning
Canadian institutionsMcMaster University
Fundersnot available
KeywordsGRASPMetric (unit)Computer scienceComputationPlan (archaeology)Set (abstract data type)BenchmarkingRoboticsArtificial intelligenceRobotAlgorithmMathematical optimizationEngineeringMathematics

Abstract

fetched live from OpenAlex

The planning of optimal grasps is an important problem in robotics which has been investigated by many researchers. The large number of available methods has made it difficult to discern those which plan a grasp with good overall performance, i.e., one with high strength, insensitivity to positioning errors, and ease of computation. In this paper, a new grasp planning method is introduced and compared to three existing planning methods using three such metrics. A new metric for measuring the sensitivity of a grasp to positioning errors is also introduced. Since grasp planning is much simpler in 2D, and 2D grasps are applicable to many 3D objects, the four methods involve only a 2D analysis. The methods are applied to a set of six polygonal objects, ranging from 3 sided to 74 sided, and their overall performance is compared. The benchmarking procedure is readily applicable to other grasp planning methods.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.861
Threshold uncertainty score0.806

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.089
GPT teacher head0.304
Teacher spread0.216 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations28
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicRobot Manipulation and LearningFrench-language works237,207