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 OpenAlexafffundabout
Braden Stenning, Tim Barfoot

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations4
Published2010
Admission routes3
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207