MétaCan
Menu
Back to cohort
Record W2119394765 · doi:10.1109/taes.2012.6324664

Flatness-Based Trajectory Planning/Replanning for a Quadrotor Unmanned Aerial Vehicle

2012· article· en· W2119394765 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

VenueIEEE Transactions on Aerospace and Electronic Systems · 2012
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsDefence Research and Development CanadaConcordia University
Fundersnot available
KeywordsActuatorControl theory (sociology)TrajectoryFlatness (cosmology)Trajectory optimizationEngineeringMotion planningControl engineeringComputer scienceControl (management)RobotArtificial intelligencePhysics

Abstract

fetched live from OpenAlex

A flatness-based flight trajectory planning/replanning strategy is proposed for a quadrotor unmanned aerial vehicle (UAV). In the nominal situation (fault-free case), the objective is to drive the system from an initial position to a final one without hitting the actuator constraints while minimizing the total time of the mission or minimizing the total energy spent. When actuator faults occur, fault-tolerant control (FTC) is combined with trajectory replanning to change the reference trajectory in function of the remaining resources in the system. The approach employs differential flatness to express the control inputs to be applied in the function of the desired trajectories and formulates the trajectory planning/replanning problem as a constrained optimization problem.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.918
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.025
GPT teacher head0.272
Teacher spread0.247 · 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