MétaCan
Menu
Back to cohort
Record W2071067499 · doi:10.1109/crv.2010.32

Rough Terrain Reconstruction for Rover Motion Planning

2010· article· en· W2071067499 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.
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 institutionsHydro-QuébecCanadian Space Agency
Fundersnot available
KeywordsTerrainComputer scienceComputer visionMotion planningBoundary (topology)Artificial intelligenceHausdorff distanceComputer graphics (images)Point (geometry)RobotTriangle meshRemote sensingGeologyGeographyGeometryMathematicsCartography

Abstract

fetched live from OpenAlex

A two-step approach is presented to generate a 3D navigable terrain model for robots operating in natural and uneven environment. First an unstructured surface is built from a 360 degrees field of view LIDAR scan. Second the reconstructed surface is analyzed and the navigable space is extracted to keep only the safe area as a compressed irregular triangular mesh. The resulting mesh is a compact terrain representation and allows point-robot assumption for further motion planning tasks. The proposed algorithm has been validated using a large database containing 688 LIDAR scans collected on an outdoor rough terrain. The mesh simplification error was evaluated using the approximation of Hausdorff distance. In average, for a compression level of 93.5%, the error was of the order of 0.5 cm. This terrain modeler was deployed on a rover controlled from the International Space Station (ISS) during the Avatar Explore Space Mission carried out by the Canadian Space Agency in 2009.

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

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.001
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.020
GPT teacher head0.273
Teacher spread0.252 · 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

Citations37
Published2010
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207