Solving method of generalized nonlinear dynamic least squares for data processing in building of digital mine

Data are very important to build the digital mine. Data come from many sources, have different types and temporal states. Relations between one class of data and the other one, or between data and unknown parameters are more nonlinear. The unknown parameters are non random or random, among which the random parameters often dynamically vary with time. Therefore it is not accurate and reliable to process the data in building the digital mine with the classical least squares method or the method of the common nonlinear least squares. So a generalized nonlinear dynamic least squares method to process data in building the digital mine is put forward. In the meantime, the corresponding mathematical model is also given. The generalized nonlinear least squares problem is more complex than the common nonlinear least squares problem and its solution is more difficultly obtained because the dimensions of data and parameters in the former are bigger. So a new solution model and the method are put forward to solve the generalized nonlinear dynamic least squares problem. In fact, the problem can be converted to two sub problems, each of which has a single variable. That is to say, a complex problem can be separated and then solved. So the dimension of unknown parameters can be reduced to its half, which simplifies the original high dimensional equations. The method lessens the calculating load and opens up a new way to process the data in building the digital mine, which have more sources, different types and more temporal states.

A CLASS OF FACTORIZED QUASI-NEWTON METHODS FOR NONLINEAR LEAST SQUARES PROBLEMS

This paper gives a class of descent methods for nonlinear least squares solution. A class of updating formulae is obtained by using generalized inverse matrices. These formulae generate an approximation to the second part of the Hessian matrix of the objective function, and are updated in such a way that the resulting approximation to the whole Hessian matrix is the convex class of Broyden-like up-dating formulae. It is proved that the proposed updating formulae are invariant under linear transformation and that the class of factorized quasi-Newton methods are locally and superlinearly convergent. Numerical results are presented and show that the proposed methods are promising.

Kinematic calibration method with high measurement efficiency and robust identification for hybrid machine tools

Geometric error is the main factor affecting the machining accuracy of hybrid machine tools.Kinematic calibration is an effective way to improve the geometric accuracy of hybrid machine tools.The necessity to measure both position and orientation at each pose,as well as the instability of identification in case of incomplete measurements,severely affects the application of traditional calibration methods.In this study,a kinematic calibration method with high measurement efficiency and robust identification is proposed to improve the kinematic accuracy of a five-axis hybrid machine tool.First,the configuration is introduced,and an error model is derived.Further,by investigating the mechanism error characteristics,a measurement scheme that only requires tool centre point position error measurement and one alignment operation is proposed.Subsequently,by analysing the effects of unmeasured degrees of freedom(DOFs)on other DOFs,an improved nonlinear least squares method based on virtual measurement values is proposed to achieve stable parameter identification in case of incomplete measurement,without introducing additional parameters.Finally,the proposed calibration method is verified through simulations and experiments.The proposed method can efficiently accomplish the kinematic calibration of the hybrid machine tool.The accuracy of the hybrid machine tool is significantly improved after calibration,satisfying actual aerospace machining requirements.