MétaCan
Menu
Back to cohort
Record W3008997385 · doi:10.1002/acs.3102

Adaptive finite‐time tracking control for robotic manipulators with funnel boundary

2020· article· en· W3008997385 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

VenueInternational Journal of Adaptive Control and Signal Processing · 2020
Typearticle
Languageen
FieldEngineering
TopicAdaptive Control of Nonlinear Systems
Canadian institutionsCarleton University
FundersFundamental Research Funds for the Central Universities
KeywordsFunnelBacksteppingControl theory (sociology)Overshoot (microwave communication)Settling timeBoundary (topology)Bounded functionController (irrigation)Tracking (education)Adaptive controlComputer scienceMathematicsEngineeringControl engineeringStep responseControl (management)Artificial intelligenceMathematical analysis

Abstract

fetched live from OpenAlex

Summary The finite‐time tracking control problem with the output‐constraint property of robotic manipulators subjected to system uncertainties is addressed. Specifically, the radial basis function neural network is employed to compensate for system uncertainties. The finite‐time stability theorem is used for the backstepping design process, by which the limit of the settling time is set. A funnel boundary is used to limit the output overshoot. The proposed controller guarantees that all the signals are semi‐globally practically finite‐time bounded, while the tracking errors are enveloped by the funnel boundary. The performance of the proposed control method is illustrated by a numerical simulation of a 3‐DOF manipulator. It is shown that the tracking errors are bounded by prescribed funnel boundaries. In the meantime, the manipulator is stabilized within a finite period of 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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.989
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.001
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.023
GPT teacher head0.228
Teacher spread0.205 · 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