Quantum Particle Swarm Optimization (QPSO)-Based Enhanced Dynamic Model Parameters Identification for an Industrial Robotic Arm
Bibliographic record
Abstract
Accurate parameter identification in dynamic models of robotic arms is essential for performing high-performance control and energy-efficient procedures. However, classic methods often encounter difficulties when modeling nonlinear, high-dimensional systems, particularly in the presence of real-world uncertainties. To address these challenges, this study focuses on identifying mass center positions and inertia matrix elements in a six-jointed industrial robotic arm and comparing the influence of optimized algorithms: the classical Particle Swarm Optimization (PSO) and the Quantum-behaved Particle Swarm Optimization (QPSO). The robot’s kinematic model was validated by comparing it with actual motion data, utilizing a high-precision neural network to ensure accuracy before conducting a dynamic analysis. A comprehensive dynamic model was created using Computer-Aided Optimization (CAO) in SolidWorks Premium 2023 to simulate realistic mass parameters, thereby validating the model’s reliability in a practical setting. The real (Referenced) and optimized dynamic models of the robot arm were validated using trajectory tracking simulations under sliding mode control (SMC) to assess the impact of the optimized model on the robot’s performance metrics. Results indicate that QPSO estimates inertia and mass center parameters with Mean Absolute Percentage Errors (MAPE) of 0.76% and 0.43%, outperforming PSO significantly and delivering smoother torque profiles and greater resilience to external disturbances.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".