MétaCan
Menu
Back to cohort
Record W2011432612 · doi:10.1109/iros.2014.6942790

Recursive non-uniform coverage of unknown terrains for UAVs

2014· article· en· W2011432612 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 institutionsSimon Fraser University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsTraverseComputer scienceTerrainCover (algebra)Tree (set theory)Motion planningPath (computing)Sample (material)Artificial intelligenceRobotMathematicsGeographyComputer networkCartographyEngineering

Abstract

fetched live from OpenAlex

Area coverage is one of the compelling applications of UAVs. The existing methods for coverage path planning assume a uniformly interesting target area. However in many real world applications items of interest are not uniformly distributed but form clusters. Here it can be advantageous to only sample regions of interest while skipping uninteresting sections of the environment. In this paper, we present a coverage tree structure that can accommodate non-uniform coverage of regions in the target area. Three strategies are proposed to traverse the coverage tree. Experiments indicate that in some situations our method can cover the interesting regions with about half the travel time / cost of a naive regular `lawnmower' coverage pattern.

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.946
Threshold uncertainty score0.374

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.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.014
GPT teacher head0.251
Teacher spread0.238 · 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

Citations36
Published2014
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207