MétaCan
Menu
Back to cohort
Record W2330019931 · doi:10.2514/6.2008-6836

A Dynamic Path Generation Method for a UAV Swarm in the Urban Environment

2008· article· en· W2330019931 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

VenueAIAA Guidance, Navigation and Control Conference and Exhibit · 2008
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsKootenay Association for Science & Technology
FundersArmy Research Office
KeywordsSwarm behaviourComputer sciencePath (computing)Artificial intelligenceComputer network

Abstract

fetched live from OpenAlex

In this paper, a dynamic path planning method for swarming of unmanned aerial vehicles (UAVs) in the urban environment is presented. For the missions of a team of UAVs in a complex environment, conflict-free paths for all vehicles should be calculated dynamically in real-time using the latest information on the changes in the surroundings such as pop-up threats. Therefore, we propose a hierarchical dynamic path planner that consists of a offline path planning and a real-time model predictive trajectory generator. In this framework, many existing and proven off-line algorithms can be deployed for globally optimal path planning. The pre-computed trajectory is sent to the model predictive layer, which generates locally feasible trajectory free from conflicts. In this manner, each vehicle is able to fly along its designated path to reach the destination while avoiding obstacles or vehicles in collision path with minimal deviation from the designated path. For validation, the proposed algorithm is applied to a deployment scenario of sixteen rotary-wing UAVs flying in a cluttered urban area and showed a satisfactory performance. I.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.971
Threshold uncertainty score0.463

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.025
GPT teacher head0.261
Teacher spread0.237 · 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