MétaCan
Menu
Back to cohort
Record W4409794807 · doi:10.61091/jcmcc127b-533

Design and research of a new high power railroad tie laser cutting robot

2025· article· en· W4409794807 on OpenAlexvenueno aff

Bibliographic record

VenueJournal of Combinatorial Mathematics and Combinatorial Computing · 2025
Typearticle
Languageen
FieldEngineering
TopicAdvanced Surface Polishing Techniques
Canadian institutionsnot available
FundersQilu University of Technology
KeywordsRobotPower (physics)LaserEngineeringMechanical engineeringElectrical engineeringComputer scienceArtificial intelligenceOpticsPhysics

Abstract

fetched live from OpenAlex

With the continuous improvement of positioning accuracy of high-power fiber lasers and industrial robots, the use of robots for laser processing has been widely applied in the field of industrial manufacturing.This article designs a laser cutting robot and control method, using ABB-IRB120 dual robotic arms, specifically applied to the cutting of railway sleeper steel bars.The robot vision system can automatically recognize the steel bars of railway sleepers, and the overall cutting process is controlled by a safe and reliable PLC.The follow-up system is controlled by STM32 and integrates a dual loop competition algorithm to establish a control model namely "feedforward compensation PID+sliding mode control".The visualization simulation experiment results of trajectory tracking analysis have verified that the model has the advantages of fast response and high control accuracy.The experimental results show that the robot can achieve high-speed, stable, and precise cutting of rail sleepers, and can meet the needs of cutting various types of rail sleeper steel bars.

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.004
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

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

Opus teacher head0.028
GPT teacher head0.312
Teacher spread0.284 · 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Combinatorial Mathematics and Combinatorial ComputingSame topicAdvanced Surface Polishing TechniquesFrench-language works237,207