MétaCan
Menu
Back to cohort
Record W2312336630 · doi:10.2514/6.2011-6295

Persistent Tracking using Unmanned Aerial Vehicle: A Game Theory Method

2011· article· en· W2312336630 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 · 2011
Typearticle
Languageen
FieldEngineering
TopicGuidance and Control Systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceTracking (education)Computer visionArtificial intelligenceGame theoryAeronauticsEngineeringMathematicsMathematical economics

Abstract

fetched live from OpenAlex

Persistent tracking is of vital importance to a broad range of unmanned aerial vehicle (UAV) missions such that persistent observation and surveillance are indispensable for obtaining uninterrupted measurements of targets of interest. This paper studies the problem of persistent tracking, the goal of which is to design a control strategy for a UAV to keep a moving target in its detection zone, regardless of the target motion. In this paper, persistent tracking problem is formulated in the framework of pursuit-evasion game theory. A bounded and closed region around the UAV in which persistent tracking is feasible is determined rst in this framework. A switching tracking algorithm for the UAV to achieve persistent tracking is then formulated. Simulation results are presented to demonstrate the performance of the proposed tracking algorithm.

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: Empirical
Teacher disagreement score0.876
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.0010.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.031
GPT teacher head0.242
Teacher spread0.212 · 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