MétaCan
Menu
Back to cohort
Record W2121915468 · doi:10.1109/robot.1994.351163

Efficient algorithms for the trajectory planning of redundant manipulators with obstacle avoidance

2002· article· en· W2121915468 on OpenAlexafffund
Thierry Laliberté, Clément Gosselin

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotic Mechanisms and Dynamics
Canadian institutionsUniversité Laval
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsObstacle avoidanceComputer scienceHeuristicsAlgorithmMotion planningContext (archaeology)ObstacleCollision avoidanceCartesian coordinate systemMaxima and minimaTrajectoryRobotHeuristicPath (computing)Robot end effectorArtificial intelligenceComputer visionCollisionMathematicsMobile robot

Abstract

fetched live from OpenAlex

This article presents a path planning strategy for redundant serial manipulators working in a cluttered environment. Developed in a practical context of telemanipulation, the algorithm, which sacrifices the capability of solving very difficult trajectories for efficiency, allows a human to control a robot at a higher level, in Cartesian space. The model of the environment is provided by a 3D vision system as an occupancy map. An iterative process guides the end effector towards its goal with the help of discrete potential fields, which reduce the number of local minima. The motion of the manipulator is calculated using the velocity inversion of a redundant manipulator, which optimizes the distance to obstacles. The algorithm includes joint limit constraints, collision detection and heuristics for the solution of typical difficult cases, thereby leading to a high success rate. A simulator has been developed to test the algorithms.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.835
Threshold uncertainty score0.231

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.031
GPT teacher head0.216
Teacher spread0.185 · 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

Citations17
Published2002
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Mechanisms and DynamicsFrench-language works237,207