RBFNN-Based Adaptive Sliding Mode Control Design for Delayed Nonlinear Multilateral Telerobotic System With Cooperative Manipulation
Bibliographic record
Abstract
Multilateral telerobotic system has potential applications in the industry environments with the advantages of cooperative manipulation for the remote and hazardous tasks, and its control design is quite challenging due to several coupling issues such as stability, position tracking, force feedback, and cooperative manipulation under time delays, various uncertainties, and external disturbance. In this paper, a novel radial basis function neural network (RBFNN) based adaptive sliding mode control design is proposed for nonlinear multilateral telerobotic system with n-master-n-slave manipulators. The environment force is modeled with a general form via the RBFNN-based environment parameters estimation in the slave side. The estimated environment parameters (nonpower signals) are transmitted to rebuild the environment dynamics in the master side and provide the good force feedback for the human operators. The RBFNN-based adaptive sliding mode controllers are designed separately for master and slave manipulators to achieve good position tracking under parameter variations and external disturbance. The coordinated force distribution algorithm is designed to achieve cooperative manipulation with the balance of force acting on the target object. The theoretical analysis is given and the comparative experiment for a nonlinear multilateral telerobotic system with 2-master-2-slave manipulators is implemented. The results show the good performance of our design.
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.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".