Improving Tracking Performance of Nonlinear Uncertain Bilateral Teleoperation Systems With Time-Varying Delays and Disturbances
Bibliographic record
Abstract
In this article, an adaptive nonsingular terminal sliding-mode (ANTSM) method is proposed for the motion tracking control of a bilateral teleoperation system. Efforts in this article seek to improve the position tracking performance of nonlinear systems subject to time-varying network delays, parametric uncertainties, and unknown external disturbances and frictions. Another issue addressed in this article is the common delay-induced phase shift of tracking profiles in many control methods, which is greatly reduced by introducing a novel mixed type of feedback signals in the ANTSM control design. Furthermore, the proposed adaptive control design with two online-estimated compensatory bounds removes the requirement of exact knowledge of network delays and disturbance bounds as a prior. In the master side, a force predictor is used to estimate the current environmental force for the reference signal generator. Therefore, the direct transmission of force signals is avoided. By comparing with the existing model-based and model-free methods, numerical simulation results with six-degree-of-freedom manipulators illustrate the merits of the developed robust and adaptive controllers. Experimental results with two Phantom Omni devices are also provided to demonstrate the effectiveness and the significant performance improvements of the proposed controllers.
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.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".