MétaCan
Menu
Back to cohort
Record W4310607898 · doi:10.1002/9781119808602.ch9

An Application to Low‐level Control of Quadrotors

2022· other· en· W4310607898 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
Typeother
Languageen
FieldComputer Science
TopicAdaptive Dynamic Programming Control
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer sciencePosition (finance)Control (management)Stability (learning theory)Sequence (biology)Control engineeringControl theory (sociology)Artificial intelligenceEngineeringMachine learning

Abstract

fetched live from OpenAlex

This chapter presents a case study on the structured online learning (SOL)-based control of quadrotors. For an effective fly of the quadrotor, there are two levels of controls involved: the low-level control that is required for the stability of the hovering position, and the high-level control that provides a sequence of setpoints as commands to achieve a particular objective. To improve the runtime results of the learning, the chapter implements SOL with the recursive least squares algorithm that is more suitable for online applications. The simulation results, illustrates rapid and efficient learning, where an initial model is obtained by random preruns and then the model was improved within different runs in a closed-loop form. Based on the flight data and runtime results, the approach can be employed to automate the control of the quadrotor.

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: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.726
Threshold uncertainty score0.794

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.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.008
GPT teacher head0.250
Teacher spread0.242 · 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

Citations0
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicAdaptive Dynamic Programming ControlFrench-language works237,207