Bibliographic record
Abstract
This thesis presents practical methods for planning and control to improve the motion performance of industrial robots. Particular attention is given to the commercial six degrees-of-freedom articulated robot with a low-cost generic controller. A comparative study of motion control methods demonstrated that both smooth trajectory planning and filtering techniques, when combined with a traditional Proportional-Derivative control, are limited in achievable performance due to reduced accelerations (smooth trajectory) or large path-distortions (filtering technique). Instead, faster and more accurate motion is achieved with a low-order trajectory, namely, trapezoidal velocity profile, with feedforward control design based on an elastic model. The key component that makes the latter approach more appealing is the delay-free dynamic input shaper embedded in the feedforward control. Following the results from the comparative study, two innovations are proposed to satisfy the path-invariant and time-optimal motion. First, an online time-optimal trapezoidal velocity profile planned along multiple path segments is presented. The trajectory can be planned for arbitrary boundary conditions and path curvatures with only four system-dynamics computations per path segment. Next, a novel control method based on the flexible joint dynamic model is proposed to achieve high tracking performance for the proposed trajectory. The proposed nonlinear multivariable control can place the closed-loop poles arbitrarily with only position and velocity feedback. Real-world experiments with commercial industrial robots are carried out to validate the presented methods.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".