Neuro-Fuzzy Controller Based on Model Predictive Control for a Nonlinear Underactuated Mechanical System
Bibliographic record
Abstract
Fuzzy Logic Control (FLC) has been viewed as an effective feedback approach that simplifies the mathematical burden when developing complex control systems. The rationale of FLC is the digital implementation of “human-like” control rules provided either by experience or by an expert agent. Unfortunately, for high-precision control applications, FLC has proved difficult to identify an appropriate set of such rules. This drawback was compensated by the emergence of Neuro-FLC techniques based on artificial neural networks. Neuro-FLC has therefore focused on self-learning inference methodologies in which the required rules (and fuzzy sets) have been determined automatically. Despite some attractive features, many self-learning approaches present significant challenges when the hardware implementation is resource-constrained. One such challenge relates to what has been called the rule explosion problem: this describes the fact that FLC inference methodologies tend to create very large rule sets for multivariable control systems. Therefore, this paper proposes a Neuro-FLC based on a sub-cluster rule reduction in order to implement the algorithm on a resource constrained embedded system (e.g., ARM Microntroller). The Neuro-FLC technique learns from a Model Predictive Algorithm (MPC) and it is implemented for controlling an underacuated nonlinear mechanical system. The algorithm proposed is capable of deploying the optimal energy to the system that guarantees stability while the performance related to the time-response can be safely chosen by the user.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".