MétaCan
Menu
Back to cohort
Record W2106690144 · doi:10.1109/ssrr.2005.1501252

Navigation of unmanned vehicles using a swarm of intelligent dynamic landmarks

2005· article· en· W2106690144 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRobotComputer scienceArtificial intelligenceTask (project management)Computer visionPosition (finance)Swarm behaviourProcess (computing)Mobile robotHuman–computer interactionEngineering

Abstract

fetched live from OpenAlex

The work presented here describes a novel 3D navigation method for teams of unmanned vehicles using intelligent dynamic landmarks (IDLs). The technique allows robots to navigate in diverse structured and unstructured environments both indoor and outdoor avoiding typical disadvantages of traditional navigational techniques. Some robots comprising the team are considered as IDLs while others use such landmarks to accomplish their task. The proposed approach does not require any type of traditional external landmarks or any kind of environmental model. Instead, robots continuously perform direct measurements of their relative position with respect to neighboring robots with which they interchange relative position information to verify relative and global localization. Robots process the obtained information to generate ego-centric estimates of the relative position of other robots using an origami graph. The proposed technique allows the team's configurations to change according to the task to be performed and allows effective navigation even under robots' mechanical and/or sensor failures.

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.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.292
Threshold uncertainty score0.266

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.021
GPT teacher head0.288
Teacher spread0.267 · 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

Citations3
Published2005
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207