MétaCan
Menu
Back to cohort
Record W2164098927 · doi:10.1109/acc.2011.5991400

Collision-free trajectory generation of robotic manipulators using receding horizon strategy

2011· article· en· W2164098927 on OpenAlexaff
Hoam Chung, Soo Jeon

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsTrajectoryCollision avoidanceCollisionControl theory (sociology)ComputationComputer scienceSet (abstract data type)HorizonRobotState spaceMotion planningRobot manipulatorMathematical optimizationMathematicsArtificial intelligenceAlgorithmControl (management)

Abstract

fetched live from OpenAlex

The main objective of this paper is to study the feasibility of the receding horizon (RH) strategy to generate the collision-free on-line optimal trajectory for articulated manipulators under dynamic environments. Firstly, we employ the elliptical set to represent the no-collision zone around each link, and explicitly formulate collision avoidance constraints using state-space inequalities. Secondly, to address the major drawback of intensive computation load, we adopt so called the external active-set strategy that is recently developed by Chung and Polak. Simulation results with two-link robot are presented to demonstrate how to implement the proposed method. Main features and related issues for the feasibility of the RH strategy are discussed in detail.

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.327
Threshold uncertainty score0.562

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.001
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.195
GPT teacher head0.284
Teacher spread0.089 · 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
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207