MétaCan
Menu
Back to cohort
Record W3161575624 · doi:10.1109/lcsys.2021.3078809

Nonlinear MPC Without Terminal Costs or Constraints for Multi-Rotor Aerial Vehicles

2021· article· en· W3161575624 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Control Systems Letters · 2021
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsMemorial University of Newfoundland
FundersNatural Sciences and Engineering Research Council of CanadaMemorial University of Newfoundland
KeywordsControl theory (sociology)ComputationTerminal (telecommunication)Model predictive controlNonlinear systemConvergence (economics)Scheme (mathematics)Rotor (electric)Stability (learning theory)Computer scienceSequence (biology)HorizonMathematical optimizationEngineeringMathematicsControl (management)Algorithm

Abstract

fetched live from OpenAlex

This letter proposes a novel NMPC for multi-rotor aerial vehicles which is designed without stabilizing terminal costs or constraints in its cost function for stabilization. A growth bound sequence is derived from a tailored running cost to ensure the closed-loop stability and provide a measure of the performance of the proposed NMPC scheme. Furthermore, it facilitates the computation of a stabilizing prediction horizon that guarantees the asymptotic stability of the system. The performance of the proposed scheme is investigated through two sets of numerical simulations and compared against the traditional NMPC scheme for the application as proposed in (Kamel et al., 2017). The results show superior performance of the proposed NMPC scheme in terms of tracking accuracy, convergence rate, and computation time.

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 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: none
Teacher disagreement score0.935
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.017
GPT teacher head0.253
Teacher spread0.236 · 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