Pose Synchronization of Multiple Networked Manipulators Using Nonsingular Terminal Sliding Mode Control
Bibliographic record
Abstract
Common assumptions in most of the previous nonlinear networked leader–follower systems are that the leader is provided as a constant signal and that the controllers are designed for either the joint-space regulation or the translational Cartesian-space motion control. This article addresses the control issue of the delay-induced horizontal shift effect when the leader is moving with a changing speed. A novel mixed-type feedback is introduced to reduce the horizontal shift effect so as to minimize tracking errors experienced by the follower agents. In this article, we also study the complete pose control using a nonsingular terminal sliding mode (NTSM) method. A stability analysis is provided to prove the finite-time boundedness of the tracking error signals. Quantitative evaluations of the multiple effects on the error bound are conducted to facilitate the subsequent control design to improve the performance. Numerical simulation results of a team of two degree-of-freedoms (DOFs) manipulators demonstrate the improved tracking performance of the end effectors with small bounded errors which are affected by network delays, maximum assigned accelerations, and the selection of control gains. The experimental results are provided to demonstrate the performance of the developed controller.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".