MétaCan
Menu
Back to cohort
Record W1542367368 · doi:10.1109/icra.2015.7139606

Fractal trajectories for online non-uniform aerial coverage

2015· article· en· W1542367368 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
KeywordsComputer scienceMotion planningTrajectoryTerrainSampling (signal processing)FractalTask (project management)Path (computing)RobotComputer visionArtificial intelligenceReal-time computingMathematicsGeographyEngineeringCartography

Abstract

fetched live from OpenAlex

We propose a novel method for non-uniform terrain coverage using Unmanned aerial vehicles (UAVs). The existing methods for coverage path planning consider a uniformly interesting target area and hence all the regions are covered with high resolution. However in many real world applications items of interest are not uniformly distributed but form patches of locally high interest. Therefore, with sparse sampling of uninteresting sections of the environment and high resolution sampling of interesting patches, the trajectory of the robot can become shorter. In this paper, we present a novel coverage strategy based on Space-Filling Curves that can accomplish non-uniform coverage of regions in the target area. Simulations and real robot experiments indicate that with the new strategy, travel time / cost of the task can be (almost) always less than a 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.890
Threshold uncertainty score0.452

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.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.039
GPT teacher head0.287
Teacher spread0.248 · 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

Citations61
Published2015
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207