MétaCan
Menu
Back to cohort
Record W1971168253 · doi:10.1109/iros.2010.5652621

Path planning with variable-fidelity terrain assessment

2010· article· en· W1971168253 on OpenAlex
Braden Stenning, Tim Barfoot

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.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of CanadaCanadian Space Agency
KeywordsTerrainFidelityMotion planningComputer sciencePath (computing)Modular designChassisSimulationReal-time computingArtificial intelligenceRobotEngineeringGeographyAerospace engineeringTelecommunicationsCartography

Abstract

fetched live from OpenAlex

Terrain assessment and path planning are intrinsically linked. There exist a variety of terrain-assessment algorithms and these methods follow the trend of low-fidelity at low-cost and high-fidelity at high-cost. We present a modular path-planning algorithm that uses a hierarchy of terrain-assessment methods; from low-fidelity to high-fidelity. Using all the available sensor data, the visible terrain is assessed with the low-fidelity, low-cost method. The decision to assess a piece of terrain with the high-fidelity, high-cost method is made considering potential path benefits and the cost of assessment. The result is a lower combined cost of the path and terrain assessment that exploits the capabilities of the robot chassis where prudent. We demonstrate the technique on a large number of simulated path-planning problems using fractal terrain, as well as provide preliminary results from an experimental field test carried out on Devon Island, Canada.

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

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.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.015
GPT teacher head0.282
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

Citations4
Published2010
Admission routes3
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207