A novel digital twins-driven mutual trust framework for human–robot collaborations
Bibliographic record
Abstract
Trust plays an important role and significantly influences human–robot collaborations (HRC). However, most previous research on trust only emphasizes the human attitude toward robots. There needs more understanding of human uncertainties that may also cause disruptions of trust in collaborations. This paper presents a novel mutual trust framework to provide a relatable vision for future development in HRC from an integrated perspective via the integration of human and robotic digital twins . More specifically, a comprehensive review of current trust research in HRC is first provided, including trust factors and state-of-the-art trust models. Second, a novel human–robot mutual trust framework based on 5-layer digital twins models is introduced. The mutual trust framework highlights the interactions amongst modules of artificial intelligence , simulation, and operation, which can provide wide services in HRC (e.g., task allocation and motion planning). A case study of solving a path planning problem is exemplified to evaluate the performance of the proposed mutual trust framework. Compared with singular trust models, the proposed framework enables robotic systems with real-time response and adaptation to human behavior. Some limitations and future work of the mutual trust framework are elaborated in the end.
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.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".