MétaCan
Menu
Back to cohort
Record W2761657772 · doi:10.1109/iris.2016.8066082

Genetic algorithm based direction finder on the manifold for singularity free paths

2016· article· en· W2761657772 on OpenAlexaff
Sindhu Radhakrishnan, Wail Gueaieb

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsSingularityWorkspaceGravitational singularityManifold (fluid mechanics)HolonomicPath (computing)Degrees of freedom (physics and chemistry)Computer scienceLimit (mathematics)Control theory (sociology)TrajectoryMotion (physics)Topology (electrical circuits)AlgorithmRobotMathematicsArtificial intelligenceMathematical analysisControl (management)Engineering

Abstract

fetched live from OpenAlex

Manipulators that execute tasks by following assigned trajectories, experience limitations in mobility when encountering singularities within their workspace. Generating trajectories for manipulators thus requires the avoidance of singular configurations as way points of the path to prevent the manipulator from assuming poses that limit the degrees of freedom of the manipulator. This paper establishes the need to operate in a singularity free configuration space, utilizes the conditions to define a singularity free manifold for a non-redundant, holonomic manipulator and proposes the Genetic Algorithm Based Direction Finder (GADF) to determine the optimal directions of motion on the implicitly defined manifold to generate a singularity free path from the start to the goal configurations of the defined task. The GADF was successfully simulated using a model of a 3 link planar manipulator followed by an analysis of results and possible improvements.

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.936
Threshold uncertainty score0.330

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0010.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.025
GPT teacher head0.235
Teacher spread0.210 · 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

Citations2
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207