RBF-Neural-Network-Based Adaptive Robust Control for Nonlinear Bilateral Teleoperation Manipulators With Uncertainty and Time Delay
Bibliographic record
Abstract
The bilateral teleoperation system has raised expansive concern as its excellent behaviors in executing the tasks in the remote, unstructured, and dangerous areas via the cooperative operation systems. In this article, an radial basis function (RBF) neural network based adaptive robust control design is proposed for nonlinear bilateral teleoperation manipulators to cope with the main issues including the communication time delay, various nonlinearities, and uncertainties. Specifically, the slave environmental dynamics is modeled by a general RBF neural network, and its parameters are estimated and then transmitted for the environmental torque reconstruction in the master side. Since the parameters of the neural network (which are nonpower signals) are transmitted instead of the traditional environmental torque in the communication channel, the previous existing passivity problem under time delay is avoided. In both of master and slave sides, the trajectory creators are applied to generate the desired trajectories, and the RBF-neural-network-based adaptive robust controllers are designed subsequently to handle the nonlinearities and uncertainties. Theoretically, the proposed control algorithm can guarantee the global stability of bilateral teleoperation manipulators under time delay, and the good transparency performance with both position tracking and force feedback is also achieved simultaneously. The real platform comparative experiments are carried out, and the results show the good position tracking to execute precise operation and the good force feedback to detect the sudden disturbance in the environment dynamics.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".