Dynamic Path Tracking of Industrial Robots With High Accuracy Using Photogrammetry Sensor
Bibliographic record
Abstract
In this paper, a practical dynamic path tracking (DPT) scheme for industrial robots is presented. The DPT scheme is a position-based visual servoing to realize three-dimensional dynamic path tracking by correcting the robot movement in real time. In the traditional task-implementation mode for industrial robots, the task planning and implementation are taught manually and hence the task accuracy largely depends on the repeatability of industrial robots. The proposed DPT scheme can realize automatic preplanned task and improve the tracking accuracy with eye-to-hand photogrammetry measurement feedback. Moreover, an adaptive Kalman filter is proposed to obtain smooth pose estimation and reduce the influence caused by image noise, vibration, and other uncertain disturbances. Due to high repeatability of the photogrammetry sensor, the proposed DPT scheme can achieve a high path tracking accuracy. The developed DPT scheme can be seamlessly integrated with the industrial robot controller and improve the robot's accuracy without retrofitting with high-end encoder. By using C-track 780 from Creaform as the photogrammetry sensor, the experimental tests on Fanuc M20-iA with the developed DPT scheme demonstrate the tracking accuracy is significantly improved (±0.20 mm for position and ±0.10 deg for orientation).
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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".