Mathematical Problems in Engineering

Volume 2018, Article ID 4689710, 17 pages

https://doi.org/10.1155/2018/4689710

## A Novel Optimal Design of Measurement Configurations in Robot Calibration

School of Automation, Beijing University of Posts and Telecommunications, Beijing 100876, China

Correspondence should be addressed to Gang Chen; moc.liamtoh@gnagnehc_tpub

Received 1 November 2017; Accepted 10 April 2018; Published 20 May 2018

Academic Editor: Alberto Borboni

Copyright © 2018 Qingxuan Jia et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Robot calibration highly depends on redundant measurement configurations to collect enough sample data for higher accuracy, but excessive measurements seem to be uneconomical and time-consuming. Thus lots of observability indexes to evaluate the goodness of the measurement configurations have been proposed. However, in some circumstances, it is of critical importance to obtain accurate kinematic parameters and estimate the end-effector pose precisely at the same time. Obviously one single observability index can hardly meet this need yet. Accordingly, after analyzing the essential constrains of robot calibration and the influence of measurement configurations on the observability indexes, an optimization model with two observability indexes to be taken into consideration is proposed in this paper, and then the existing DETMAX algorithm is modified to seek optimal design of measurement configurations, by adopting a set-constructing method and a set-shrinking method. Much better results have been obtained by simulation study, which implies that the proposed model and the modified DETMAX algorithm perform well in both kinematic parameter identification and pose estimation of the end-effector of the robot.

#### 1. Introduction

Robot calibration, the purpose of which is to obtain the accurate parameters representing the robot structure and the exact estimation of the end-effector pose, can maintain greater economy and convenience than the way guaranteeing robot accuracy by improving manufacturing and assembly precision. Generally, its procedure should encompass four main steps: kinematic modeling, measurement of the actual pose of the end-effector, identification of the kinematic parameters based on the calibration model, and compensation of the motion error by the employment of the identified kinematic parameters [1, 2]. Judicious selection of robot configurations used for redundant measurements can guarantee robustness of robot calibration with respect to sensor noise [3]. The investigation conducted on the evaluation indexes for robot configurations and their applications are elaborated briefly as follows.

In an attempt to evaluate efficacy of a certain configuration set composed of different configurations for robot calibration, several observability indexes have been proposed. Borm and Menq [4] proposed an index known as , which is based on the product of the nonzero singular values of the identification matrix. Maximization of indicates more effect of kinematic parameter errors exerted on the estimate pose error. This is also true for the index , proposed by Sun and Hollerbach [5] and based on the sum of the reciprocals of the nonzero singular values mentioned above. The second index proposed by Driels and Pathre [3], here termed , aims to maximizing the inverse of the condition number of the identification matrix, which is equivalent to the smallest nonzero singular value divided by the largest one. obtains its maximum value at 1 when all singular values are equal. The index proposed by Nahvi and Hollerbach [6] is just the minimum singular value, referring to the worst observability of the parameter error as the criterion, whereas the index [6] is the product of and , and actually there is no significant difference from to . Though both and can represent the overall performance of the identification matrix, by emphasizing the volume of a hyper-ellipsoid whose directions are determined by the singular values, these two indexes may lay more emphasis on one direction than another. Besides the other three indexes focusing on the partial features of the singular values, the global features may be ignored. Consequently it is necessary to take the partial features and the global ones of the singular values into account at the same time.

With the observability index determined, the additional challenge is to find an effective algorithm to construct a configuration set whose observability index is maximal. The algorithm most widely used is DETMAX proposed by Mitchell [7], and there have been lots of applications. Daney [8] investigated the influences of different observability indexes on a Gough platform by DETMAX. Li et al. [9] and Zhou et al. [10] adopted this algorithm for calibration of serial robots, and the calibration effect was improved. However, it is sensitive to local convergence. To circumvent this problem, Zhuang et al. [11] proposed a simulated annealing approach to obtain optimal measurement configurations. And then the genetic algorithm was also adopted to plan the robot calibration experiments [12]. Wang et al. [13] proposed the modified simulated annealing algorithm for the polishing robot. These heuristic algorithms improved convergence performance but often led to a low convergence rate.

Accordingly, two main improvements are proposed in this paper for robot calibration. The first improvement is to use the combination of and to achieve a multicriteria optimization. The second one is to modify the DETMAX algorithm for a better design of the measurement configuration set. The remainder of this paper is organized as follows. Essential constraints of robot calibration are presented in Section 2 to conduct later analysis of observability problem. In Section 3, it is demonstrated that maximizing always means an unbiased estimate of the kinematic parameters with smallest variance, while is the right criterion for minimizing the possible error of the end-effector for any configuration, from the experimental design literature. DETMAX is modified by adopting a set-constructing method and a set-shrinking method in Section 4. Simulation validation is presented in Section 5. Finally, conclusions and recommendations are given in Section 6.

#### 2. Essential Constraints of Calibration

Without loss of generality, a serial robot with actuators controlling DOF (degrees of freedom) is taken as the research object. Essential constraints of robot calibration are investigated in this section to conduct subsequent study on observability problems. Conventions used below are introduced for convenience as follows:(i) denotes the angle of one actuator of the robot, and thus denotes the angle of the actuator, where .(ii) is a vector composed of joint angles, also known as a robot configuration.(iii) is a set composed of different robot configurations, called a configuration set.(iv) denotes the permissible operating range of all the actuators, and also means a set of all possible robot configurations, called the candidate configuration set pool.

Generally the kinematic model of the robot relates the joint angles and the end-effector pose through a function based on the irreducible exact kinematic parameters as illustrated in the following.

The joint angles are not known with exactitude due to the existence of sensor noise. Similarly, defects in manufacturing and assembly result in parameter errors. The difference between the nominal values and and the exact values and is assumed to be and , such as , . Moreover, for lack of completeness, the modeling function also leads to errors, set as *.* In conclusion, it is the modeling error , the angle measurement error , and the kinematic parameter error that yield the estimate error of the end-effector pose. To relate these factors to the estimate error of the end-effector pose, differentiate (1) with respect to all its parameters.where is the generalized Jacobian matrix, also called the identification matrix, and is the Jacobian matrix in terms of a robot configuration . The kinematic parameter error makes the greatest contribution to the estimate error of the end-effector pose, considering that either the modeling error or the measurement error is usually small [14]. That is to say, the systematic error of the robot system is much greater than the random error. Hence (2) can be simplified as follows:

The number of the independent parameters to describe the pose error is 6, which is much less than that of the kinematic parameter error , indicating that (3) is underdetermined, especially under only one robot configuration. Thus sufficient configurations have to be measured to establish an overdetermined system. Then the definition of parameters in (3) is further extended as . The configuration is replaced with a configuration set . Here indicates a transpose of a matrix, and denotes the amount of the measurement configurations. It is noteworthy that the identification matrix is obtained with the inaccurate parameters and , so that the least squares method should be applied iteratively to guarantee accuracy as shown in the following.where denotes the total number of iterations, and means the Moore-Penrose inverse of a matrix. The estimate pose error is obtained by , in which the exact values are replaced with the measured values . The process is iterated until converges to a small value. The identified kinematic parameters can finally be obtained by (5). Note that the measured values is different from the exact values for defects of measuring equipment and methods, and the error is set as .

The repetitive positioning accuracy of the end-effector has been determined once the robot is designed and manufactured, which is the robot’s property that cannot be modified, whereas the robot calibration process involving kinematic modeling, external measurement of the end-effector poses, and selection of measurement configurations can be optimized. Four general constraints are summed up for robot calibration, the first two of which are prerequisites for calibration and need to be validated in advance, while the last two are interrelated with each other and can be optimized for a better design of measurement configurations.

*Constraint A. *Sufficiently high end-effector repeatability is a necessary condition for robot calibration, and in general, the precision of the absolute positioning is lower; for example, for a robot with a repeatable positioning accuracy of ±0.05 mm, the absolute positioning accuracy can only reach 2~3 mm [15]. The factors influencing the end-effector repeatability include sensor noise of joint angles measurement, backlash caused by gear gaps, change of temperature, and other random factors. The sensor noise is the main influencing factor, which has to satisfy the inequality as follows:where is the maximum value of the joint angle measurement error and denotes the permissible range of the repeat positioning error. For all the reachable robot configurations, the repeatability should meet the accuracy requirements. However, (6) only needs to be verified under enough configurations in practice.

*Constraint B. *Lots of kinematic modeling methods have been proposed for efficient and succinct description of the relation between the adjoining link coordinate frames, such as the widely used DH (Denavit-Hartenberg) method [16]. Yet all the modeling methods do not meet three basic requirements: model completeness, parameter minimality, and model continuity [17]; for example, DH method has only four link parameters, which is not enough to achieve a complete kinematics model, and the effects of machining and assembly errors may be overlooked. This is also true for other modeling methods.

It should be noted that nonsingularity of the identification matrix is essential because a pseudo-inverse of the identify matrix is adopted in (4), such aswhere is the determinant of a matrix. In order to accurately identify the kinematic parameters, the redundant parameters should be removed in the process of modeling, ensuring that the identification matrix is full rank.

*Constraint C. *Since the actual end-effector pose of the robot is expressed by the measurement values instead of the exact value , the parameter identification error is mainly derived from the external measurement noise under the assumption that the linearization error can be remedied through iteration. Hence external measurement instruments including the laser tracker, the coordinate measuring machine (CMM), and the optical measuring instrument generally have a high measuring accuracy; for example, the laser tracker AT501B produced by Leica has a static positioning accuracy of up to .

*Constraint D. *On the one hand, sufficient measurement configurations are selected to establish an overdetermined system of equation. Assume that the kinematic modeling function describes the adjoining link coordinate frames with parameters, none of which is linearly dependent, so that there are kinematic parameters to be identified for a DOF robot. The end-effector pose is expressed by parameters, and thus the minimum amount of measurement configurations can be calculated as follows:

In practical application, for more robustness of robot calibration against the measurement noise, several times, or even ten times, the minimum number required of measurement configurations is selected. On the other hand, the composition of the measurement configuration set is also worth studying. Mapping of the kinematic parameter error and the estimate pose error of the end-effector, here called the identification matrix , obviously depends on the configuration set . A better configuration set can reflect more effects of the kinematic parameter error on the pose error for higher identification accuracy, which also lays the foundation for further optimization of the measurement configurations.

#### 3. Observability Problems

As stated above, the process of robot calibration involves a number of error factors, such as modeling errors, high-order residuals from linearization, measurement noises, and other random errors. Under the assumption that linearization errors can be remedied through iteration and modeling errors have a slight impact, (3) is mainly influenced by measurement noises , and in the lecture of regression it can be written aswhere is a observation vector, an estimate variable vector, a regression matrix, and a error vector, given . According to the definition of the identification matrix,where is a set composed of robot configurations, and is a set composed of kinematic parameters to be identified. For the generalized regression model (9), the information matrix is expressed as

In statistics, optimal experiment design theory has given rise to several evaluation indices of the goodness of the information matrix in order to direct experiment design, of which the most significant are defined as follows [5]:(i)D-optimality: selection of experiment design maximizes the determinant of the information matrix(ii)A-optimality: selection of experiment design minimizes the trace of the information matrix(iii)E-optimality: selection of experiment design maximizes the minimum eigenvalue of the information matrix(iv)G-optimality: selection of experiment design minimizes the maximum variance of the response variables

The relation between optimal experiment design indices and observability indexes are elaborated in this section for building an optimization model of configuration set, according to the two typical purposes of robot calibration, one of which is to minimize the variance of the estimate parameters in the robot model and the other one is to minimize the maximal possible uncertainty of the estimate end-effector pose. These two purposes are not equivalent in optimal experiment design theory. The conclusion comes out that maximizing always means an unbiased estimate of the kinematic parameters with smallest variance, while is the right criterion for minimizing the possible error of the end-effector for any configurations.

##### 3.1. Optimization of Kinematic Parameter Estimation

With least squares, the kinematic parameter error can be estimated aswhere is assumed to be invertible. Minimization the variance of the estimated variable indicates an unbiased estimate of the kinematic parameters. Assume that each factor of the measurement error vector is independent and identically distributed, such aswhere denotes the factor in the error vector and denotes the number of parameters expressing the end-effector pose. Hence the covariance matrix of the measurement error vector can be expressed aswhere is the variance of a vector and denotes the amount of measurement configurations.

According to (14), the covariance matrix of the estimated variable can be obtained as

Given the definition of the information matrix as (11), (15) can be rewritten as

Equation (16) indicates that the smaller the information matrix is, the more accurate the estimate of kinematic parameters will be obtained. However, the minimization of a matrix has lots of expressions corresponding to different physical meanings. D-optimality seeks an optimal estimate of the estimated variable , and for a linearization model such as (9), the volume of the dense ellipsoid defined by the estimated variable is adopted to evaluate the efficacy of least squares estimation.

The variance and mean of the estimated variable are assumed to be known, and an ellipsoid called the dense ellipsoid exists in m-dimensional space, on the region surrounded by which, m-dimensional random variables have the same variance and mean as an m-dimensional uniform distribution. The volume of the dense ellipsoid indicates the concentrative degree of the estimated variable. Generally different experiment designs produce different dense ellipsoids, and the measurement configuration set plays a decisive role in robot calibration, such as . For a configuration set , or called an experiment design, the volume of the dense ellipsoid can be calculated with its information matrix aswhere is a function. For the same model (9), assume that there are two different designs such as and with . Under D-optimality, is referred as a better design than , indicating that . The determinant of the information matrix is finally selected to represent its magnitude.

Using the singular value decomposition method, (9) becomeswhere and are orthonormal matrices, and for measurements and parameters,where are the nonzero singular values of the matrix with . The observability index is defined as

Considering that reciprocal of product of eigenvalues is actually the determinant of a matrix, the determinant can be expressed as

It can be concluded from (21) that the determinant of the information matrix is typically equivalent to observability index , which can be used as the evaluation index of configuration set optimization, guaranteeing an unbiased estimate of the kinematic parameters.

##### 3.2. Optimization of End-Effector Pose Estimation

With the parameters estimated, the response variable can be estimated as

For a robot, the end-effector pose can be obtained through the kinematic parameters calibrated with the forward kinematic function. Since the estimate kinematic parameters are still not exact, the estimate end-effector pose has errors, too. In some cases, the goal of robot calibration is to build a prediction model to place the robot end-effector to a certain pose accurately. In statistics, the experiment design under G-optimality indicates that the maximum of variance of each point in the design domain with respect to the GLSE (generalized least squares estimation) estimate is minimized; that is to say the maximum of estimate variance of the responsible variable is minimized.

For (22), minimizing the maximum possible variance of the responsible variable means the minimization of . For any row of the identification matrix , ; thus

In practice, all experimental designs are exact; it is supposed to be an -point design with one observation at . For an exact design, the information matrix is expressed as

For an -point exact design, the G-optimality is

According to the paper [5], if the input variable is bounded as , the exact design G-optimality is equivalent to E-optimality, which can be written aswhere denotes the minimal nonzero singular value of the identification matrix. Since the observability index is defined by the minimal nonzero singular value , it should be the right criterion for minimizing the possible error of the end-effector for any configurations, for the same number of measurement configurations.

##### 3.3. Modeling of Configuration Set Optimization

A combination of the indexes and is used to achieve a multicriteria optimization of measurement configurations in an attempt to obtain an unbiased estimate of the kinematic parameters and an optimal estimate of the end-effector pose at the same time. In the experiment design lecture, selection of measurement configurations in robot calibration can be thought as an -point design. The design problem can be expressed as seeking a configuration set whose size is , configurations of which are selected from the candidate configuration set pool . The indexes and corresponding to the configuration set designed reach their maximums.where is a function to achieve integration of two indicators, and there are different integration strategies in practical applications. In general, the subobjective functions of multiobjective optimization are transferred into a single objective function by mathematical transformation and then single-objective optimization methods are used to solve the optimization problem. Among these methods, the hierarchical sequence method is an analytical decision-making method optimizing one by one in the order of the importance of the objectives while the objective planning method is to make each objective converge to a given corresponding target value under constraints as close as possible, rather than directly seeking an extremum of each objective, which has a characteristic of high solving efficiency but requires a priori knowledge.

The influence of measurement configurations on the two observability indexes was investigated to determine a better optimization strategy. Since the complete expression of the relation between measurement configurations and observability indexes is too complex to show its influence intuitively using an analytical method, in Section 5, kinds of robots were adopted to analyze the influence of measurement configurations. As the basis for the design of the calibration configuration optimization model, conclusions were summed up as follows:

The indexes and almost have no relevance with each other for the same configuration set.

With the incensement of the size of the measurement configuration set, its corresponding converges to a certain system finally, while always has an increasing trend.

The index has an upper limit according to the second conclusion.

When the measurement configuration set contains more than a certain number of configurations, the influence of composition of the measurement configuration set on is greatly higher than that on .

Taking the above conclusions into account, a combination of the hierarchical sequence method and the objective planning method was used for an optimal experiment design, where the minimal size of the measurement configuration set as its converges to a certain system, recorded as , and the converge value, recorded as , should be firstly determined. And then an -point design is produced to maximize with .

#### 4. Modified Experiment Design Method

It is well-known that the DETMAX algorithm and its improved versions have been widely used in experiment design of robot calibration [18–21]. The traditional DETMAX algorithm relies highly on the principle of exchange, including the PoseAdded algorithm and the PoseRemoved algorithm. In calibration applications, the PoseAdded algorithm aims to pick up an optimal configuration one time from the candidate configuration set pool to be added into the original -point design in order to yield the greatest increase of the corresponding observability index; on the contrast, the PoseRemoved algorithm aims to remove one configuration from the set constructed in the previous step which affects the index value minimally. These two algorithms are used interchangeably, and the observability index of the -point experiment design increases, thus achieving the optimal design.

To settle with the continuousness of the permissible operating range of all the robot’s actuators, a rasterization method is adopted by the DETMAX algorithm. Nevertheless, the amount of configurations in the candidate configuration set pool will be greatly huge if a small interval is used during rasterization, especially when the robot has plenty of DOFs. Another flaw in this algorithm is that the original selection of the -point design has a big effect upon the final optimal design, so that the DETMAX algorithm is executed several times to choose the best solution, implying that the algorithm cannot guarantee a global optimal solution. Accordingly, the DETMAX algorithm was improved in this paper from two aspects: initial set construction and iterative optimization, for a better design performance.

##### 4.1. Ways to Improve DETMAX Algorithm

In the original algorithm, configurations in the initial set are randomly selected from the candidate configuration set pool. And the complexity of the configuration optimization problem makes the optimization result heavily dependent on the random selection, indicating that a good initial set will lead to better optimization results. Thus the following methods are proposed to build the initial set.

*The Incremental Method. *The minimum amount of measurement configurations needed for robot calibration can be calculated as (8), which is much less than the actual amount of measurement configurations used to guarantee robustness against measurement noises, giving us a new idea to build the initial set. The minimum amount of configurations is randomly selected from the candidate configuration set pool, and then a configuration, which contributes most to the increment of the observability index, is picked up from the remaining configuration set one by one to be added into the initial set, until the size of the measurement configuration set reaches .

*The Decreasing Method. *The incremental method is to find the optimal configuration in the remaining configuration set by traversal to increase the amount of the initial configuration set. Firstly, a large amount of configurations is randomly selected from the candidate configuration set pool, and then a configuration, which contributes least to the increment of the observability index, is removed from the initial configuration set one by one, until the size of the measurement configuration set reduces to .

The set-constructing method is proposed with the incremental or the decreasing method, which makes the resulting measurement configuration set a better observability index on one hand and reduces the time required for iterative optimization on the other hand, since a better initial set is usually closer to the local optimal solution. However the result of a single construction may still be unsatisfactory and thus several tries are quite necessary.

The DETMAX algorithm replaces the inappropriate configuration in the initial set with a better configuration from the remaining set one by one until the construction of an optimal experiment design. And the rasterization makes it possible to pick up the best configuration by traversing the candidate configuration set pool, but difficult to pursue better optimization results on the continuous permissible operating range. Consequently a set-shrinking method aiming to refine the candidate configuration set pool is proposed as follows.

*The Shrinking Method. *By constructing the initial set and the subsequent exchange optimization, an -point design is obtained, which is composed of measurement configurations, and each configuration is expressed by joint angles, for a DOF robot. The -point design can be written as

It is clear that an -point design is composed of joint angles. The new permissible range of each joint angle can be given aswhere and denote the lower and upper limit of the joint angle, denotes the number of the configurations in the configuration set , is the number of times the corresponding joint angle is iteratively optimized, and is the stated width of the new permissible range. Each joint angle is supposed to be iteratively optimized no more than times.

The new permissible ranges are rasterized equally in ten pieces to yield a discrete configuration set pool needed. For all the joint angles in the set , the best configuration will be picked up from the new configuration set pool for replacement, constructing a better -design . During the next iteration process, a new configuration set pool corresponding to the new set can be obtained as (30). The optimization procedure expressed above will be repeated until the times that all the joint angles are optimized reach the upper limit .

##### 4.2. Application of Modified DETMAX Algorithm

The modified DETMAX algorithm is applied to solve the optimization problem illustrated in (28) with the proposed set-constructing method and set-shrinking method applied. Compared with the foregoing measurement configurations optimization methods, the proposed one has the following characteristics:(i)The optimization of observability indexes has been taken into account while building the initial configuration set just from the beginning.(ii)Two observability indexes are selected for evaluation of the measurement configuration set, with to be the objective and to be the constraint.(iii)The set-shrinking method makes it possible to further refine the measurement configurations.

Based on the conventions given in Section 2, more is added to outline the realization of the new algorithm in detail as follows:(i) is a set of measurement configurations, also called an -point experiment design.(ii) is a set of measurement configurations, which is a new measurement design after the PoseAdded algorithm is used.(iii) is the set of all the possible configurations except these in , where the added configuration is picked up.(iv) denotes a robot configuration chosen by PoseAdded algorithm.(v) denotes a configuration that should be removed from the configuration set by the PoseRemoved algorithm.(vi) denotes the minimum amount of configurations needed for calibration, calculated by (8).(vii) denotes the maximum amount of measurement configurations given for analyzing the influence of configurations on observability indexes.(viii) is a configuration set whose size is .(ix) denotes the converging value of the observability index as the size of the measurement configuration set increases.(x) denotes the joint angle of the configuration in the configuration set .(xi) is the new feasible domain calculated as (30).(xii) is the number of times the joint angle has been replaced, whose upper limit is set as .

As shown in Figure 1, the improved DETMAX algorithm can be roughly divided into four steps: determination of the optimal size of the measurement configuration set; construction of the initial set by the incremental or decreasing method; iterative optimization by the PoseAdded and PoseRemoved algorithm; and further optimization by the shrinking method. Specific steps are as follows.