MétaCan
Menu
Back to cohort
Record W1886178236 · doi:10.1109/iros.1993.583853

The sequential framework for developing motion planners for many degree of freedom manipulators: Experimental results

2002· article· en· W1886178236 on OpenAlexaff
Kamal Gupta, Xinyu Zhu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsBacktrackingSerial manipulatorComputer scienceDegrees of freedom (physics and chemistry)Motion planningVariety (cybernetics)Motion (physics)RobotManipulator (device)Mechanism (biology)TrajectoryExploitPlannerControl theory (sociology)Mathematical optimizationArtificial intelligenceParallel manipulatorMathematicsAlgorithmControl (management)Physics

Abstract

fetched live from OpenAlex

A sequential framework that allows planners for manipulator arms with many degrees of freedom to be developed is addressed. The essence of this framework is to exploit the serial structure of manipulator arms and decompose the n-dimensional problem of planning collision-free motions for an n-link manipulator into a sequency of smaller m-dimensional subproblems, each of which corresponds to planning the motion of a subgroup of m-1 links. Extensive experimental results within the sequential framework are presented for a variety of manipulators. A main goal of these simulations (1) to show the effectiveness of the sequential approach with the backtracking mechanism, and (2) to quantify the improvement of the backtracking mechanism and the trade-off between the number of backtrackings and the execution time of the planner. The experiments show that the sequential framework with the backtracking mechanism is quite efficient for manipulator arms with many degrees of freedom.

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

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.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.127
GPT teacher head0.316
Teacher spread0.189 · 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
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207