MétaCan
Menu
Back to cohort
Record W2108933417 · doi:10.1109/icassp.2006.1660874

A Stochastic Search Approach for UAV Trajectory Planning In Localization Problems

2006· article· en· W2108933417 on OpenAlex
Farhad Ghassemi, Vikram Krishnamurthy

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
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsTrajectoryTrajectory optimizationComputer scienceSet (abstract data type)Mathematical optimizationScalingTransformation (genetics)Invariant (physics)Line (geometry)Control theory (sociology)Line searchMathematicsOptimal controlArtificial intelligenceControl (management)PhysicsGeometry

Abstract

fetched live from OpenAlex

We discuss the off-line and on-line aspects of trajectory planning in bearings-only localization. Assuming that there are m(ges 1) moveable sensors (e.g. UAVs), which fly in closed trajectories, the aim is to determine the optimal shape of the trajectory. We investigate the properties of closed optimal trajectories in the off-line problem and show that these solutions are invariant under a scaling transformation of the problem parameters. This result is used to numerically derive a set of solutions for the normalized parameters. These solutions are then used in a stochastic search algorithm which randomly explores the trajectories but spends the largest amount of time in the optimal trajectory

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.810
Threshold uncertainty score0.356

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.031
GPT teacher head0.257
Teacher spread0.226 · 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