MétaCan
Menu
Back to cohort
Record W2050859889 · doi:10.1109/icinfa.2013.6720493

Development of isomorphic master-slave robots with modular method

2013· article· en· W2050859889 on OpenAlexaff
Zhifang Zheng, Yisheng Guan, Manjia Su, Pinhong Wu, Jie Hu, Xuefeng Zhou, Hong Zhang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicModular Robots and Swarm Intelligence
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMaster/slaveModular designRobotFlexibility (engineering)Computer scienceAdaptabilitySelf-reconfiguring modular robotSoftwareControl engineeringRobot controlMobile robotArtificial intelligenceEngineeringProgramming languageOperating systemMathematics

Abstract

fetched live from OpenAlex

Developed with traditional method, most of the current existing master robots lack of sufficient flexibility and high adaptability to the slave robots, since their structure and degrees of freedom cannot be modified according to those of the slaves. To overcome these shortcomings with the existing master robots, we propose a novel master robot developed with modular method. With the modular approach, it is trivial to build isomorphic master-slave robots according to different tasks. For such isomorphic systems, the mapping between the master and the slave is one-to-one owing to their same configurations, which leads to simple, intuitive and stable control of the slave. In this paper, we introduce the development of the master-slave robotic system, focusing on the design method, the mechanical system, the control system including the hardware and software of the modules, and the communication between the master and slave. An experiment with the master-slave system performing a manipulation task in practice is carried out to illustrate the effectiveness of the presented modular method and the built master-slave system.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.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.023
GPT teacher head0.215
Teacher spread0.192 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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".

Quick stats

Citations6
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicModular Robots and Swarm IntelligenceFrench-language works237,207