Trajectory planning of optical polishing based on optimized implementation of dwell time

Abstract This paper presents a study on the trajectory planning of optical polishing based on an optimized implementation of dwell time to improve the polishing quality and efficiency of optical surfaces. The large-scale, sparse, and ill-posed linear equation solution is transformed into a quadratic programming problem with boundary constraint, and the monotone projection gradient method is adopted to obtain an optimal dwell time solution by considering its fluctuation characteristic. Then, parametric polishing paths are constructed using cubic B-spline curves to guarantee one-to-one correspondence between each curve segment and dwell time of a removal spot. Finally, an interpolation process of polishing trajectory is proposed on the basis of the equal–proportional feed rate adjustment strategy to improve the implementation accuracy of dwell time. Simulation and experimental results show that the proposed dwell time algorithm and spline interpolation method can considerably improve the solution accuracy of dwell time and the convergence rate of the form error during polishing. These results provide important scientific basis and technical support for the high-efficiency and high-precision polishing of large-aperture aspheric optical surfaces.