MétaCan
Menu
Back to cohort
Record W2790330769 · doi:10.1109/robio.2017.8324618

Teleoperation of multiple cooperative slave manipulators using graph-based non-singular terminal sliding-mode control

2017· article· en· W2790330769 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsDalhousie University
Fundersnot available
KeywordsControl theory (sociology)Terminal sliding modeTeleoperationNonlinear systemComputer scienceSynchronization (alternating current)InterconnectionGraphBounded functionSliding mode controlControl engineeringRobotControl (management)EngineeringMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, a new framework of nonlinear single-master-multiple-slave (SMMS) manipulator system is proposed for the cooperative tasks with interconnection time delays. This networked system allows a master manipulator to remotely control a manipulator that serves as the leader of a group of followers. The graph-based non-singular terminal sliding-mode (G-NTSM) method is used to design controllers for the bilateral teleoperative subsystem and leader-following cooperative subsystem. Tracking synchronization with time delays can be achieved while the leader is with time-varying velocity and only globally reachable in a directed graph. Simulation results of a team of two degree-of-freedom (DOF) manipulators show that the designed controllers can ensure the bounded tracking errors, and the resultant overall multi-manipulator system is stable.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.790
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.029
GPT teacher head0.286
Teacher spread0.258 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations8
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Control Multi-Agent SystemsFrench-language works237,207