Rationality optimization of tool path spacing based on dwell time calculation algorithm

With the aim to achieve the dwell time calculation and the optimization of tool path planning in optical figuring, an improved algorithm is proposed and experimentally validated. Firstly, the principle of the algorithm is introduced, of which tool path planning is added. After that, a two-part simul...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of advanced manufacturing technology 2016-06, Vol.84 (9-12), p.2055-2065
Hauptverfasser: Pan, Ri, Zhang, Yajun, Ding, Jianbiao, Cao, Cong, Wang, Zhenzhong, Jiang, Tao, Peng, Yunfeng
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:With the aim to achieve the dwell time calculation and the optimization of tool path planning in optical figuring, an improved algorithm is proposed and experimentally validated. Firstly, the principle of the algorithm is introduced, of which tool path planning is added. After that, a two-part simulation is conducted. In the first part, the high convergence accuracy of the proposed algorithm is verified. And it also reveals that although the convergence accuracy of the algorithm without tool path planning is higher, the surface grid size changes with the tool path spacing (TPS) would affect the initial surface error and make the algorithm unpractical. In the second part, the optimization of tool path planning using the proposed algorithm is investigated, in terms of RMS, polishing time, and polishing track. The result reveals that the proposed algorithm can be used to find out the optimal TPS. Finally, polishing experiment is carried out, by using the optimal TPS obtained from the optimization process. Considering the instability of the removal functions in the polishing process and the gradient of the initial surface, the experimental result has shown an acceptable convergence ratio. Therefore, the accuracy and practicality of the presented algorithm are proven.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-015-7838-z