Adaptive Neural Network‐Based Backstepping Control of BLDC‐Driven Robot Manipulators: An Operational Space Approach with Experimental Validation
Bibliographic record
Abstract
ABSTRACT This study concentrates on end effector tracking control of robotic manipulators actuated by brushless direct current (BLDC) motors, having parametric uncertainties in their kinematic, dynamical and electrical sub‐systems. Specifically, an operational space controller formulation is proposed that does not rely on inverse kinematics calculations at position level and still ensures practical end effector tracking despite the presence of uncertainties related to the mechanical and electrical dynamics, and the kinematics of the robotic manipulator. Compensation for the uncertainties throughout the entire system is achieved via the use of neural network‐based dynamical adaptations, and the overall stability of the closed‐loop system is guaranteed via Lyapunov‐based arguments. We would like to note that the work addresses the following problems: (i) incorporation of actuator dynamics into the error system in order to achieve increased efficiency, (ii) elimination of the need for position level inverse kinematics calculations for the controller formulation to remove the computational burden and (iii) compensation of the uncertainties throughout the entire subsystem. Experiment studies were carried out on a two degree of freedom planar robot manipulator equipped with BLDC motors to evaluate the effectiveness of the proposed formulation.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 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.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".