Error calculation for corrective machining with allowance requirements

Corrective machining is fundamental to obtain higher precision than the machine tool based on error inspection and calculation techniques. Generally, the error to be corrected is calculated by minimizing the material removal volume. However, there are often constraints for corrective machining, such as nonnegative error and allowance requirements, making it a constrained minimization problem. The basic algorithm for error calculation combines the alternating optimization method and the successive linearization method. Whereas, the sequence of objective function values is not guaranteed monotonously decreasing because of the local validity of linearization. Therefore, in the improved algorithm, the problem is reformulated as an inequality-constrained least square problem. Bound constraints are imposed on the optimization variables to keep local validity. Then, the line search and Palacios-type adjustment strategy are incorporated in each iteration in order to find a better point reducing the value of objective function. This point is chosen as the start of the next iteration. Finally, better convergence of the improved algorithm is verified by numerical simulations and a case of application in optical machining.

[1]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[2]  Liang Zhu,et al.  Efficient registration for precision inspection of free-form surfaces , 2007 .

[3]  Robert A. Jones Computer-Controlled Optical Surfacing With Orbital Tool Motion , 1986 .

[4]  Martin Weiser,et al.  Ion beam figuring for lithography optics , 2009 .

[5]  Jean-François Chatelain,et al.  A balancing technique for optimal blank part machining , 2001 .

[6]  Mary J. Edwards,et al.  Review of Corning's capabilities for ULE mirror blank manufacturing for an extremely large telescope , 2006, SPIE Astronomical Telescopes + Instrumentation.

[7]  Zexiang Li,et al.  Geometric algorithms for workpiece localization , 1998, IEEE Trans. Robotics Autom..

[8]  A. Ravindran,et al.  Engineering Optimization: Methods and Applications , 2006 .

[9]  Y. X. Chu,et al.  A geometric theory of form, profile, and orientation tolerances , 1999 .

[10]  Jean-François Chatelain A level-based optimization algorithm for complex part localization , 2005 .

[11]  Bob Hallock,et al.  Cost-effective subaperture approaches to finishing and testing astronomical optics , 2006, SPIE Astronomical Telescopes + Instrumentation.

[12]  Zhenyuan Jia,et al.  A unified localization approach for machining allowance optimization of complex curved surfaces , 2009 .

[13]  Guo Dongming,et al.  Machining localization and quality evaluation of parts with sculptured surfaces using SQP method , 2009 .

[14]  Z. H. Xiong,et al.  Error compensation of workpiece localization , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[15]  C. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[16]  Zexiang Li,et al.  On the Hybrid Localization/Envelopment Problem , 1999, Int. J. Robotics Res..

[17]  Peihua Gu,et al.  Free-form surface inspection techniques state of the art review , 2004, Comput. Aided Des..

[18]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Li Sheng-yi Inspection of Free-Form Optics , 2005 .