MétaCan
Menu
Back to cohort
Record W2003323955 · doi:10.1109/ijcnn.2007.4370928

Pitch Control of an Aircraft with Aggregated Reinforcement Learning Algorithms

2007· article· en· W2003323955 on OpenAlexaff
Ju Jiang, Mohamed S. Kamel

Bibliographic record

VenueIEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · 2007
Typearticle
Languageen
FieldComputer Science
TopicAdaptive Dynamic Programming Control
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsReinforcement learningComputer scienceCerebellar model articulation controllerController (irrigation)AerodynamicsControl theory (sociology)Control systemPitch controlControl engineeringControl (management)Adaptive controlArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

Pitch control is a basic function of an Automatic Flight Control System (AFCS). Due to the complexity of problems, stochastic behavior, and the disturbing of the environment, traditional techniques, such as, linear feedback control, quantitative feedback theory, and adaptive control, which are all based on the explicit aerodynamic model of an aircraft, are not efficient in designing pitch controllers. This paper adopts multiple Reinforcement Learning (RL) algorithms and Cerebellar Model Articulation Controller (CMAC) techniques to design a pitch controller. In order to improve learning and control performances, a learn system named "Aggregated Multiple Reinforcement Learning System (AMRLS)" is proposed, which combines the outcomes of individual RL algorithms by using several aggregation methods. The goal of this paper is to demonstrate that the improved RL based control technology can be applied effectively to pitch control 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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.000
Open science0.0010.001
Research integrity0.0010.001
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.037
GPT teacher head0.299
Teacher spread0.262 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations9
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueIEEE International Conference on Neural Networks/IEEE ... International Conference on Neural NetworksSame topicAdaptive Dynamic Programming ControlFrench-language works237,207