Deep Fusion of Kinematic Features and Task-Aware Partition Planning for Mold Surface Robotic Polishing

Robotic polishing in CAD-free industrial settings relies on point-cloud data, yet noise and non-uniform sampling often compromise kinematic feasibility and finishing quality. This paper proposes an adaptive motion planning approach with explicit kinematic constraints. A downsampling–clustering–mapping-back strategy is first employed for rapid workpiece extraction. Subsequently, an improved supervoxel representation and attributed adjacency graph (AAG) are developed, utilizing a multi-objective energy formulation to partition sub-regions that satisfy geometric consistency and kinematic reachability. To handle point-cloud noise, a lightweight neural network predicts scanning directions and step-distance coefficients, followed by thick-slice serpentine path generation. Finally, closed-loop verification ensures safety through inverse-kinematics and safety-margin checks. Experimental results demonstrate consistent sub-micron finishing quality, with Ra ≈ 0.6 μm on complex mold surfaces. Moreover, the proposed pipeline achieves a 7.5× preprocessing speedup, completing workpiece extraction in 1.14 s for a 237,640-point scan, and improves kinematic feasibility to 100% IK success while reducing the mean TCP normal deviation by ~76% compared with a PCA-based baseline.

Authors

Institutions

Publication Details

Journal
Machines
Published
2026-02-21
DOI
https://doi.org/10.3390/machines14020243
Primary Topic
Advanced Surface Polishing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deep Fusion of Kinematic Features and Task-Aware Partition Planning for Mold Surface Robotic Polishing

Miao Yu, Baowen He, Xu Liu, Zhen Pan
Machines
Advanced Surface Polishing Techniques
article

Deep Fusion of Kinematic Features and Task-Aware Partition Planning for Mold Surface Robotic Polishing

Miao Yu, Baowen He, Xu Liu, Zhen Pan
article en

Abstract

Robotic polishing in CAD-free industrial settings relies on point-cloud data, yet noise and non-uniform sampling often compromise kinematic feasibility and finishing quality. This paper proposes an adaptive motion planning approach with explicit kinematic constraints. A downsampling–clustering–mapping-back strategy is first employed for rapid workpiece extraction. Subsequently, an improved supervoxel representation and attributed adjacency graph (AAG) are developed, utilizing a multi-objective energy formulation to partition sub-regions that satisfy geometric consistency and kinematic reachability. To handle point-cloud noise, a lightweight neural network predicts scanning directions and step-distance coefficients, followed by thick-slice serpentine path generation. Finally, closed-loop verification ensures safety through inverse-kinematics and safety-margin checks. Experimental results demonstrate consistent sub-micron finishing quality, with Ra ≈ 0.6 μm on complex mold surfaces. Moreover, the proposed pipeline achieves a 7.5× preprocessing speedup, completing workpiece extraction in 1.14 s for a 237,640-point scan, and improves kinematic feasibility to 100% IK success while reducing the mean TCP normal deviation by ~76% compared with a PCA-based baseline.

MachinesVol. 14(2)
Changchun University (CN)
Openalex Percentile: Top 48%
Advanced Surface Polishing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Deep Fusion of Kinematic Features and Task-Aware Partition Planning for Mold Surface Robotic Polishing — Miao Yu, Baowen He, et al. · Machines (2026) | TGRS Research Map | TGRS