Hole-finding learning Strategy for a Robot Assembly with Keyed Circular Peg
Taking the gear assembly of the reducer assembly line as a research background, the hole-finding strategy for robot assembly with keyed circular pegs is proposed to solve the problem of low hole-finding efficiency and success rate. in the circular hole-finding task, deviation domains were divided ba...
Gespeichert in:
Veröffentlicht in: | IEEE access 2023-01, Vol.11, p.1-1 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Taking the gear assembly of the reducer assembly line as a research background, the hole-finding strategy for robot assembly with keyed circular pegs is proposed to solve the problem of low hole-finding efficiency and success rate. in the circular hole-finding task, deviation domains were divided based on a static mechanism, position vector trajectory optimization in the step distance and direction was designed, and a deviation domain-force mapping relationship was established using a genetic algorithm-support vector machine (GA-SVM) classification algorithm; the accuracy of this algorithm is approximately 90.00%. Thirty groups completed the circular hole-finding task in an average time of 5.4 s. For the square hole-finding task, dual monocular cameras were integrated to identify corner points of the flat key and keyway. Image semantic segmentation based on deep learning was used for the corner-point recognition of the flat key to suppress the effect of changes in light intensity; the recognition has an average error of 0.39 mm. Coarse and fine adjustment circumferential deflection strategies were adopted sequentially. The 30 groups of square hole-finding tasks exhibited a 96.70% success rate in an average time of 10.2 s. The proposed hole-finding strategy improves the efficiency and success rate of the gear assembly. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2023.3251381 |