MétaCan
Menu
Back to cohort
Record W3191656955 · doi:10.1109/icc42927.2021.9500370

Simple and Efficient Algorithm for Drone Path Planning

2021· article· en· W3191656955 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsWestern University
Fundersnot available
KeywordsDroneMotion planningComputer scienceSoftware deploymentPath (computing)Travelling salesman problemComputationMetric (unit)Energy consumptionReal-time computingTask (project management)Simple (philosophy)AlgorithmArtificial intelligenceEngineeringRobotComputer networkOperations managementSystems engineering

Abstract

fetched live from OpenAlex

Unmanned aerial vehicles, or drones, have gained a lot of popularity due to their large number of applications in surveillance, aerial photography, 3D mapping, search and rescue operations, and shipping and delivery of goods. A critical task in the deployment of drones is the computation of effective flying paths that allow drones to reach their destinations while avoiding obstacles and minimizing the amount of energy that they need to consume. We present a novel path planning algorithm that is not only faster and uses less memory than other existing path planning algorithms, but it also produces shorter paths. All these performance metric improvements lead to a more energy efficient path planning algorithm for autonomous drones.

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.952
Threshold uncertainty score0.436

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.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.022
GPT teacher head0.274
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

Citations5
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207