# A Parallel Ranging-Based Relative Position and Orientation Measurement Method for Large-Volume Components

Authors: Dian Wu; Fuzhou Du
Journal: Journal of Sensors
 (2018)

---

## Abstract

In this paper, a novel relative position and orientation (R-P&O) measurement method for large-volume components is proposed. Based on the method, the parallel distances between the cooperative point pairs (CPPs) are collected by multiple pairs of wireless ranging sensors which are installed on respective components and finally turned into the R-P&O. Accordingly, a measurement model is built and an algorithm is designed to solve the model, in which the radial basis function neural network (RBFNN) produces a preliminary solution by offline training and the differential evolution (DE) strategy finds the accurate solution by online heuristic searching. Furthermore, the crucial parameters and the performance of the algorithm are analyzed through simulating a virtual alignment process which proves that the RBFNN-DE algorithm can quickly and accurately find the global optimal solution in the whole effective workspace. Besides the theory study, a ranging device based on ultrasound has been developed along with a calibration method. Depending on the device, an experiment of actual alignment is implemented to verify the algorithm. Experimental results indicate that the error of R-P&O is no more than 4.1 mm and 0.32° when the ranging error is 0.1 mm, compared with the measurement result of indoor GPS (iGPS).


---

## Body

## 1. Introduction

In aviation, aerospace, and ship manufacturing, the product assembly is characterized by large volume, high accuracy, and complex processes. As the key production procedure, component alignment greatly affects the quality of manufacturing, the priority target of which is measuring R-P&O that means the position and orientation of the moving component coordinate system relative to the immovable component coordinate system. The traditional method is generally to figure out the geometric size of the component by standard gauges with analog transfer, which has been unable to meet the increasing requirements of alignment. Hence, it is of great theoretical and practical value to research for a high-accuracy digital measurement system for the alignment process of a large-volume component [1, 2].The common digital measuring instrument includes a laser tracker [3, 4], theodolite [5], iGPS [6, 7], industrial camera [8, 9], coordinate measuring machine (CMM) [10, 11], and so on, which depends on transforming the relevant points into the reference coordinate system of a third party to fit the R-P&O of components [12]. Because of the indirect acquisition of R-P&O, this method involves a complex coordinate system transformation and unnecessary error [13]. Considering that the component to be measured has a large volume, it is difficult to cover all the target points with a single instrument. Alternatively combining multiple instruments, the error caused by a transfer station needs to be taken into account [14]. Besides, for all of the above instruments the price is expensive, several of the instruments (theodolite and CMM) are no longer able to work when the R-P&O is changing.Inspired by the forward kinematics problem (FKP) in the field of robotics, the R-P&O can be calculated based on the distances of CPPs. A pair of corresponding points from two individual components with known coordinates in a local coordinate system is called a CPP. FKP refers to using the kinematic equations of a robot to compute the R-P&O of the end effector through the joint parameters [15]. The difference is that for each measurement task of alignment, the position of CPPs can be different, and they don’t have to be regularly distributed in two planes such as the Stewart platform [16]. In order to solve the complex nonlinear equations contained in the FKP, there are two kinds of methods that are proposed, namely the numerical method [17] and analytical method [18]. The mathematical model of the numerical method is simple, but it is quite dependent on the initial value and cannot deduce all solutions. On the contrary, the elimination process of the analytical method is very complex which may introduce an imaginary root. In addition, a lot of intelligent algorithms were proposed recently, such as particle swarm optimization [19], hybrid immune algorithm [20], and neural network algorithm [21].The traditional methods for FKP can lead to multisolutions. However, the measurement needs to be synchronized with the alignment process, and there is no condition for judgment manually after each calculation. On the other hand, it is difficult to make a general rule to pick the correct solution for various alignment components, so we turn to intelligent algorithms. Compared with other algorithms, RBFNN has the characteristics of approaching any nonlinear function with arbitrary-precision and having a good global approximation ability. It is also suitable for the solution of multidimensional parameters and can be easily adjusted by changing the number and width of network nodes. Accordingly, it has a natural advantage to solve the FKP. However, this depends on the quality of training, and the result cannot be satisfactory with poor training quality. DE has few controlled parameters and can search for solutions by using individual differences. Its fast convergence capability can solve the real-time problem robustly. It also applies to the solution of multidimensional parameters. Adversely, it easily falls into a local optimal solution and relies on a good initial value. Therefore, considering the complementary advantages of the two algorithms, the preliminary result of RBFNN is used as the initial value of DE, and then a quite accurate result can be solved.In this paper, a measurement model is built to calculate the R-P&O of large-volume components by parallel ranging, and an intelligent algorithm combining RBFNN [22] and DE [23] is proposed to solve the model in Section 2. For the purpose of analyzing the performance and crucial parameters of the algorithm, a virtual alignment is simulated through a hypothetical trajectory in Section 3. Furthermore, a kind of ranging device is developed based on an ultrasonic signal, and the calibration method of the device is introduced. Finally, the novel method is verified by the actual alignment experiment in Section 4.


## 2. The Method for R-P&O Measuring

### 2.1. The Measurement Model Based on Parallel Ranging

In the alignment process, the R-P&O measurement based on parallel ranging involves the immovable and moving component. Meanwhile, a number of wireless sensors are installed on CPPs of the components to measure the distances, which provide support for calculating the R-P&O. The schematic diagram of the measurement model is shown in Figure1.Figure 1
The R-P&O measurement model.The symbols are defined as follows:(a)
OB−xyz is the base coordinate system (BCS), which is fixed to the immovable component
(b)
OM−xyz is the moving coordinate system (MCS), which is fixed to the moving component
(c)
Pi3×1Bi=1,2,…,n,n≥6 is the coordinate of CPPs in BCS, which can be obtained based on a 3D model of the design or calibration in advance
(d)
Pi3×1Mi=1,2,…,n,n≥6 is the coordinate of CPPs in MCS, which can be obtained based on a 3D model of the design or calibration in advance
(e)
Lii=1,2,…,n,n≥6 is the distance between a CPP, which is obtained by a ranging device
(f)
T4×4BM=R3×3BMD3×1BM01 is the expression of R-P&O in matrix form [24], which is the target to be solved
(g)
R3×3BM is a rotation matrix, which is uniquely determined by the Euler angle α,β,andγ
(h)
D3×1BM is a translation matrix, which is uniquely determined by displacement dx,dy,anddzOur aim is to determine the R-P&Ot=α,β,γ,dx,dy,dz; that is, T4×4BM by ℓ=L1,L1,…,Ln. It can be expressed as (1):
(1)t=fℓ.According to the Euclidean distance between CPPs, we can set upn equations. Because we need to solve 6 independent parameters, there must be n≥6. Then, it can be transformed into an optimization problem:
(2)mint∑i=1nR3×3BM·Pi3×1B+Di3×1BM·11×1B−P3×1M−Li2.Equation (2) with a complex structure contains a large number of trigonometric functions. In the process of iterative optimization, it is easy to fall into the local minimum and get the solution which does not conform to the actual situation. At the same time, the speed of convergence and the quality of the solution depend on the selection of initial value. In view of this, a solution method based on RBFNN-DE is proposed, which can quickly and accurately calculate the R-P&O.The algorithm flow of RBFNN-DE is shown in Figure2. Firstly, according to the specific alignment components, the possible variation space of the R-P&O is designated, that is, the workspace. Then, we start to generate a number of R-P&O in the workspace randomly, and use the inverse function of (1) to find the theoretical distance of CPPs corresponding to each R-P&O. A large number of data samples consisting of R-P&O and distance are randomly assigned to the test set and the training set. The training set is responsible for calculating the parameters of the network, and the test set is responsible for evaluating the error ∆t of the network. At this point, if the actual measured distance of CPPs at a certain time in the alignment process is input to the network, the preliminary R-P&O calculation result tout1 can be obtained.Figure 2
Flowchart of the RBFNN-DE algorithm.Combining∆t and tout1, we can construct a solution space that may contain the accurate R-P&O and randomly generate multiple values in this space to initialize population g1. Using the difference between individuals in g1, the mutant population v1 was created. Then, we cross v1 with the original population g1 to get the population c1. Finally, we compare the individuals in g1 with those in c1 and select the relatively better individuals to form the new population g2. The process is iterated until the population gm satisfies the terminating condition, and at that time the optimal value tbest is picked from the gm as the final result of the RBFNN-DE algorithm.


### 2.2. Preliminary Estimation Based on RBFNN

As shown in (3), the radial basis function is radial symmetry, defined as a monotone function of the Euclidean distance from any point ℓk to the center point ci, and ϑi represents the width of the function:
(3)zi,i,k=exp−ϑiℓk–ci2.RBFNN with a three-layer structure is constructed as Figure3.Figure 3
RBFNN with a three-layer structure.Through RBFs, the input dataℓk (n dimension) can be projected nonlinearly to the high dimensional space (h dimension). Furthermore, RBFs are combined linearly to obtain the output tk (6 dimensions) which approximates the original function t=fℓ as shown by (4). wid represents the weight of the hidden layer to the output layer:
(4)tkd=∑i=1hwid·zi,i,kd=1,2,…,6,k=1,2,…,h.The parallel distancesℓ can be determined uniquely by ℓ=f−1t according to the inverse kinematics problem (IKP). Thus, we can generate the set Strain containing large amounts of data for training the neural network and the set Stest for testing the performance of RBFNN.In order to simplify the training process, the center of RBF is specified at each training sample, namelyci=ℓii=1,2,…,h;h≫n≥6, and all the width of RBF is set to constant ϑ0. By matrix expression, we can get (5):
(5)t1d⋮thd=z0,1,1…z0,h,1⋮⋱⋮z0,1,h…z0,h,h·w1d⋮whdd=1,2,…,6.Using the least squares method (LSM) and singular value decomposition (SVD) [25], wij can be calculated, which means RBFNN fRBF· for specific workspace W is completely constructed. Given an input ℓin, there is tout1=fRBFℓin.Since the center of RBF is consistent with the training sample, the network may be overfitting with a large error in the setStest. Thus, the network can only estimate the R-P&O preliminarily, and it is necessary to get more accurate results by processing further.


### 2.3. Accurate Computation Based on DE Algorithm

DE is a heuristic random search algorithm based on group differences, including mutation, crossover, and selection process. It is characterized by a differential strategy for individual mutation, global optimization, and good stability. The following are the main steps of DE algorithm.Step 1. Population Initialization.
According to the error∆t displayed on the set Stest and the preliminary result tout1 calculated by RBFNN, the upper bound tH and lower bound tL of the search space are determined. In the search space, NP individuals are randomly generated to form the g generation population according to (6), and U0,1 is used to generate uniform distributed random numbers from 0 to 1:
(6)tig=tL+U0,1·tH−tLi=1,2,…,NP.Step 2. Mutation.
The most obvious feature of the DE algorithm is to utilize the difference vector between individuals to generate a new individual. The method we used is revealed in (7):
(7)tiv=tr1g+F0tr2g−tr3gi=1,2,…,NP.
r1,r2,andr3 are unequal integers in the range 1,NP, while F0 is the variation parameter controlling the influence degree of the difference vector on the new individual. If there is tiv∉tL,tH, the tiv will be assigned again according to (7).Step 3. Crossover.
The purpose of crossover is to further improve the diversity of the population. Equation (8) describes the method of generating a new crossover individual by randomly selecting from the mutation or ordinary individual at every dimension, where CR is called crossover parameter:
(8)ticd=tigdifU0,1≤CR,tivdotherwise,i=1,2,…,NP,d=1,2,…,6.Step 4. Selection.
Equation (9) describes how to select the better individual from ordinary or crossover individuals according to the greedy strategy, which eventually becomes a member of the next generation:
(9)tig+1=tigifferrtig≤ferrtic,ticotherwise,i=1,2,…,NP.Step 5. Iteration.
The above steps will be iterated until reaching maximum iterationsg=Gm or the accuracy restriction ferrtbestg≤δ0. The optimal individual tbest is an accurate estimation of R-P&O.Combining RBFNN and DE, the whole flow of the algorithm in the form of pseudocode is presented in Algorithm1.Algorithm 1: Algorithm Pseudocode.
RBFNN-DE algorithm for R-P&O measuring
Input: the coordinates of CPPs PB,PM; Workspace W; Center Numbers h; spread ϑ0;
PopulationNP; Generation Gm; Accuracy δ0; Variation Parameter F0;
Crossover ParameterCR; Measured Distance ℓin;
Output: The best solution of R-P&O - tbest;
1Off-line neural network training:
2Strain,Stest←ℓ=f−1PB,PM,randomtinW
3TZ←zi,k=exp−ϑ0ℓk−ci2∣ℓ,t∈Strain,i=1,2,…,h
4frbf·←solveWinT=W·ZbySVD
5∆t←∆dt=RMSEfRBFℓ,t∣dim=d,ℓ,t∈Stest
6end training
7On-line DE computing:
8tout1=fRBFℓin
9   Wsub←Rangetout1,∆t
10   t1←GenerateWsub,NP
11whileg<Gmorferrtbest>δ0do
12tv←Mutationtg,F0
13tc←Crossovertg,tv,CR
14tg+1,tbestg←Selecttg,tc
15tbest=tbestg,g=g+1
16end
17return the best solution tbest
18end computing


## 2.1. The Measurement Model Based on Parallel Ranging

In the alignment process, the R-P&O measurement based on parallel ranging involves the immovable and moving component. Meanwhile, a number of wireless sensors are installed on CPPs of the components to measure the distances, which provide support for calculating the R-P&O. The schematic diagram of the measurement model is shown in Figure1.Figure 1
The R-P&O measurement model.The symbols are defined as follows:(a)
OB−xyz is the base coordinate system (BCS), which is fixed to the immovable component
(b)
OM−xyz is the moving coordinate system (MCS), which is fixed to the moving component
(c)
Pi3×1Bi=1,2,…,n,n≥6 is the coordinate of CPPs in BCS, which can be obtained based on a 3D model of the design or calibration in advance
(d)
Pi3×1Mi=1,2,…,n,n≥6 is the coordinate of CPPs in MCS, which can be obtained based on a 3D model of the design or calibration in advance
(e)
Lii=1,2,…,n,n≥6 is the distance between a CPP, which is obtained by a ranging device
(f)
T4×4BM=R3×3BMD3×1BM01 is the expression of R-P&O in matrix form [24], which is the target to be solved
(g)
R3×3BM is a rotation matrix, which is uniquely determined by the Euler angle α,β,andγ
(h)
D3×1BM is a translation matrix, which is uniquely determined by displacement dx,dy,anddzOur aim is to determine the R-P&Ot=α,β,γ,dx,dy,dz; that is, T4×4BM by ℓ=L1,L1,…,Ln. It can be expressed as (1):
(1)t=fℓ.According to the Euclidean distance between CPPs, we can set upn equations. Because we need to solve 6 independent parameters, there must be n≥6. Then, it can be transformed into an optimization problem:
(2)mint∑i=1nR3×3BM·Pi3×1B+Di3×1BM·11×1B−P3×1M−Li2.Equation (2) with a complex structure contains a large number of trigonometric functions. In the process of iterative optimization, it is easy to fall into the local minimum and get the solution which does not conform to the actual situation. At the same time, the speed of convergence and the quality of the solution depend on the selection of initial value. In view of this, a solution method based on RBFNN-DE is proposed, which can quickly and accurately calculate the R-P&O.The algorithm flow of RBFNN-DE is shown in Figure2. Firstly, according to the specific alignment components, the possible variation space of the R-P&O is designated, that is, the workspace. Then, we start to generate a number of R-P&O in the workspace randomly, and use the inverse function of (1) to find the theoretical distance of CPPs corresponding to each R-P&O. A large number of data samples consisting of R-P&O and distance are randomly assigned to the test set and the training set. The training set is responsible for calculating the parameters of the network, and the test set is responsible for evaluating the error ∆t of the network. At this point, if the actual measured distance of CPPs at a certain time in the alignment process is input to the network, the preliminary R-P&O calculation result tout1 can be obtained.Figure 2
Flowchart of the RBFNN-DE algorithm.Combining∆t and tout1, we can construct a solution space that may contain the accurate R-P&O and randomly generate multiple values in this space to initialize population g1. Using the difference between individuals in g1, the mutant population v1 was created. Then, we cross v1 with the original population g1 to get the population c1. Finally, we compare the individuals in g1 with those in c1 and select the relatively better individuals to form the new population g2. The process is iterated until the population gm satisfies the terminating condition, and at that time the optimal value tbest is picked from the gm as the final result of the RBFNN-DE algorithm.


## 2.2. Preliminary Estimation Based on RBFNN

As shown in (3), the radial basis function is radial symmetry, defined as a monotone function of the Euclidean distance from any point ℓk to the center point ci, and ϑi represents the width of the function:
(3)zi,i,k=exp−ϑiℓk–ci2.RBFNN with a three-layer structure is constructed as Figure3.Figure 3
RBFNN with a three-layer structure.Through RBFs, the input dataℓk (n dimension) can be projected nonlinearly to the high dimensional space (h dimension). Furthermore, RBFs are combined linearly to obtain the output tk (6 dimensions) which approximates the original function t=fℓ as shown by (4). wid represents the weight of the hidden layer to the output layer:
(4)tkd=∑i=1hwid·zi,i,kd=1,2,…,6,k=1,2,…,h.The parallel distancesℓ can be determined uniquely by ℓ=f−1t according to the inverse kinematics problem (IKP). Thus, we can generate the set Strain containing large amounts of data for training the neural network and the set Stest for testing the performance of RBFNN.In order to simplify the training process, the center of RBF is specified at each training sample, namelyci=ℓii=1,2,…,h;h≫n≥6, and all the width of RBF is set to constant ϑ0. By matrix expression, we can get (5):
(5)t1d⋮thd=z0,1,1…z0,h,1⋮⋱⋮z0,1,h…z0,h,h·w1d⋮whdd=1,2,…,6.Using the least squares method (LSM) and singular value decomposition (SVD) [25], wij can be calculated, which means RBFNN fRBF· for specific workspace W is completely constructed. Given an input ℓin, there is tout1=fRBFℓin.Since the center of RBF is consistent with the training sample, the network may be overfitting with a large error in the setStest. Thus, the network can only estimate the R-P&O preliminarily, and it is necessary to get more accurate results by processing further.


## 2.3. Accurate Computation Based on DE Algorithm

DE is a heuristic random search algorithm based on group differences, including mutation, crossover, and selection process. It is characterized by a differential strategy for individual mutation, global optimization, and good stability. The following are the main steps of DE algorithm.Step 1. Population Initialization.
According to the error∆t displayed on the set Stest and the preliminary result tout1 calculated by RBFNN, the upper bound tH and lower bound tL of the search space are determined. In the search space, NP individuals are randomly generated to form the g generation population according to (6), and U0,1 is used to generate uniform distributed random numbers from 0 to 1:
(6)tig=tL+U0,1·tH−tLi=1,2,…,NP.Step 2. Mutation.
The most obvious feature of the DE algorithm is to utilize the difference vector between individuals to generate a new individual. The method we used is revealed in (7):
(7)tiv=tr1g+F0tr2g−tr3gi=1,2,…,NP.
r1,r2,andr3 are unequal integers in the range 1,NP, while F0 is the variation parameter controlling the influence degree of the difference vector on the new individual. If there is tiv∉tL,tH, the tiv will be assigned again according to (7).Step 3. Crossover.
The purpose of crossover is to further improve the diversity of the population. Equation (8) describes the method of generating a new crossover individual by randomly selecting from the mutation or ordinary individual at every dimension, where CR is called crossover parameter:
(8)ticd=tigdifU0,1≤CR,tivdotherwise,i=1,2,…,NP,d=1,2,…,6.Step 4. Selection.
Equation (9) describes how to select the better individual from ordinary or crossover individuals according to the greedy strategy, which eventually becomes a member of the next generation:
(9)tig+1=tigifferrtig≤ferrtic,ticotherwise,i=1,2,…,NP.Step 5. Iteration.
The above steps will be iterated until reaching maximum iterationsg=Gm or the accuracy restriction ferrtbestg≤δ0. The optimal individual tbest is an accurate estimation of R-P&O.Combining RBFNN and DE, the whole flow of the algorithm in the form of pseudocode is presented in Algorithm1.Algorithm 1: Algorithm Pseudocode.
RBFNN-DE algorithm for R-P&O measuring
Input: the coordinates of CPPs PB,PM; Workspace W; Center Numbers h; spread ϑ0;
PopulationNP; Generation Gm; Accuracy δ0; Variation Parameter F0;
Crossover ParameterCR; Measured Distance ℓin;
Output: The best solution of R-P&O - tbest;
1Off-line neural network training:
2Strain,Stest←ℓ=f−1PB,PM,randomtinW
3TZ←zi,k=exp−ϑ0ℓk−ci2∣ℓ,t∈Strain,i=1,2,…,h
4frbf·←solveWinT=W·ZbySVD
5∆t←∆dt=RMSEfRBFℓ,t∣dim=d,ℓ,t∈Stest
6end training
7On-line DE computing:
8tout1=fRBFℓin
9   Wsub←Rangetout1,∆t
10   t1←GenerateWsub,NP
11whileg<Gmorferrtbest>δ0do
12tv←Mutationtg,F0
13tc←Crossovertg,tv,CR
14tg+1,tbestg←Selecttg,tc
15tbest=tbestg,g=g+1
16end
17return the best solution tbest
18end computing


## 3. Algorithm Simulation and Result Analysis

### 3.1. The Generation of Simulation Data

According to the actual working conditions, a trajectory of the alignment process is simulated. The trajectory is a set of six dimensional vectors, which represent the R-P&O of the dynamic coordinate system observed in the static coordinate system, and each dimension in the vector is continuous on the trajectory. In order to analyze the performance of the algorithm, a number of discrete key frames on the trajectory are picked as representatives. Since the distanceLi of every CPP is known at each frame of the trajectory, the R-P&O can be calculated based on the RBFNN-DE algorithm. Finally, the performance of the algorithm is analyzed by comparing the calculated and simulated trajectory. The main steps of simulation data generation are as follows.Step 1. Delineating the Scope of WorkspaceW.
The virtual alignment conditions can be outlined as follows: the size of the junction surface is2000mm×2000mm, the original distance of components is 5000mm, and the angle of relative orientation is not greater than 25° during the alignment process. These conditions can be expressed by (10):
(10)W=x,y,z,α,β,γ∣x,y≤1000,0<z≤5000,α,β,γ≤25°.Step 2. Defining the Coordinates of CPPsPBandPM.
In the case of using 8 CPPs, the coordinate of each point in the local coordinate system is randomly generated according to (11). It delineates the possible distribution of CPPs P in the cube range:
(11)PB,PM∈X,Y,Z∣X,Y≤1000,Z≤100.Step 3. Creating the Trajectory of Simulated Movement.
The quadratic function is used to create the simulation trajectory of moving coordinate system origin as shown in (12). Each t ranging 10 to 90 is corresponding to a frame of the alignment process:
(12)xyz=0.10.10.49t2+−20−20−99t+10001000500010≤t≤90.At each frame, the orientation of the moving coordinate system satisfies the assumption of 0° to 25°. The orientation should be smaller and smaller, and finally approaching 0°. Therefore, we useU0,25 to create random values ranging from 0° to 25°, and then arrange them in descending order as shown in (13). The final result will correspond to every frame on the trajectory.
(13)α=DescU0,25,U0,25,…,β=DescU0,25,U0,25,…,γ=DescU0,25,U0,25,….After the above settings, the simulation data about alignment trajectory is generated. As Figure4 shows, the moving part will move from top to bottom and rotate, approaching the stationary part. The boxes of the solid line border represent the space in which PB and PM are located, respectively, and the boxes with the dotted border represent the key frames that the PM box will pass through.Figure 4
Simulation alignment trajectory.


### 3.2. Solving Trajectory Based on RBFNN-DE Algorithm

Let the number of the RBF centerh=1000 and randomly generate 1000 samples as the training set and another 1000 samples as the test set in W. Through setting different width ϑ and analyzing the normalized percentage error of R-P&O, the most suitable ϑ can be selected in Figure 5. The larger ϑ means the narrower radius of RBF, a smaller error in the training set but more likely overfitting. To enhance the generalization ability, the fitting function can be smoothed by reducing ϑ. Therefore, the ϑ0=0.01 that has the best performance in the test set is selected.Figure 5
Normalized percentage error in different values ofϑ.The final generated RBFNN is applied to the simulation alignment in Section2.1, and the calculation error of results is presented in Figure 6, in which the uncertainty of the R-P&O is 27.9mm,37.5mm,and32.3mmand1.5°,3.0°,and0.7°. Accordingly, ∆t can be set to 50mm,50mm,and50mmand5°,5°,and5° for the subsequent DE algorithm.Figure 6
The R-P&O errors based on RBFNN algorithm.The average number of iteration and the average time consumption of the DE algorithm are most affected byNP. For analyzing their relationship, let Gm=200,δ0=1E−3,F0=0.6,CR=0.9, and NP=10,20,…,100, respectively. The relationship is illustrated in Figure 7.Figure 7
The relationship between algorithm cost andNP.WhenNP=30, the average number of iteration is 168, and the average time consumption is 0.3 s. The final calculation error is presented in Figure 8.Figure 8
The P&O error based on RBFNN-DE algorithm.The final uncertainty of R-P&O is 0.002 mm, 0.003 mm, and 0.002 mm and 0.0002°, 0.0001°, and 0.0001° in Figure8, and the trajectory solved by the RBFNN-DE algorithm is quite close to the theoretical trajectory, which means that the algorithm is effective and accurate.


### 3.3. The Influence of Other Conditions on Calculation Results

The structure of the measurement model can affect the measurement error, in which the most significant factor is the number of CPPs. Keeping the number of CPPs fixed, the mean value of R-P&O uncertainty is calculated by different CPPs generated randomly. The relationship between the number of CPPs and R-P&O uncertainty is illustrated in Figure9, which reveals that the more number of CPPs, the higher accuracy of results, because of more constraints.Figure 9
The relationship between CPP number and R-P&O uncertainty.Besides, the noise in the distance measurement can also affect the calculation result in the actual alignment process. To illustrate this, the Gauss noise with a standard deviation ofσ is added to the theoretical distances to simulate actual measured values; and to analyze the relationship between σ and the calculated uncertainty of R-P&O in the above measurement model, the R-P&O of 100mm,100mm,and500mmand0.25°,0.25°,and0.25 is chosen. The results in Figure 10 reveals that with the increase of σ the uncertainty increases.Figure 10
The relationship between the noise and uncertainty of R-P&O.According to the accuracy requirements of the R-P&O measurement, the ranging device with corresponding accuracy can be selected from various sensors. For example, when using ultrasonic wave as a ranging signal, the ranging accuracy can reach 0.1 mm, which means the corresponding uncertainty of R-P&O is 0.24 mm and 0.032° in the above measurement model according to Figure10.


## 3.1. The Generation of Simulation Data

According to the actual working conditions, a trajectory of the alignment process is simulated. The trajectory is a set of six dimensional vectors, which represent the R-P&O of the dynamic coordinate system observed in the static coordinate system, and each dimension in the vector is continuous on the trajectory. In order to analyze the performance of the algorithm, a number of discrete key frames on the trajectory are picked as representatives. Since the distanceLi of every CPP is known at each frame of the trajectory, the R-P&O can be calculated based on the RBFNN-DE algorithm. Finally, the performance of the algorithm is analyzed by comparing the calculated and simulated trajectory. The main steps of simulation data generation are as follows.Step 1. Delineating the Scope of WorkspaceW.
The virtual alignment conditions can be outlined as follows: the size of the junction surface is2000mm×2000mm, the original distance of components is 5000mm, and the angle of relative orientation is not greater than 25° during the alignment process. These conditions can be expressed by (10):
(10)W=x,y,z,α,β,γ∣x,y≤1000,0<z≤5000,α,β,γ≤25°.Step 2. Defining the Coordinates of CPPsPBandPM.
In the case of using 8 CPPs, the coordinate of each point in the local coordinate system is randomly generated according to (11). It delineates the possible distribution of CPPs P in the cube range:
(11)PB,PM∈X,Y,Z∣X,Y≤1000,Z≤100.Step 3. Creating the Trajectory of Simulated Movement.
The quadratic function is used to create the simulation trajectory of moving coordinate system origin as shown in (12). Each t ranging 10 to 90 is corresponding to a frame of the alignment process:
(12)xyz=0.10.10.49t2+−20−20−99t+10001000500010≤t≤90.At each frame, the orientation of the moving coordinate system satisfies the assumption of 0° to 25°. The orientation should be smaller and smaller, and finally approaching 0°. Therefore, we useU0,25 to create random values ranging from 0° to 25°, and then arrange them in descending order as shown in (13). The final result will correspond to every frame on the trajectory.
(13)α=DescU0,25,U0,25,…,β=DescU0,25,U0,25,…,γ=DescU0,25,U0,25,….After the above settings, the simulation data about alignment trajectory is generated. As Figure4 shows, the moving part will move from top to bottom and rotate, approaching the stationary part. The boxes of the solid line border represent the space in which PB and PM are located, respectively, and the boxes with the dotted border represent the key frames that the PM box will pass through.Figure 4
Simulation alignment trajectory.


## 3.2. Solving Trajectory Based on RBFNN-DE Algorithm

Let the number of the RBF centerh=1000 and randomly generate 1000 samples as the training set and another 1000 samples as the test set in W. Through setting different width ϑ and analyzing the normalized percentage error of R-P&O, the most suitable ϑ can be selected in Figure 5. The larger ϑ means the narrower radius of RBF, a smaller error in the training set but more likely overfitting. To enhance the generalization ability, the fitting function can be smoothed by reducing ϑ. Therefore, the ϑ0=0.01 that has the best performance in the test set is selected.Figure 5
Normalized percentage error in different values ofϑ.The final generated RBFNN is applied to the simulation alignment in Section2.1, and the calculation error of results is presented in Figure 6, in which the uncertainty of the R-P&O is 27.9mm,37.5mm,and32.3mmand1.5°,3.0°,and0.7°. Accordingly, ∆t can be set to 50mm,50mm,and50mmand5°,5°,and5° for the subsequent DE algorithm.Figure 6
The R-P&O errors based on RBFNN algorithm.The average number of iteration and the average time consumption of the DE algorithm are most affected byNP. For analyzing their relationship, let Gm=200,δ0=1E−3,F0=0.6,CR=0.9, and NP=10,20,…,100, respectively. The relationship is illustrated in Figure 7.Figure 7
The relationship between algorithm cost andNP.WhenNP=30, the average number of iteration is 168, and the average time consumption is 0.3 s. The final calculation error is presented in Figure 8.Figure 8
The P&O error based on RBFNN-DE algorithm.The final uncertainty of R-P&O is 0.002 mm, 0.003 mm, and 0.002 mm and 0.0002°, 0.0001°, and 0.0001° in Figure8, and the trajectory solved by the RBFNN-DE algorithm is quite close to the theoretical trajectory, which means that the algorithm is effective and accurate.


## 3.3. The Influence of Other Conditions on Calculation Results

The structure of the measurement model can affect the measurement error, in which the most significant factor is the number of CPPs. Keeping the number of CPPs fixed, the mean value of R-P&O uncertainty is calculated by different CPPs generated randomly. The relationship between the number of CPPs and R-P&O uncertainty is illustrated in Figure9, which reveals that the more number of CPPs, the higher accuracy of results, because of more constraints.Figure 9
The relationship between CPP number and R-P&O uncertainty.Besides, the noise in the distance measurement can also affect the calculation result in the actual alignment process. To illustrate this, the Gauss noise with a standard deviation ofσ is added to the theoretical distances to simulate actual measured values; and to analyze the relationship between σ and the calculated uncertainty of R-P&O in the above measurement model, the R-P&O of 100mm,100mm,and500mmand0.25°,0.25°,and0.25 is chosen. The results in Figure 10 reveals that with the increase of σ the uncertainty increases.Figure 10
The relationship between the noise and uncertainty of R-P&O.According to the accuracy requirements of the R-P&O measurement, the ranging device with corresponding accuracy can be selected from various sensors. For example, when using ultrasonic wave as a ranging signal, the ranging accuracy can reach 0.1 mm, which means the corresponding uncertainty of R-P&O is 0.24 mm and 0.032° in the above measurement model according to Figure10.


## 4. The Measurement System of R-P&O

### 4.1. Composition of the System

The method proposed in this paper requires the support of a wide-area distance measurement sensor. The sensor should contain two parts: the transmitter and the receiver, and the measuring signal should be sprinkled to cover a certain area of space. As long as the receiver is in the signal coverage area and the signal is received correctly, the measured distance can be calculated according to the time of flight (TOF). When the component is moving, the measurement system is still able to collect the distances between CPPs continuously. The principle of the ranging sensor is presented in Figure11.Figure 11
The principle of the ranging sensor.Based on the principle of ranging, a separate type and high-accuracy ultrasonic ranging device (such as Figure12) has been developed.Figure 12
A pair of ultrasonic ranging device.The size of the device is100mm×120mm×130mm. There are 4 locate holes at the bottom of the shell used to connect with the measured component. The GPS is used as the time synchronization signal, and the ranging accuracy can reach 0.1mm. The sound absorption sponge is used to limit the divergence of the sound wave and suppress multiple bounces of sound waves between the surfaces of the devices. After the data is collected, the result is transmitted back to the host computer by radio frequency (RF). The device is powered by a lithium battery and does not require an external power at work. When multiple devices work simultaneously, the carrier signal ensures that the ultrasonic signal will not be confused and the time-sharing sending ensures that the RF signal will not interfere.


### 4.2. Calibration of the System

Since the method requires knowing the coordinates of CPPs in the coordinates of components, the relative position of CPPs and the locate holes should be calibrated before the device used. Assuming that a CPP is at the center of the ultrasonic sensor surface, the device is calibrated by CMM (such as that shown in Figure13), and the calibration data is shown in Table 1 taking a device as an example. When the devices are installed on the components, the coordinates of CPPs can be converted to the coordinate system of the components by 4 locate holes, to avoid measuring CPPs before every time the device used.Figure 13
The calibration of related points.Table 1
The calibration data of related points.
Items
Transmitter (mm)
Receiver (mm)
P1
(136.5797, 198.6711, 25.3677)
(160.004, 207.020, 27.849)
P2
(136.8717, 197.8665, −53.2702)
(159.801, 207.013, −52.767)
P3
(139.0791, 360.1519, −54.7291)
(160.448, 367.206, −55.189)
P4
(138.9212, 361.0599, 25.9133)
(161.549, 367.649, 25.303)
CP
(240.0718, 276.7984, −12.8065)
(262.018, 283.941, −13.589)Because the real cooperative point of an ultrasonic sensor is not on the surface, the measuring distance is not equal to the distance of CPPs. Thus, there is a systematic error that requires compensation [26]. The following experiment is designed to find the value of compensation for each pair of devices. Since the GPS signal needs to be received outdoors, the repeater of the GPS signal is used to introduce the signal into the room, and the ranging device can work normally in the room (such as Figure 14).Figure 14
The scene of calibration compensation.The receiver is fixed as the center of the circle (such as Figure15), and the transmitter is placed at different positions on the different radii within 30° (the maximum receiving angle of the receiver), when the theoretical distance is measured by CMM as a comparison. The measurement result of one pair of the devices is shown in Table 2, which indicates that the compensation of the device is −53.8mm.Figure 15
Calibration program of compensation.Table 2
The compensation results.
Measured distance (mm)
Compensation (mm)
Average (mm)
R1 = 400
R2 = 300
R3 = 200
R1 = 400
R2 = 300
R3 = 200
455.0
354.8
254.0
−55.0
−54.8
−54.0
−53.8
454.1
354.8
253.4
−54.1
−54.8
−53.4
453.9
354.8
253.7
−53.9
−54.8
−53.7
453.6
354.0
253.0
−53.6
−54.0
−53.0
453.1
354.2
253.0
−53.1
−54.2
−53.0
453.5
354.2
252.7
−53.5
−54.2
−52.7
452.9
353.5
253.0
−52.9
−53.5
−53.0


### 4.3. Verification Experiment of the System

In order to verify the method in actual alignment, a verification experiment of the system, such as Figure16, is constructed. Six pairs of calibrated ultrasonic ranging devices are installed on two 1850mm×550mm-size metal plates laid face to face with the known installation position of the devices. One piece of plate with receivers is immovable and the other with transmitters moves closer to the immovable one in a different orientation. For investigating the accuracy of the R-P&O measurement, 7 measurement results of the moving plate at different locations are picked out for analysis compared with the measurement result of iGPS.Figure 16
The scene of verification experiment.In the experiment, the original input data contains the coordinates of CPPs and the measured distances (as shown in Table3), and the final results are presented in Table 4. The experiment indicates that the maximum value of the R-P&O deviation in each dimension is no more than 2.48mm,3.16mm,and0.33mmand0.02°,0.01°,and0.31°, namely 4.1 mm and 0.32° in the form of a synthetic value, while the ranging accuracy of the sensor is 0.1 mm. The accuracy level is lower than the simulation result of 0.24 mm and 0.032° in Section 2.3 because the metal plate is deformed and the structural parameters of the measurement model are different. However, it is still suitable for some large-volume component alignment processes, such as the assembly of a ship section.Table 3
The input data of the experiment (mm).
Item
Pair 1
Pair 2
Pair 3
Pair 4
Pair 5
Pair 6
Receiver
X
426.031
−350.691
−766.319
−337.964
426.370
783.638
Y
132.743
130.155
−7.470
−134.197
−130.338
1.836
Z
95.793
94.121
81.806
60.307
61.472
81.714
Transmitter
X
430.265
−396.269
−796.962
−391.958
399.483
751.051
Y
117.242
109.542
−13.218
−141.307
−143.271
5.183
Z
−93.806
−96.118
−98.308
−94.688
−93.013
−96.083
Measured distances (average)
I
2287.63
2473.37
2571.82
2490.79
2309.61
2209.95
II
1951.78
2082.84
2156.06
2101.19
1971.83
1894.33
III
1803.37
1870.93
1910.91
1889.29
1821.75
1773.18
IV
1686.21
1716.83
1738.62
1734.51
1702.25
1669.92
V
1534.48
1528.86
1532.92
1547.83
1550.64
1533.55
VI
1233.83
1208.84
1201.53
1224.45
1245.65
1239.34
VII
734.48
765.46
784.15
780.87
748.55
719.57Table 4
R-P&O measurement results.
Item
Id
X (mm)
Y (mm)
Z (mm)
α (°)
β (°)
γ (°)
Measured R-P&O
I
428.940
−192.131
2524.680
3.424
13.442
1.535
II
410.558
−163.237
2159.683
3.174
9.759
1.213
III
272.791
−142.741
1998.588
3.281
5.181
0.525
IV
255.106
−126.683
1863.557
3.488
2.621
0.501
V
205.707
−116.611
1698.162
3.246
0.049
0.250
VI
153.994
−81.481
1391.176
4.080
−1.296
−0.158
VII
90.611
−39.071
926.976
4.196
2.494
0.397
Theoretical R-P&O
I
427.815
−192.249
2524.844
3.387
13.461
1.275
II
411.742
−165.799
2159.235
3.210
9.739
1.456
III
274.801
−142.188
1998.374
3.267
5.189
0.449
IV
252.652
−129.150
1863.695
3.455
2.642
0.189
V
203.383
−113.485
1698.675
3.230
0.071
−0.052
VI
153.406
−83.220
1391.128
4.073
−1.295
−0.176
VII
89.590
−38.500
927.103
4.195
2.504
0.191
Maximum deviation
2.48
3.16
0.33
0.02
0.01
0.31From the above deviation values, it can be seen that the system has a higher position accuracy and lower orientation accuracy in the connection direction of CPPs. The reason is that this direction is the main direction of the distance measurement and the measured distances are insensitive to the rotation angle in this direction.


## 4.1. Composition of the System

The method proposed in this paper requires the support of a wide-area distance measurement sensor. The sensor should contain two parts: the transmitter and the receiver, and the measuring signal should be sprinkled to cover a certain area of space. As long as the receiver is in the signal coverage area and the signal is received correctly, the measured distance can be calculated according to the time of flight (TOF). When the component is moving, the measurement system is still able to collect the distances between CPPs continuously. The principle of the ranging sensor is presented in Figure11.Figure 11
The principle of the ranging sensor.Based on the principle of ranging, a separate type and high-accuracy ultrasonic ranging device (such as Figure12) has been developed.Figure 12
A pair of ultrasonic ranging device.The size of the device is100mm×120mm×130mm. There are 4 locate holes at the bottom of the shell used to connect with the measured component. The GPS is used as the time synchronization signal, and the ranging accuracy can reach 0.1mm. The sound absorption sponge is used to limit the divergence of the sound wave and suppress multiple bounces of sound waves between the surfaces of the devices. After the data is collected, the result is transmitted back to the host computer by radio frequency (RF). The device is powered by a lithium battery and does not require an external power at work. When multiple devices work simultaneously, the carrier signal ensures that the ultrasonic signal will not be confused and the time-sharing sending ensures that the RF signal will not interfere.


## 4.2. Calibration of the System

Since the method requires knowing the coordinates of CPPs in the coordinates of components, the relative position of CPPs and the locate holes should be calibrated before the device used. Assuming that a CPP is at the center of the ultrasonic sensor surface, the device is calibrated by CMM (such as that shown in Figure13), and the calibration data is shown in Table 1 taking a device as an example. When the devices are installed on the components, the coordinates of CPPs can be converted to the coordinate system of the components by 4 locate holes, to avoid measuring CPPs before every time the device used.Figure 13
The calibration of related points.Table 1
The calibration data of related points.
Items
Transmitter (mm)
Receiver (mm)
P1
(136.5797, 198.6711, 25.3677)
(160.004, 207.020, 27.849)
P2
(136.8717, 197.8665, −53.2702)
(159.801, 207.013, −52.767)
P3
(139.0791, 360.1519, −54.7291)
(160.448, 367.206, −55.189)
P4
(138.9212, 361.0599, 25.9133)
(161.549, 367.649, 25.303)
CP
(240.0718, 276.7984, −12.8065)
(262.018, 283.941, −13.589)Because the real cooperative point of an ultrasonic sensor is not on the surface, the measuring distance is not equal to the distance of CPPs. Thus, there is a systematic error that requires compensation [26]. The following experiment is designed to find the value of compensation for each pair of devices. Since the GPS signal needs to be received outdoors, the repeater of the GPS signal is used to introduce the signal into the room, and the ranging device can work normally in the room (such as Figure 14).Figure 14
The scene of calibration compensation.The receiver is fixed as the center of the circle (such as Figure15), and the transmitter is placed at different positions on the different radii within 30° (the maximum receiving angle of the receiver), when the theoretical distance is measured by CMM as a comparison. The measurement result of one pair of the devices is shown in Table 2, which indicates that the compensation of the device is −53.8mm.Figure 15
Calibration program of compensation.Table 2
The compensation results.
Measured distance (mm)
Compensation (mm)
Average (mm)
R1 = 400
R2 = 300
R3 = 200
R1 = 400
R2 = 300
R3 = 200
455.0
354.8
254.0
−55.0
−54.8
−54.0
−53.8
454.1
354.8
253.4
−54.1
−54.8
−53.4
453.9
354.8
253.7
−53.9
−54.8
−53.7
453.6
354.0
253.0
−53.6
−54.0
−53.0
453.1
354.2
253.0
−53.1
−54.2
−53.0
453.5
354.2
252.7
−53.5
−54.2
−52.7
452.9
353.5
253.0
−52.9
−53.5
−53.0


## 4.3. Verification Experiment of the System

In order to verify the method in actual alignment, a verification experiment of the system, such as Figure16, is constructed. Six pairs of calibrated ultrasonic ranging devices are installed on two 1850mm×550mm-size metal plates laid face to face with the known installation position of the devices. One piece of plate with receivers is immovable and the other with transmitters moves closer to the immovable one in a different orientation. For investigating the accuracy of the R-P&O measurement, 7 measurement results of the moving plate at different locations are picked out for analysis compared with the measurement result of iGPS.Figure 16
The scene of verification experiment.In the experiment, the original input data contains the coordinates of CPPs and the measured distances (as shown in Table3), and the final results are presented in Table 4. The experiment indicates that the maximum value of the R-P&O deviation in each dimension is no more than 2.48mm,3.16mm,and0.33mmand0.02°,0.01°,and0.31°, namely 4.1 mm and 0.32° in the form of a synthetic value, while the ranging accuracy of the sensor is 0.1 mm. The accuracy level is lower than the simulation result of 0.24 mm and 0.032° in Section 2.3 because the metal plate is deformed and the structural parameters of the measurement model are different. However, it is still suitable for some large-volume component alignment processes, such as the assembly of a ship section.Table 3
The input data of the experiment (mm).
Item
Pair 1
Pair 2
Pair 3
Pair 4
Pair 5
Pair 6
Receiver
X
426.031
−350.691
−766.319
−337.964
426.370
783.638
Y
132.743
130.155
−7.470
−134.197
−130.338
1.836
Z
95.793
94.121
81.806
60.307
61.472
81.714
Transmitter
X
430.265
−396.269
−796.962
−391.958
399.483
751.051
Y
117.242
109.542
−13.218
−141.307
−143.271
5.183
Z
−93.806
−96.118
−98.308
−94.688
−93.013
−96.083
Measured distances (average)
I
2287.63
2473.37
2571.82
2490.79
2309.61
2209.95
II
1951.78
2082.84
2156.06
2101.19
1971.83
1894.33
III
1803.37
1870.93
1910.91
1889.29
1821.75
1773.18
IV
1686.21
1716.83
1738.62
1734.51
1702.25
1669.92
V
1534.48
1528.86
1532.92
1547.83
1550.64
1533.55
VI
1233.83
1208.84
1201.53
1224.45
1245.65
1239.34
VII
734.48
765.46
784.15
780.87
748.55
719.57Table 4
R-P&O measurement results.
Item
Id
X (mm)
Y (mm)
Z (mm)
α (°)
β (°)
γ (°)
Measured R-P&O
I
428.940
−192.131
2524.680
3.424
13.442
1.535
II
410.558
−163.237
2159.683
3.174
9.759
1.213
III
272.791
−142.741
1998.588
3.281
5.181
0.525
IV
255.106
−126.683
1863.557
3.488
2.621
0.501
V
205.707
−116.611
1698.162
3.246
0.049
0.250
VI
153.994
−81.481
1391.176
4.080
−1.296
−0.158
VII
90.611
−39.071
926.976
4.196
2.494
0.397
Theoretical R-P&O
I
427.815
−192.249
2524.844
3.387
13.461
1.275
II
411.742
−165.799
2159.235
3.210
9.739
1.456
III
274.801
−142.188
1998.374
3.267
5.189
0.449
IV
252.652
−129.150
1863.695
3.455
2.642
0.189
V
203.383
−113.485
1698.675
3.230
0.071
−0.052
VI
153.406
−83.220
1391.128
4.073
−1.295
−0.176
VII
89.590
−38.500
927.103
4.195
2.504
0.191
Maximum deviation
2.48
3.16
0.33
0.02
0.01
0.31From the above deviation values, it can be seen that the system has a higher position accuracy and lower orientation accuracy in the connection direction of CPPs. The reason is that this direction is the main direction of the distance measurement and the measured distances are insensitive to the rotation angle in this direction.


## 5. Conclusion

In this paper, a novel method for R-P&O measurement of large-volume components is proposed. Firstly, the model of R-P&O measurement by parallel ranging is established, and the solution method based on the RBFNN-DE algorithm is proposed, where RBFNN is to get the preliminary solution by a trained network and DE is to obtain the accuracy solution by heuristic random searching.Then, taking the simulation trajectory as a sample, the basis of the critical parameters in the algorithm is given. The calculation results of the simulation experiment prove that the accuracy of the measured R-P&O is superior to0.003mm and 0.0002°. Furthermore, the influence of the number of CPPs and ranging noise on the algorithm individually is given. In the condition of simulated ranging accuracy reaching 0.1 mm, the calculated accuracy of R-P&O is 0.24 mm and 0.032°.Finally, the self-developed ranging device according to the requirements of measuring R-P&O is introduced. Meanwhile, the calibration experiment of the device is described, in which the installation parameters and compensation of the device are obtained. Afterwards, using six pairs of ranging devices and two pieces of metal plate, an actual alignment verification experiment is built. Compared with the measurement data of iGPS, the maximum value of R-P&O deviation is no more than 4.1 mm and 0.32° in the form of a synthetic value, while the ranging accuracy of the sensor is 0.1 mm. The experiment verifies that the novel R-P&O measurement method is effective and accurate comparing to the large volume.The measurement accuracy of R-P&O can be improved by reducing ranging error and increasing the number of CPPs. Thus, a ranging device with higher accuracy that supports multiple sensors to work simultaneously will be the focus of future research. Meanwhile, the dynamic performance of the system in tracking the R-P&O based on this method will be studied.



---

*Source: 2404825-2018-09-04.xml*