A Wavelet Neural Network-Based NARMA-L2 Feedforward Controller Using Genetic Algorithms to Control Nonlinear Systems
Bibliographic record
Abstract
As a powerful nonlinear control design strategy, feedback linearization provides viable design tools for a wide range of nonlinear systems. This paper presents an intelligent feedback linearization design using the inverse feedforward control (IFC) scheme to control nonlinear dynamical systems. Particularly, the nonlinear autoregressive moving average (NARMA-L2) network is trained to reproduce the controlled system's forward dynamics. Consequently, the trained NARMA-L2 network can be directly employed in the IFC structure. To enhance the approximation ability of the NARMA-L2 structure, two wavelet neural networks (WNNs) are utilized to constitute the NARMA-L2 controller. Moreover, the RASP1 function was utilized as the mother wavelet function instead of the commonly employed Mexican hat function. To avoid the limitations of the gradient descent (GD) methods, the genetic algorithm has been used as the training method to optimize the NARMA-L2 inverse controller parameters. The simulation results showed that the proposed controller was effective in terms of precise control and robustness against external disturbances. Furthermore, a comparison study with other control structures revealed that the control results of the proposed WNN-based NARMA-L2 controller with the RASP1 function are superior to those of the WNN-based NARMA-L2 with the Mexican hat function, the multilayer perceptron (MLP)-based NARMA-L2 controller, and the PID controller.
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.000 | 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".