A Precisely Predefined-Time Convergent Barrier RNN for Collaborative Position and Orientation Control of Dual-Arm Robots Under Unknown Bounded Noise
Bibliographic record
Abstract
A novel collaborative position and orientation control scheme (CPOCS) for dual-arm robots is proposed, which is capable of controlling the end-effectors' positions with high precision while preserving their orientations unchanged to some practical tasks (e.g., box handling). To solve the proposed CPOCS in real time while considering key factors such as unknown bounded noise and strict time response constraints in practical engineering environments, this article proposes a novel precisely predefined-time convergent barrier recurrent neural network (PCB-RNN) based on a newly developed piecewise barrier evolution formula. Unlike existing RNNs, the proposed PCB-RNN, owing to its piecewise barrier evolution formula, can achieve precisely predefined-time convergence (PPTC) when addressing the proposed CPOCS under unknown bounded noise conditions. Comprehensive theoretical analysis rigorously proves the PPTC ability of the PCB-RNN under both noise-free and unknown bounded noise conditions. Furthermore, extensive simulation and physical experiments on dual-arm robots validate the effectiveness of the proposed CPOCS and demonstrate the advanced PPTC capability of the proposed PCB-RNN under unknown bounded noises.
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.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".