MétaCan
Menu
Back to cohort
Record W2130280189 · doi:10.1109/robot.1992.220295

Real-time multi-robot path planner based on a heuristic approach

2003· article· en· W2130280189 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsMcMaster University
Fundersnot available
KeywordsRobotComputer scienceHeuristicPath (computing)TrajectoryMotion planningRobot controlReal-time computingArm solutionCollisionSimulationCartesian coordinate robotArtificial intelligenceMobile robotOperating system

Abstract

fetched live from OpenAlex

The authors describe a real-time approach to solve the trajectory planning problem using the latest feedback of robot joint locations from robot controllers. The approach incorporates an efficient collision avoidance strategy to allow decisions to be made during execution by means of cylindrical robot link approximation. The developed algorithm has been verified with a dual-robot planning and control system for the mechanical assembly of a dish-washer power unit. The system consists of an ADEPTI and a PUMA 560 industrial robot running under the control of a Sun-4 Sparc 2 workstation at the high control level. A coarse motion planner is available to prevent the arm from colliding with stationary objects. In this dual-arm system, a task level multi-agent plan is generated to specify the logical sequence of assembly. From the execution results, it was found that even when the robot speed was varied from 25% to 80% of its full capacity, a collision-free path was found for each robot.< <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.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.093
Threshold uncertainty score0.877

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.001

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.026
GPT teacher head0.247
Teacher spread0.221 · 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

Quick stats

Citations28
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207