MétaCan
Menu
Back to cohort
Record W2031754056 · doi:10.1109/isie.2013.6563868

Evaluation of genetic algorithm on grasp planning optimization for 3D object: A comparison with simulated annealing algorithm

2013· article· en· W2031754056 on OpenAlexaff
Zichen Zhang, Jason Gu, Jun Luo

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobot Manipulation and Learning
Canadian institutionsDalhousie University
Fundersnot available
KeywordsGRASPSimulated annealingCrossoverGenetic algorithmAlgorithmComputer sciencePlannerStability (learning theory)Mathematical optimizationMotion planningAdaptive simulated annealingRobotArtificial intelligenceMathematicsMachine learning

Abstract

fetched live from OpenAlex

Grasp planning based on geometrical information of objects can be approached as an optimization problem where a hand configuration that indicates a stable grasp needs to be located in a large search space. In this paper, we study the applicability of genetic algorithm (GA) on grasp planning optimization of 3D objects. The details are given on the selection of operators and parameters. Different sampling methods in the implementation of crossover and mutation operators are tested. A quantitative analysis including the comparison with random planner and simulated annealing (SA) method is performed to evaluate the performance of the GA based planner. GraspIt! simulator [1] is used for implementing the proposed algorithm and as the test environment. Two different quality metrics are considered. The result shows that GA is a robust method in the field of grasp planning. And the GA planner outperforms the SA planner in both pre-grasp quality and stability of the final grasp.

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.

How this classification was reachedexpand

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: Methods · Consensus signal: none
Teacher disagreement score0.577
Threshold uncertainty score0.555

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.0000.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.041
GPT teacher head0.291
Teacher spread0.250 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicRobot Manipulation and LearningFrench-language works237,207