Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

High-efficiency smooth pseudo-random path planning for restraining the path ripple of robotic polishing

Not Accessible

Your library or personal account may give you access

Abstract

Computer-controlled subaperture polishing technology is limited by its propensity to introduce midspatial frequency (MSF) error (ripple error), which significantly inhibits the performance improvement of optical systems. The pseudo-random polishing path is an important method for suppressing MSF error. However, a pseudo-random path that ensures both path smoothness and planning efficiency is difficult to generate. This paper proposes a novel, to the best of our knowledge, pseudo-random path planning method employing a reconstructive points algorithm that efficiently achieves full coverage of the workpiece under massive sampling points at once. Moreover, the generation time for millions of path points is reduced to less than 3 minutes. Additionally, a path modification method is proposed that achieves smooth processing on a machine tool with few additional path points; the vibration magnitude under the proposed smooth path can be reduced to 0.749 g (gravity acceleration), which is the same as that of a raster path. A precise speed management method is also proposed to ensure precise surface error corrections. Overall, the experimental results show that the peak valley of the form error can be converted to ${0.115}\lambda$ using the proposed algorithm without introducing a periodic MSF error.

© 2021 Optical Society of America

Full Article  |  PDF Article
More Like This
Suppression of mid-spatial-frequency waviness by a universal random tree-shaped path in robotic bonnet polishing

Chong Wang, Yanjun Han, Haiyang Zhang, Chenlong Liu, Liang Jiang, and Linmao Qian
Opt. Express 30(16) 29216-29233 (2022)

Distance-based generation of a unicursal random path on a non-grid point set for optical polishing

Yunpeng Feng, Haobo Cheng, and Shaohua Zhang
Appl. Opt. 62(27) 7288-7298 (2023)

Data Availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (13)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (5)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (3)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.