MétaCan
Menu
Back to cohort
Record W4404200251 · doi:10.23977/acss.2024.080617

Trajectory Planning of Rotor Welding Manipulator Based on an Improved Particle Swarm Optimization Algorithm

2024· article· en· W4404200251 on OpenAlexvenueno aff

Bibliographic record

VenueAdvances in Computer Signals and Systems · 2024
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsnot available
Fundersnot available
KeywordsParticle swarm optimizationRotor (electric)WeldingManipulator (device)Computer scienceSwarm behaviourTrajectoryMulti-swarm optimizationAlgorithmMathematical optimizationEngineeringMechanical engineeringArtificial intelligenceMathematicsRobotPhysics

Abstract

fetched live from OpenAlex

The rotor is the main core component of the powder separator, and the processing quality of the rotor directly affects the working efficiency of the separator and the operation safety of the separator, for the problems of unprotected welding quality of the rotor of the separator and high labor intensity of manual labor, for the problem of time-optimal trajectory planning of the welding robot, the welding robotic arm as the object of the study, using the D-H method of modeling and forward and inverse kinematics analysis. An improved particle swarm algorithm is proposed to optimize the trajectory of a spin-welding robot arm due to the inefficiency of traditional robot trajectory planning and unstable operation. The method effectively combines the 3-5-3 polynomial interpolation function with the improved algorithm using time as the fitness function. By comparing the traditional particle swarm algorithm, it is shown that the improved algorithm can be better applied to the time-optimal trajectory planning of the welding robot arm.

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.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.001
Research integrity0.0010.001
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.024
GPT teacher head0.288
Teacher spread0.264 · 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 designSimulation or modeling
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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueAdvances in Computer Signals and SystemsSame topicRobotic Path Planning AlgorithmsFrench-language works237,207