MétaCan
Menu
Back to cohort
Record W2108189350 · doi:10.1109/iscas.2009.5117713

Cooperative path planner for UAVs using ACO algorithm with Gaussian distribution functions

2009· article· en· W2108189350 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 institutionsUniversity of Calgary
Fundersnot available
KeywordsPlannerAnt colony optimization algorithmsComputer scienceDronePath (computing)Motion planningGaussianReal-time computingRobotArtificial intelligenceComputer network

Abstract

fetched live from OpenAlex

Unmanned aerial vehicles (UAVs) are remote controlled or autonomous air vehicles. An UAV can be equipped with various types of sensors to perform life rescue missions or it can be armed with weapons to carry out stealthy attack missions. With the unmanned nature of UAVs, a mission can be taken in any hostile environment without risking the life of pilots. Among life rescue missions, the common objective is often defined as maximizing the total coverage area of the UAVs with the limited resources. When the number of UAVs increases, coordination among these UAVs becomes very complicated even for experienced pilots. In this paper, a cooperative path planner for UAVs is proposed. The path of each UAV is represented by a B-spline curve with a number of control points. The positions of these control points are optimized using an ant colony optimization algorithm (ACO) such that the total coverage of the UAVs is maximized.

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.804
Threshold uncertainty score0.572

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.021
GPT teacher head0.264
Teacher spread0.243 · 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

Citations28
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207