A Neural Network Controller for a Class of Nonlinear Non-Minimum Phase Systems with Application to a Flexible-Link Manipulator
Bibliographic record
Abstract
This paper investigates the problem of controlling a nonlinear nonminimum phase system. An output re-definition strategy is first introduced to guarantee stable zero dynamics. This output re-definition scheme is applicable to a class of open-loop stable nonlinear systems whose input–output maps contain nonlinear terms in the output and linear terms in the input. No explicit knowledge about the nonlinearities of the system is required. The nonlinearities of the system are identified by a neural network. The identified neural network model is then used in modifying the zero dynamics of the system. A stable∕anti-stable factorization is performed on the zero dynamics of the system. The new output is re-defined using the neural identifier and the stable part of the zero dynamics. A controller is then designed based on the new output whose zero dynamics are stable and can be inverted. An experimental setup of a single-link flexible manipulator is considered as a practical case study of a nonlinear nonminimum phase system. Experimental results are presented to illustrate the advantages and improved performance of the proposed tracking controller over both linear and nonlinear conventional controllers in the presence of unmodeled dynamics and parameter variations.
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.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".