Conicity error evaluation using sequential quadratic programming algorithm

Abstract

• Least-square method is employed to locate the cone roughly. • Simplified signed distance function is derived. • Simplified differential motion model of distance function is deduced. • SQP evaluation algorithm of conicity error is obtained. • The evaluation algorithm applies to cone with arbitrary position and orientation. Form error evaluation plays an important role in processing quality evaluation. Conicity error is evaluated as a typical example in this paper based on sequential quadratic programming (SQP) algorithm. The evaluation is carried out in three stages. Signed distance function from the measured points to conical surface is defined and the cone is located roughly by the method of traditional least-squares (LS) firstly; the fitted cone and the measured point coordinates are transformed to simplify the optimal mathematical model of conicity error evaluation secondly; and then optimization problem on conicity error evaluation satisfying the minimum zone criterion is solved by means of SQP algorithm and kinematic geometry, where approximate linear differential movement model of signed distance function is deduced in order to reduce the computational complexity. Experimental results show that the conicity error evaluation algorithm is more accurate, and has good robustness and high efficiency. The obtained conicity error is effective.