MétaCan
Menu
Back to cohort
Record W1991234588 · doi:10.1115/dscc2010-4039

Tracking Control of Flexible Ball Screw Drives With Runout Effect Compensation

2010· article· en· W1991234588 on OpenAlexaff
Mohammad Sepasi, Farrokh Sassani, Ryozo Nagamune

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIterative Learning Control Systems
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsBall screwControl theory (sociology)Ball (mathematics)MachiningMachine toolTracking errorComputer scienceControl engineeringTracking (education)EngineeringMechanical engineeringArtificial intelligenceMathematicsControl (management)

Abstract

fetched live from OpenAlex

Most machine tools rely on precision ball screw drives to accurately position the workpiece relative to the tool. In terms of the performance of such machines, tracking is one of the most important aspects that significantly affects the machining outcomes. Minimizing tracking errors of a flexible ball screw drive in the presence of runout phenomenon is explained in this paper. To achieve small tracking errors, the flexibility and runout are modeled by a linear parameter varying system. Based on the derived model, gain scheduling tracking controllers with parameter-dependent Lyapunov functions are designed. The efficiency of the designed controllers in minimizing the tracking error, as well as the importance of the runout modeling, is demonstrated on a ball screw drive experimental setup.

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.000
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.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.000
Open science0.0010.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.003
GPT teacher head0.198
Teacher spread0.194 · 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

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207