MétaCan
Menu
Back to cohort

Intelligent Path Planning and Following for UAVs in Forest Surveillance and Fire Fighting Missions

2018· article· en· W3009043760 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

Venue2018 IEEE CSAA Guidance, Navigation and Control Conference (CGNCC) · 2018
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsConcordia University
Fundersnot available
KeywordsMotion planningTerrainComputer sciencePath (computing)Task (project management)Field (mathematics)FirefightingReal-time computingPlan (archaeology)Curse of dimensionalitySimulationArtificial intelligenceRobotEngineeringSystems engineering

Abstract

fetched live from OpenAlex

As a flexible, efficient, and powerful platform for a variety of practical applications, the unmanned aerial vehicle (UAV) has attracted increasing attention in the field of forest fire monitoring, detection, and tracking in recent years. In forest surveillance and fire fighting missions, threats may occur when a UAV is assigned to fly over a forest area, as statical obstacles like hills may stand between the base and the fire spot, and dynamic obstacles like birds may appear during the flight. To deal with these challenges, a path planning algorithm that can learn the terrain environment and generate the motion policy to plan an optimal path is developed. A hierarchical structure is adopted for path planning to achieve the optimal result in a global manner, as well as avoid the curse of dimensionality. Moreover, an intelligent path following algorithm that can perceive and avoid dynamic obstacles is also developed for the UAV to accomplish the task safely. Numerical simulations are conducted to validate the proposed algorithms.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.941
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.032
GPT teacher head0.290
Teacher spread0.259 · 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