# Random Target Localization for an Upper Limb Prosthesis

Authors: Xinglei Zhang; Binghui Fan; Chuanjiang Wang; Xiaolin Cheng; Hongguang Feng; Zhaohui Tian
Journal: Shock and Vibration
 (2021)

---

## Abstract

To achieve the purpose of accurately grasping a random target with the upper limb prosthesis, the acquisition of target localization information is especially important. For this reason, a novel type of random target localization algorithm is proposed. Firstly, an initial localization algorithm (ILA) that uses two 3D attitude sensors and a laser range sensor to detect the target attitude and distance is presented. Secondly, an error correction algorithm where a multipopulation genetic algorithm (MPGA) optimizes backpropagation neural network (BPNN) is utilized to improve the accuracy of ILA. Thirdly, a general regression neural network (GRNN) algorithm is proposed to calculate the joint angles, which are used to control the upper limb prosthetic gripper to move to the target position. Finally, the proposed algorithm is applied to the 5-DOF upper limb prosthesis, and the simulations and experiments are proved to demonstrate the validity of the proposed localization algorithm and inverse kinematics (IK) algorithm.


---

## Body

## 1. Introduction

According to the 2006 China National Disability Sample Survey, there were 2.26 million amputees, accounting for approximately 9.37% of the disabled [1]. From the information provided by the National Limb Loss Information Center, in 2005, there were 1.6 million who lost a limb in the United States, and this number is expected to reach 3.6 million by 2050 [2]. A large proportion of these amputees are upper limb amputees who do not have the means to perform some daily activities, such as drinking water, eating, and dressing. Upper limb prostheses that can capture and move objects according to the wearer’s needs are wearable robots from the perspective of human–computer integration [3]. However, for upper limb prostheses, the pose (position and orientation) information of a random target is not fixed, and inverse kinematics (IK) solution cannot be determined. Unfortunately, research on random target localization algorithms is mostly seen in the fields of mobile robots and industrial robots and rare in the field of upper limb prostheses. Therefore, how to accurately obtain the pose information of a random target has become a difficult problem that researchers need to urgently address.Cao et al. [4] studied a method of using machine vision and a neural network (NN) to decrease the absolute position error of the robot. However, the NN was easily trapped in a local solution, which led to instability in the localization accuracy. Jiang et al. [5] proposed an algorithm which combined particle swarm optimization algorithm with back propagation neural network (BPNN) to solve the IK solution of the UR3 robot. However, there was a lack of blindness in the selection of the step size, which affected the accuracy of the solution. Yi et al. [6] proposed a positioning system using optical flow sensor based on the sensor fusion technique, However, in low-light and slippery environments, the system generates large errors. Jung et al. [7] selected the pose of robot by extracting the initial state of the surrounding environment of the robot and determined the sample distribution according to the given area map. The positioning success was determined by calculating the similarity between the robot sensor state and the estimated posture on a given map. But the positioning accuracy is greatly affected by the environment.The research object of this paper is 5 degrees of freedom (DOF) upper limb prosthesis, as shown in Figure1. It is not a commercial product, but a product developed by the research group and is an internal product of the laboratory. The remainder of this paper is structured as follows. In Section 2, the kinematic of the upper limb prosthesis is analyzed. The localization algorithm is introduced in Section 3. In Section 2.2, the IK algorithm is addressed. The proposed algorithm is validated through simulations and experiments in Section 4. Finally, Section 5 provides conclusions and future work.Figure 1
5-DOF upper limb prosthesis.


## 2. Kinematic Analysis

### 2.1. Forward Kinematics

The relationship among the joint coordinate systems is illustrated in Figure2, and the D-H parameters are shown in Table 1.Figure 2
The coordinate systems of the upper limb prosthesis.Table 1
D-H parameters of the upper limb prosthesis.
Joint (i)θi (rad)di (mm)ai (mm)αi (rad)Angle range (rad)1θ1000π/2（−π/9, π/2)2θ2−π/22950−π/2（−5π/6, 5π/18)3θ3000π/2（0, 5π/6)4θ402120−π/2（−5π/9, 5π/9)5θ5−π/20100π/2（−5π/6, π/6)(1)ii−1T=ci−sicαisisαiaicisicicαi−cisαiaisi0sαicαidi0001,wheresi=sinθi, ci=cosθi, sαi=sinαi, and cαi=cosαi.The pose of end-effector (EE) in the base coordinate system is described asn0T:(2)n0T=10Tθ1T21θ2…Tnn−1θn.Whenθ1,θ2…θn is known, solving the pose of the EE in the base coordinate system is called positive kinematics. Conversely, when the pose of the EE in the base coordinate system is known, solving the joint angle is called IK.Drinking water is a common activity in real life. To avoid the overflow of water from the cup during the movement of the upper limb prosthesis, this paper uses an MPU6050 hand attitude sensor to control the gripper to always hold and move in the horizontal direction. Therefore, the EE coordinate system is described as in the coordinate systemo3−x3y3z3. Additionally, the EE coordinate system is described as 50T in the base coordinate system.(3)T50=Tθ0T10θ1T21θ2T32θ3Q,=100295sin1+212sin1cos3+212cos1cos2sin3010−212sin2sin3001212cos2sin1sin3−212cos1cos3−295cos10001.Because the attitude information of the gripping object is simplified, the key problem of the IK solution becomes obtaining the exact position of a random target.


### 2.2. IK Algorithm

According to equation (3) and the output values of MPGA-BPNN, the following equations can be obtained:(4)295sin1+212sin1cos3+212cos1cos2sin3=xim,−212sin2sin3=yim,212cos2sin1sin3−212cos1cos3−295cos1=zim.Through equation (4), the angular values of the front three joints can be obtained. However, this is a complex set of nonlinear transcendental equations that has no analytical solution. Therefore, a method for solving transcendental equations by using the fast nonlinear approximation ability of a general regression neural network (GRNN) [9–11] is use d in this paper. Once the learning samples are determined, the connection weights between the corresponding network structure and neurons are also determined. When using a GRNN to solve the problem, we need to complete the following work. First, in view of the training time and accuracy requirements, θii=1,2,3 are evenly dispersed into 100 copies in the range of the joint angle change, and then the prosthetic joint space θk=θ1k,θ2k,θ3kTk=1,2…100 is obtained and saved as the Q matrix, which is used as the target sample of the GRNN. Then, the corresponding coordinates px,py,pzT are obtained by substituting θk into the first three rows of the fourth column of equation (3) and saved as the Smatrix, which is used as the input samples of GRNN. In this way, the IK solution model is established.


## 2.1. Forward Kinematics

The relationship among the joint coordinate systems is illustrated in Figure2, and the D-H parameters are shown in Table 1.Figure 2
The coordinate systems of the upper limb prosthesis.Table 1
D-H parameters of the upper limb prosthesis.
Joint (i)θi (rad)di (mm)ai (mm)αi (rad)Angle range (rad)1θ1000π/2（−π/9, π/2)2θ2−π/22950−π/2（−5π/6, 5π/18)3θ3000π/2（0, 5π/6)4θ402120−π/2（−5π/9, 5π/9)5θ5−π/20100π/2（−5π/6, π/6)(1)ii−1T=ci−sicαisisαiaicisicicαi−cisαiaisi0sαicαidi0001,wheresi=sinθi, ci=cosθi, sαi=sinαi, and cαi=cosαi.The pose of end-effector (EE) in the base coordinate system is described asn0T:(2)n0T=10Tθ1T21θ2…Tnn−1θn.Whenθ1,θ2…θn is known, solving the pose of the EE in the base coordinate system is called positive kinematics. Conversely, when the pose of the EE in the base coordinate system is known, solving the joint angle is called IK.Drinking water is a common activity in real life. To avoid the overflow of water from the cup during the movement of the upper limb prosthesis, this paper uses an MPU6050 hand attitude sensor to control the gripper to always hold and move in the horizontal direction. Therefore, the EE coordinate system is described as in the coordinate systemo3−x3y3z3. Additionally, the EE coordinate system is described as 50T in the base coordinate system.(3)T50=Tθ0T10θ1T21θ2T32θ3Q,=100295sin1+212sin1cos3+212cos1cos2sin3010−212sin2sin3001212cos2sin1sin3−212cos1cos3−295cos10001.Because the attitude information of the gripping object is simplified, the key problem of the IK solution becomes obtaining the exact position of a random target.


## 2.2. IK Algorithm

According to equation (3) and the output values of MPGA-BPNN, the following equations can be obtained:(4)295sin1+212sin1cos3+212cos1cos2sin3=xim,−212sin2sin3=yim,212cos2sin1sin3−212cos1cos3−295cos1=zim.Through equation (4), the angular values of the front three joints can be obtained. However, this is a complex set of nonlinear transcendental equations that has no analytical solution. Therefore, a method for solving transcendental equations by using the fast nonlinear approximation ability of a general regression neural network (GRNN) [9–11] is use d in this paper. Once the learning samples are determined, the connection weights between the corresponding network structure and neurons are also determined. When using a GRNN to solve the problem, we need to complete the following work. First, in view of the training time and accuracy requirements, θii=1,2,3 are evenly dispersed into 100 copies in the range of the joint angle change, and then the prosthetic joint space θk=θ1k,θ2k,θ3kTk=1,2…100 is obtained and saved as the Q matrix, which is used as the target sample of the GRNN. Then, the corresponding coordinates px,py,pzT are obtained by substituting θk into the first three rows of the fourth column of equation (3) and saved as the Smatrix, which is used as the input samples of GRNN. In this way, the IK solution model is established.


## 3. Localization Algorithm

### 3.1. Initial Localization Algorithm (ILA)

The three-dimensional attitude sensor [12], which relies on geomagnetic localization, aggregates three-axis acceleration, a three-axis gyroscope, and a three-axis magnetometer. This attitude sensor can detect and describe three-dimensional pose changes with respect to Earth coordinates (roll direction, pitch direction, and yaw direction). To obtain a random target initial position, two attitude sensors (MPU9250) and a distance sensor (CY30) need to be installed on the wearer, as shown in Figure 3. Attitude sensor 1 is installed on the artificial limb shoulder to calibrate the attitude with the rotation of the body, and attitude sensor 2 is installed on the head of the wearer to detect head movement relative to attitude sensor 1. When the wearer’s head is upright and looking straight ahead, the attitude data of sensor 1 and sensor 2 are consistent, and this moment is described as the preliminary state. When the wearer’s head turns up and down or turns left and right, the upper limb prosthesis can obtain the rotation or pitch angle of the head relative to the wearer’s body by comparing the data of attitude sensor 1 and attitude sensor 2. To confirm the operation target distance, a laser range sensor is installed on the side of the head (left ear) and emits a laser projected onto the operation target by adjusting the head attitude.Figure 3
Schematic diagram of the installed sensors. 1: artificial limb; 2: attitude sensor 1; 3: attitude sensor 2; and 4: laser range sensor.The coordinate systems are shown in Figure4. S is the prosthetic basic coordinate system, N is the coordinate system about the middle of the neck, H is the coordinate system about the middle of the head, and E is the laser range sensor coordinate system. When the user’s head turns up and down, it is equivalent to N coordinates rotating by an angle βs around the S coordinates of the 0,0,zn axis, and the origin of the N coordinate system is fixed at 0,0,znrelative to the origin of the S coordinate system. When the user shakes his head left and right, it is equivalent to H coordinates rotating by an angle 0,0,zn around the N coordinates of the 0,0,zn axis, and the origin of the H coordinate system is fixed at 0,0,zn relative to the origin of the N coordinate system. When the head is in the preliminary state, the origin of the E coordinate system is set in the positive direction of the βh axis about the H coordinate system, and the βh axis of the E coordinate system coincides with the βh axis of the H coordinate system. Furthermore, the βh axis of the E coordinate system coincides with the direction of the laser beam, and the βh axis of the E coordinate system and βh axis of the H coordinate system form a fixed angle βh, which is equivalent to the E coordinate system rotating around the KNS axis of the H coordinate system. The origin of the E coordinate system is fixed at KNS relative to the origin of the H coordinate system.Figure 4
Schematic diagram of a random targetM.By comparing the relative attitude angle discrepancy between the two three-dimensional attitude sensors, the homogeneous transformation matrix of theN coordinate system to the S coordinate system KNS can be derived as follows:(5)KNS=cosβs0sinβsxs010ys−sinβs0cosβszs0001.In the same way,(6)KHN=cosγnsinγn00sinγncosγn00001zn0001,(7)KEH=cosβhsinβh00010yhsinβh0cosβh00001.The target distance measured by the laser ranging sensor isd, and its homogeneous matrix D is(8)D=dxdydz1T=d001T.An upper limb prosthesis controller for the wearer that has a random target coordinate calculation program is prepared. By adjusting the head attitude, the wearer projects the laser emitted onto the operation target. Through coordinate transformation, the position of the targetM in the S coordinate system can be obtained.(9)P=KNS⋅KHN⋅KEH⋅D=znsinβs−dsinβhsinβs−cosβhcosβscosγn−yhsinγncosβs+xsyhcosγn+dsinγncosβh+yszscosβs−dcosβssinβh+cosβhcosγnsinβs+yhsinβssinγn+zs1,where xs,ys,zs,zn,yh are associated with the physical parameters of the wearer, and the rotation angles βs and γn are found by comparing the data from the two attitude sensors. βh depends on the installation position of the laser range sensor on the wearer’s head.


### 3.2. Error Analysis

Although the ILA can locate a target in an unstructured environment, the attitude sensor used in the localization system is based on the principle of inertial attitude measurement. Drift accumulation error and the magnetic bias can produce positioning errors. In actual random localization experiments, we collected 100 deviation values from the three-dimensional attitude sensors relative to the roll, pitch, and yaw directions of the Earth. The detection accuracy of the two three-dimensional attitude sensors relative to the deviations in the roll and pitch directions of the Earth is relatively high (no more than 1°). However, the detection accuracy of the two three-dimensional attitude sensors relative to the deviation in the Earth’s yaw direction is poor (approximately 10°). This is very unfavorable for the purpose of determining the localization of a random target. Through histogram analysis of 100 data points in the yaw direction, it is found that the distribution of this group of data basically conforms to a Gaussian distribution. Therefore, we set a fixed sampling period for the deviation values of the two attitude sensors in the yaw direction to collect and calculate 100 values of the deviation in the yaw direction each time and then to calculate their mathematical expectations. The distribution curves of the deviation values before and after processing by this method are shown in Figure5. Although this method improves the stability of the random target location of the upper limb prosthesis, localization accuracy still needs to be improved.Figure 5
Distribution curves before and after numerical treatment of the deviation in the yaw direction.In addition, structural clearance and installation angle errors will inevitably occur in the process of prosthetic limb assembly. There are many reasons for the errors that ultimately reduce the localization accuracy of the system. The red laser spot in Figure6 represents the desired position. It is obvious that the actual position of the gripper center deviates from the desired position. Also, the errors between the initial positioning coordinates and the desired position coordinates are shown in Figure 7. It is found that the positioning error by ILA is approximately 28 mm, which cannot meet the wearer’s requirements. Therefore, based on ILA, this paper further uses an error correction algorithm to improve the localization accuracy.Figure 6
Difference between the desired position and the actual position of the gripper center.Figure 7
The error in thex-, y-, and z-directions between the initial positioning coordinates and the desired position coordinates.


### 3.3. Error Correction Algorithm

#### 3.3.1. BPNN Algorithm

NNs are currently popular in machine learning. Among them, BPNN is a multilayer feedforward NN whose characteristics are forward signal transmission and error back propagation. In the forward transmission process, the signal is processed layer by layer from the input layer through the hidden layer to the output layer. If the output layer cannot obtain the desired output, the signal is transmitted to back propagation, and the weight and threshold are adjusted according to the prediction error, so that the output of BPNN continues to be close to the expected output [13–15]. It is known that BPNN containing a hidden layer has sufficient accuracy to approximate any continuous function [16]. Figure 8 shows BPNN topology diagram, where xip,yip,zip are the initial location coordinates of the target point and are obtained by the method described in Section 3.1. xit,yit,zit are actual measured values of the target points corresponding to the aforementioned xip,yip,zip.Figure 8
Architecture of BPNN.Because the initial weight and threshold are random, with the training of the BPNN, the weight and threshold will be constantly updated, and eventually the weight and threshold will converge to a certain value. However, the gradient descent training algorithm of the BPNN may produce local minima. Evolutionary algorithms (EAs) can be effectively used to find the optimal weight and threshold globally without calculating gradient information [17]. EAs include simulated annealing algorithm (SAA) [18, 19], particle swarm optimization (PSO) [20, 21], and genetic algorithm (GA). Compared with SAA and PSO, GA has the advantages of efficient heuristic search and parallel computing and has been widely used in function optimization and combination optimization. Therefore, this paper uses a GA combined with the BPNN (called GA-BPNN) to solve the problem that the BPNN falls into local minima solutions.


#### 3.3.2. GA-BPNN Algorithm

A GA is an optimization method based on natural selection mechanism in the process of biological evolution [22–24]. This paper uses GA’s global search ability to search the optimal weights and thresholds of BPNN. Then, the prediction model with the optimal weight and threshold of BPNN is established, referred to as GA-BPNN. Figure 9 is a flowchart of GA-BPNN algorithm.Figure 9
Framework of GA-BPNN.The deviation of the output valuesxi,yi,zi of the BPNN and the actual measured values is taken as the objective function of the GA, defined as follows:(10)Ei=xi−xit2+yi−yit2+zi−zit2.The goal of GA is to find the weight and threshold of BPNN with the least sum of squares in all evolutionary generations and to develop in the direction of increasing the value of the fitness function. It is constructed as follows:(11)fitness=11+Ei.GAs include single-population genetic algorithm (SPGA) and multiple-population genetic algorithm (MPGA). The early SPGA is popular, but there are some shortcomings, such as premature convergence, poor local search ability, and serious assimilation of the late population. For this reason, multipopulation genetic algorithm (MPGA) [25, 26] was proposed. Besides of solving the shortcomings of single-population genetic algorithm, the convergence speed and accuracy have been improved. This paper uses MPGA and SPGA to search the optimal weights and thresholds of BPNN (called MPGA-BPNN and SPGA-BPNN, resp.) and observes the changes of fitness values obtained by these two algorithms. The specific parameters of the SPGA and MPGA are as follows:(a)
SPGA: binary coding, roulette selection, and single-point crossover. The crossover probability is 0.85, and the mutation probability is 0.07. The evolutionary algebra is set to 200, and the total number of individuals is 1000.(b)
MPGA: binary coding, roulette selection, and multipoint crossover. The crossover probability and the mutation probability of various groups are randomly generated in [0.4, 0.9] and [0.005, 0.1], respectively, and the immigration operator and artificial selection operator are introduced. The evolutionary algebra is set to 200, the number of populations is 10, and the number of individual populations is 100.


#### 3.3.3. GA Evaluation

With the operation of SPGA-BPNN and MPGA-BPNN, the changes curve of fitness value is obtained, as shown in Figure10. It is not difficult to find that the best fitness value obtained by MPGA is 0.996, which is much higher than the 0.56 obtained by SPGA. Therefore, this paper chooses MPGA-BPNN as error correction algorithm of ILA.Figure 10
The changes of fitness value.After the training, theEi and the average absolute error (AAE) Es of the output values of the MPGA-BPNN relative to the actual measurement value are obtained by (15) and (19). To evaluate the error correction ability of MPGA-BPNN, Es of the ILA, BPNN, and SPGA-BPNN are introduced as follows:(12)Eip=xip−xit+yip−yit2+zip−zii2,(13)Eib=xib−xit+yib−yit2+zib−z2,(14)Eis=xis−xit+yis−yit2+zis−zit2,(15)Eim=xim−xit+yim−yit2+zim−zit2,(16)Esp=1N∑i=1Nxip−xit2+yip−yit2+zip−zit2,(17)Esb=1N∑i=1Nxib−xit2+yib−yit2+zib−zit2,(18)Ess=1N∑i=1Nxis−xit2+yis−yit2+zis−zit2,(19)Esm=1N∑i=1Nxim−xit2+yim−yit2+zim−zit2,where, xib,yib,zib are the output values of BPNN, xis,yis,zis are the output values of SPGA-BPNN, xim,yim,zim are the output values of MPGA-BPNN, and N is the number of test points.


## 3.1. Initial Localization Algorithm (ILA)

The three-dimensional attitude sensor [12], which relies on geomagnetic localization, aggregates three-axis acceleration, a three-axis gyroscope, and a three-axis magnetometer. This attitude sensor can detect and describe three-dimensional pose changes with respect to Earth coordinates (roll direction, pitch direction, and yaw direction). To obtain a random target initial position, two attitude sensors (MPU9250) and a distance sensor (CY30) need to be installed on the wearer, as shown in Figure 3. Attitude sensor 1 is installed on the artificial limb shoulder to calibrate the attitude with the rotation of the body, and attitude sensor 2 is installed on the head of the wearer to detect head movement relative to attitude sensor 1. When the wearer’s head is upright and looking straight ahead, the attitude data of sensor 1 and sensor 2 are consistent, and this moment is described as the preliminary state. When the wearer’s head turns up and down or turns left and right, the upper limb prosthesis can obtain the rotation or pitch angle of the head relative to the wearer’s body by comparing the data of attitude sensor 1 and attitude sensor 2. To confirm the operation target distance, a laser range sensor is installed on the side of the head (left ear) and emits a laser projected onto the operation target by adjusting the head attitude.Figure 3
Schematic diagram of the installed sensors. 1: artificial limb; 2: attitude sensor 1; 3: attitude sensor 2; and 4: laser range sensor.The coordinate systems are shown in Figure4. S is the prosthetic basic coordinate system, N is the coordinate system about the middle of the neck, H is the coordinate system about the middle of the head, and E is the laser range sensor coordinate system. When the user’s head turns up and down, it is equivalent to N coordinates rotating by an angle βs around the S coordinates of the 0,0,zn axis, and the origin of the N coordinate system is fixed at 0,0,znrelative to the origin of the S coordinate system. When the user shakes his head left and right, it is equivalent to H coordinates rotating by an angle 0,0,zn around the N coordinates of the 0,0,zn axis, and the origin of the H coordinate system is fixed at 0,0,zn relative to the origin of the N coordinate system. When the head is in the preliminary state, the origin of the E coordinate system is set in the positive direction of the βh axis about the H coordinate system, and the βh axis of the E coordinate system coincides with the βh axis of the H coordinate system. Furthermore, the βh axis of the E coordinate system coincides with the direction of the laser beam, and the βh axis of the E coordinate system and βh axis of the H coordinate system form a fixed angle βh, which is equivalent to the E coordinate system rotating around the KNS axis of the H coordinate system. The origin of the E coordinate system is fixed at KNS relative to the origin of the H coordinate system.Figure 4
Schematic diagram of a random targetM.By comparing the relative attitude angle discrepancy between the two three-dimensional attitude sensors, the homogeneous transformation matrix of theN coordinate system to the S coordinate system KNS can be derived as follows:(5)KNS=cosβs0sinβsxs010ys−sinβs0cosβszs0001.In the same way,(6)KHN=cosγnsinγn00sinγncosγn00001zn0001,(7)KEH=cosβhsinβh00010yhsinβh0cosβh00001.The target distance measured by the laser ranging sensor isd, and its homogeneous matrix D is(8)D=dxdydz1T=d001T.An upper limb prosthesis controller for the wearer that has a random target coordinate calculation program is prepared. By adjusting the head attitude, the wearer projects the laser emitted onto the operation target. Through coordinate transformation, the position of the targetM in the S coordinate system can be obtained.(9)P=KNS⋅KHN⋅KEH⋅D=znsinβs−dsinβhsinβs−cosβhcosβscosγn−yhsinγncosβs+xsyhcosγn+dsinγncosβh+yszscosβs−dcosβssinβh+cosβhcosγnsinβs+yhsinβssinγn+zs1,where xs,ys,zs,zn,yh are associated with the physical parameters of the wearer, and the rotation angles βs and γn are found by comparing the data from the two attitude sensors. βh depends on the installation position of the laser range sensor on the wearer’s head.


## 3.2. Error Analysis

Although the ILA can locate a target in an unstructured environment, the attitude sensor used in the localization system is based on the principle of inertial attitude measurement. Drift accumulation error and the magnetic bias can produce positioning errors. In actual random localization experiments, we collected 100 deviation values from the three-dimensional attitude sensors relative to the roll, pitch, and yaw directions of the Earth. The detection accuracy of the two three-dimensional attitude sensors relative to the deviations in the roll and pitch directions of the Earth is relatively high (no more than 1°). However, the detection accuracy of the two three-dimensional attitude sensors relative to the deviation in the Earth’s yaw direction is poor (approximately 10°). This is very unfavorable for the purpose of determining the localization of a random target. Through histogram analysis of 100 data points in the yaw direction, it is found that the distribution of this group of data basically conforms to a Gaussian distribution. Therefore, we set a fixed sampling period for the deviation values of the two attitude sensors in the yaw direction to collect and calculate 100 values of the deviation in the yaw direction each time and then to calculate their mathematical expectations. The distribution curves of the deviation values before and after processing by this method are shown in Figure5. Although this method improves the stability of the random target location of the upper limb prosthesis, localization accuracy still needs to be improved.Figure 5
Distribution curves before and after numerical treatment of the deviation in the yaw direction.In addition, structural clearance and installation angle errors will inevitably occur in the process of prosthetic limb assembly. There are many reasons for the errors that ultimately reduce the localization accuracy of the system. The red laser spot in Figure6 represents the desired position. It is obvious that the actual position of the gripper center deviates from the desired position. Also, the errors between the initial positioning coordinates and the desired position coordinates are shown in Figure 7. It is found that the positioning error by ILA is approximately 28 mm, which cannot meet the wearer’s requirements. Therefore, based on ILA, this paper further uses an error correction algorithm to improve the localization accuracy.Figure 6
Difference between the desired position and the actual position of the gripper center.Figure 7
The error in thex-, y-, and z-directions between the initial positioning coordinates and the desired position coordinates.


## 3.3. Error Correction Algorithm

### 3.3.1. BPNN Algorithm

NNs are currently popular in machine learning. Among them, BPNN is a multilayer feedforward NN whose characteristics are forward signal transmission and error back propagation. In the forward transmission process, the signal is processed layer by layer from the input layer through the hidden layer to the output layer. If the output layer cannot obtain the desired output, the signal is transmitted to back propagation, and the weight and threshold are adjusted according to the prediction error, so that the output of BPNN continues to be close to the expected output [13–15]. It is known that BPNN containing a hidden layer has sufficient accuracy to approximate any continuous function [16]. Figure 8 shows BPNN topology diagram, where xip,yip,zip are the initial location coordinates of the target point and are obtained by the method described in Section 3.1. xit,yit,zit are actual measured values of the target points corresponding to the aforementioned xip,yip,zip.Figure 8
Architecture of BPNN.Because the initial weight and threshold are random, with the training of the BPNN, the weight and threshold will be constantly updated, and eventually the weight and threshold will converge to a certain value. However, the gradient descent training algorithm of the BPNN may produce local minima. Evolutionary algorithms (EAs) can be effectively used to find the optimal weight and threshold globally without calculating gradient information [17]. EAs include simulated annealing algorithm (SAA) [18, 19], particle swarm optimization (PSO) [20, 21], and genetic algorithm (GA). Compared with SAA and PSO, GA has the advantages of efficient heuristic search and parallel computing and has been widely used in function optimization and combination optimization. Therefore, this paper uses a GA combined with the BPNN (called GA-BPNN) to solve the problem that the BPNN falls into local minima solutions.


### 3.3.2. GA-BPNN Algorithm

A GA is an optimization method based on natural selection mechanism in the process of biological evolution [22–24]. This paper uses GA’s global search ability to search the optimal weights and thresholds of BPNN. Then, the prediction model with the optimal weight and threshold of BPNN is established, referred to as GA-BPNN. Figure 9 is a flowchart of GA-BPNN algorithm.Figure 9
Framework of GA-BPNN.The deviation of the output valuesxi,yi,zi of the BPNN and the actual measured values is taken as the objective function of the GA, defined as follows:(10)Ei=xi−xit2+yi−yit2+zi−zit2.The goal of GA is to find the weight and threshold of BPNN with the least sum of squares in all evolutionary generations and to develop in the direction of increasing the value of the fitness function. It is constructed as follows:(11)fitness=11+Ei.GAs include single-population genetic algorithm (SPGA) and multiple-population genetic algorithm (MPGA). The early SPGA is popular, but there are some shortcomings, such as premature convergence, poor local search ability, and serious assimilation of the late population. For this reason, multipopulation genetic algorithm (MPGA) [25, 26] was proposed. Besides of solving the shortcomings of single-population genetic algorithm, the convergence speed and accuracy have been improved. This paper uses MPGA and SPGA to search the optimal weights and thresholds of BPNN (called MPGA-BPNN and SPGA-BPNN, resp.) and observes the changes of fitness values obtained by these two algorithms. The specific parameters of the SPGA and MPGA are as follows:(a)
SPGA: binary coding, roulette selection, and single-point crossover. The crossover probability is 0.85, and the mutation probability is 0.07. The evolutionary algebra is set to 200, and the total number of individuals is 1000.(b)
MPGA: binary coding, roulette selection, and multipoint crossover. The crossover probability and the mutation probability of various groups are randomly generated in [0.4, 0.9] and [0.005, 0.1], respectively, and the immigration operator and artificial selection operator are introduced. The evolutionary algebra is set to 200, the number of populations is 10, and the number of individual populations is 100.


### 3.3.3. GA Evaluation

With the operation of SPGA-BPNN and MPGA-BPNN, the changes curve of fitness value is obtained, as shown in Figure10. It is not difficult to find that the best fitness value obtained by MPGA is 0.996, which is much higher than the 0.56 obtained by SPGA. Therefore, this paper chooses MPGA-BPNN as error correction algorithm of ILA.Figure 10
The changes of fitness value.After the training, theEi and the average absolute error (AAE) Es of the output values of the MPGA-BPNN relative to the actual measurement value are obtained by (15) and (19). To evaluate the error correction ability of MPGA-BPNN, Es of the ILA, BPNN, and SPGA-BPNN are introduced as follows:(12)Eip=xip−xit+yip−yit2+zip−zii2,(13)Eib=xib−xit+yib−yit2+zib−z2,(14)Eis=xis−xit+yis−yit2+zis−zit2,(15)Eim=xim−xit+yim−yit2+zim−zit2,(16)Esp=1N∑i=1Nxip−xit2+yip−yit2+zip−zit2,(17)Esb=1N∑i=1Nxib−xit2+yib−yit2+zib−zit2,(18)Ess=1N∑i=1Nxis−xit2+yis−yit2+zis−zit2,(19)Esm=1N∑i=1Nxim−xit2+yim−yit2+zim−zit2,where, xib,yib,zib are the output values of BPNN, xis,yis,zis are the output values of SPGA-BPNN, xim,yim,zim are the output values of MPGA-BPNN, and N is the number of test points.


## 3.3.1. BPNN Algorithm

NNs are currently popular in machine learning. Among them, BPNN is a multilayer feedforward NN whose characteristics are forward signal transmission and error back propagation. In the forward transmission process, the signal is processed layer by layer from the input layer through the hidden layer to the output layer. If the output layer cannot obtain the desired output, the signal is transmitted to back propagation, and the weight and threshold are adjusted according to the prediction error, so that the output of BPNN continues to be close to the expected output [13–15]. It is known that BPNN containing a hidden layer has sufficient accuracy to approximate any continuous function [16]. Figure 8 shows BPNN topology diagram, where xip,yip,zip are the initial location coordinates of the target point and are obtained by the method described in Section 3.1. xit,yit,zit are actual measured values of the target points corresponding to the aforementioned xip,yip,zip.Figure 8
Architecture of BPNN.Because the initial weight and threshold are random, with the training of the BPNN, the weight and threshold will be constantly updated, and eventually the weight and threshold will converge to a certain value. However, the gradient descent training algorithm of the BPNN may produce local minima. Evolutionary algorithms (EAs) can be effectively used to find the optimal weight and threshold globally without calculating gradient information [17]. EAs include simulated annealing algorithm (SAA) [18, 19], particle swarm optimization (PSO) [20, 21], and genetic algorithm (GA). Compared with SAA and PSO, GA has the advantages of efficient heuristic search and parallel computing and has been widely used in function optimization and combination optimization. Therefore, this paper uses a GA combined with the BPNN (called GA-BPNN) to solve the problem that the BPNN falls into local minima solutions.


## 3.3.2. GA-BPNN Algorithm

A GA is an optimization method based on natural selection mechanism in the process of biological evolution [22–24]. This paper uses GA’s global search ability to search the optimal weights and thresholds of BPNN. Then, the prediction model with the optimal weight and threshold of BPNN is established, referred to as GA-BPNN. Figure 9 is a flowchart of GA-BPNN algorithm.Figure 9
Framework of GA-BPNN.The deviation of the output valuesxi,yi,zi of the BPNN and the actual measured values is taken as the objective function of the GA, defined as follows:(10)Ei=xi−xit2+yi−yit2+zi−zit2.The goal of GA is to find the weight and threshold of BPNN with the least sum of squares in all evolutionary generations and to develop in the direction of increasing the value of the fitness function. It is constructed as follows:(11)fitness=11+Ei.GAs include single-population genetic algorithm (SPGA) and multiple-population genetic algorithm (MPGA). The early SPGA is popular, but there are some shortcomings, such as premature convergence, poor local search ability, and serious assimilation of the late population. For this reason, multipopulation genetic algorithm (MPGA) [25, 26] was proposed. Besides of solving the shortcomings of single-population genetic algorithm, the convergence speed and accuracy have been improved. This paper uses MPGA and SPGA to search the optimal weights and thresholds of BPNN (called MPGA-BPNN and SPGA-BPNN, resp.) and observes the changes of fitness values obtained by these two algorithms. The specific parameters of the SPGA and MPGA are as follows:(a)
SPGA: binary coding, roulette selection, and single-point crossover. The crossover probability is 0.85, and the mutation probability is 0.07. The evolutionary algebra is set to 200, and the total number of individuals is 1000.(b)
MPGA: binary coding, roulette selection, and multipoint crossover. The crossover probability and the mutation probability of various groups are randomly generated in [0.4, 0.9] and [0.005, 0.1], respectively, and the immigration operator and artificial selection operator are introduced. The evolutionary algebra is set to 200, the number of populations is 10, and the number of individual populations is 100.


## 3.3.3. GA Evaluation

With the operation of SPGA-BPNN and MPGA-BPNN, the changes curve of fitness value is obtained, as shown in Figure10. It is not difficult to find that the best fitness value obtained by MPGA is 0.996, which is much higher than the 0.56 obtained by SPGA. Therefore, this paper chooses MPGA-BPNN as error correction algorithm of ILA.Figure 10
The changes of fitness value.After the training, theEi and the average absolute error (AAE) Es of the output values of the MPGA-BPNN relative to the actual measurement value are obtained by (15) and (19). To evaluate the error correction ability of MPGA-BPNN, Es of the ILA, BPNN, and SPGA-BPNN are introduced as follows:(12)Eip=xip−xit+yip−yit2+zip−zii2,(13)Eib=xib−xit+yib−yit2+zib−z2,(14)Eis=xis−xit+yis−yit2+zis−zit2,(15)Eim=xim−xit+yim−yit2+zim−zit2,(16)Esp=1N∑i=1Nxip−xit2+yip−yit2+zip−zit2,(17)Esb=1N∑i=1Nxib−xit2+yib−yit2+zib−zit2,(18)Ess=1N∑i=1Nxis−xit2+yis−yit2+zis−zit2,(19)Esm=1N∑i=1Nxim−xit2+yim−yit2+zim−zit2,where, xib,yib,zib are the output values of BPNN, xis,yis,zis are the output values of SPGA-BPNN, xim,yim,zim are the output values of MPGA-BPNN, and N is the number of test points.


## 4. Simulations and Experiments

In this section, simulations and experiments are constructed to prove the validity and practicability of the proposed algorithms. Simulations are implemented with the aid of the MATLAB R2015a tool and experiments are run using an Intel Core™ i5-2450M CPU @ 2.50 GHz and 2 GB RAM as the control platform.


### 4.1. Simulation Analysis of Localization Algorithm and IK Algorithm

To assess the accuracy of the proposed localization algorithm, 200 points were randomly selected from BPNN training samples as test points. The errors in thex-, y-, and z-directions between the actual position obtained by BPNN, SPGA-BPNN, and MPGA-BPNN and the desired position are obtained as shown in Figure 11. It is found that the average error by BPNN and SPGA-BPNN is 11 mm and 6.6 mm, respectively; however, the average error by our algorithm is 1 mm. In other words, compared with the initial positioning coordinates, BPNN and SPGA-BPNN error correction algorithm reduces position error by 57.1% and 78.6%, respectively; however, our algorithm reduces the error by 96.4%.Figure 11
Error curve in thex-, y-, and z-directions of test points.
(a)(b)(c)xim,yim,zim of the above 200 test points are selected to evaluate the accuracy of the IK algorithm. The corresponding joint angle values are obtained through the IK algorithm and brought into (3) to obtain corresponding position coordinates. Comparing with xim,yim,zim of the above 200 test points, the position errors in the x-, y-, and z-direction are obtained as shown in Figure 12. It is found that the average error is 0.035 mm.Figure 12
Error curve in thex-, y-, and z-directions of IK algorithm.The simulations show that the proposed localization algorithm and IK algorithm is valid. Furthermore, these proposed algorithms are applied to the developed 5-DOF upper limb prosthesis to verify the effectiveness.


### 4.2. Experiment Analysis of Localization Algorithm

The laser point was randomly hit 10 positions in the workspace by adjusting the head attitude, and the position coordinates of each test point were obtained by the ILA and used as input to the BPNN, SPGA-BPNN, and MPGA-BPNN. Then, the network output value by the BPNN, SPGA-BPNN, and MPGA-BPNN of each test point was obtained and compared with the corresponding actual measured values, as shown in Figure13. It is easy to see that the output values of the MPGA-BPNN are closer to the actual measurement values.Figure 13
Tracking diagram between the actual values obtained by the test point through the ILA, BPNN, SPGA-BPNN, and MPGA-BPNN and the corresponding measured values.
(a)(b)(c)(d)Furthermore, through equation (15), Eip, Eib, Eis, and Eim of the test points are calculated, respectively, as shown in Table 2. The AAEs obtained by equation (19) are 48.71 mm, 18.92 mm, 11.18 mm, and 2.50 mm, respectively. Compared with the AAE of the initial position value, the AAE of the output values of the BPNN and SPGA-BPNN is reduced by 61.16% and 75.77%, respectively. However, the AAE of the output values of our algorithm is reduced by 94.87%. These results further illustrate that error correction algorithm of the MPGA-BPNN is more effective in the actual positioning of the upper limb prosthesis.Table 2
Deviations of test points.
Test point number deviations12345678910Eip (mm)56.5044.5849.1046.6549.6750.0751.2344.8648.4346.05Eib (mm)20.8621.4419.8017.8519.2417.7418.9217.5618.8916.86Eis (mm)11.2810.5211.1310.4511.3611.3811.0510.3012.3612.00Eim (mm)2.332.562.452.202.942.722.722.142.372.52It is well known that classical visual location algorithms use point description to match features between the current view and the map. After consulting the related literature, we find that the visual positioning accuracy is approximately 5 mm. However, our positioning accuracy is 2.5 mm, which is higher than visual location algorithms. In addition, our method is an interactive localization method. In the case of multiple targets, visual localization algorithms cannot understand which random target the user is going to grasp, but our algorithm can aim the laser beam at a target and command the upper limb prosthesis to grasp it. Therefore, the proposed algorithm is more concise and accurate than visual localization algorithms.


### 4.3. Experiment Analysis of IK Algorithm

By inputting the output coordinates of MPGA-BPNN into GRNN solving model, the joint angles of the front three joints of the upper limb prosthesis were obtained, as shown in column 4 of Table3. The upper limb prosthesis moves according to the obtained joint angles, and finally the gripper center accurately moves to the position of the laser point, as shown in Figure 14.Table 3
Inverse and positive solution results of testing points.
Test pointxit,yit,zit (mm)xim,yim,zim (mm)Joint angle (rad)xif,yif,zif (mm)1−4118−500−39.8316.46−498.82−0.21−0.260.32−40.4117.14−498.772−61100−98−62.30101.71−96.63−0.33−1.842.62−62.61101.83−96.093−17−42−488−18.66−40.83−489.37−0.230.410.50−18.91−40.51−489.634−14121−486−142.3322.32−484.84−0.24−2.370.15−142.0022.09−484.76523−105−46321.50−103.63−465.08−0.140.870.6922.18−103.14−466.166−39−63−489−40.38−64.44−490.72−0.200.840.42−40.52−64.37−490.3076209−2707.69210.57−271.630.02−1.561.687.71210.72−271.79810−121−43011.23−122.21−431.31−0.270.770.9811.64−122.57−431.8496215−48263.4116.33−483.36−0.10−0.150.5663.4116.83−483.36109−141−41110.12−142.53−412.67−0.270.871.0810.86−142.91−412.77Figure 14
Artificial limb accurately moving to the target position. The numbers represent the laser test point at different positions.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)To verify the accuracy of the joint angle solution, the joint angles solved by GRNN are substituted into equation (3) to obtain the coordinates of the center of the gripper, as shown in column 5 of Table 3. At this time, px,py,pz is regarded as the actual position, and xim,yim,zim is regarded as the desired position. The responses of the actual position and the desired position in the 3D coordinate system are obtained, as shown in Figure 15(a), and the projection results in the xy-, xz-, and yz-planes are illustrated in Figures 15(b)–15(d). It is easy to see that the IK algorithm can obtain a unique solution with high accuracy.Figure 15
Response diagrams of the actual position and the desired position.
(a)(b)(c)(d)


### 4.4. Practical Applications of Artificial Limbs

An experiment at which a cup is picked up from the table and moved to the mouth of the wearer is performed. First, the laser point is targeted to the center of the cup through wearer’s head movement. Then, through the target localization algorithm and IK algorithm, the gripper moved to the center of the cup. Finally, the human–computer interaction system was used to complete the process of gripping the cup and moving it to the mouth, as shown in Figure16. The effectiveness of the localization algorithm and IK algorithm is further verified.Figure 16
Motion process of the upper limb prosthesis. (a) Locating the position of the cup, (b) gripping the cup, and (c) moving the cup to the wearer’s mouth.
(a)(b)(c)


## 4.1. Simulation Analysis of Localization Algorithm and IK Algorithm

To assess the accuracy of the proposed localization algorithm, 200 points were randomly selected from BPNN training samples as test points. The errors in thex-, y-, and z-directions between the actual position obtained by BPNN, SPGA-BPNN, and MPGA-BPNN and the desired position are obtained as shown in Figure 11. It is found that the average error by BPNN and SPGA-BPNN is 11 mm and 6.6 mm, respectively; however, the average error by our algorithm is 1 mm. In other words, compared with the initial positioning coordinates, BPNN and SPGA-BPNN error correction algorithm reduces position error by 57.1% and 78.6%, respectively; however, our algorithm reduces the error by 96.4%.Figure 11
Error curve in thex-, y-, and z-directions of test points.
(a)(b)(c)xim,yim,zim of the above 200 test points are selected to evaluate the accuracy of the IK algorithm. The corresponding joint angle values are obtained through the IK algorithm and brought into (3) to obtain corresponding position coordinates. Comparing with xim,yim,zim of the above 200 test points, the position errors in the x-, y-, and z-direction are obtained as shown in Figure 12. It is found that the average error is 0.035 mm.Figure 12
Error curve in thex-, y-, and z-directions of IK algorithm.The simulations show that the proposed localization algorithm and IK algorithm is valid. Furthermore, these proposed algorithms are applied to the developed 5-DOF upper limb prosthesis to verify the effectiveness.


## 4.2. Experiment Analysis of Localization Algorithm

The laser point was randomly hit 10 positions in the workspace by adjusting the head attitude, and the position coordinates of each test point were obtained by the ILA and used as input to the BPNN, SPGA-BPNN, and MPGA-BPNN. Then, the network output value by the BPNN, SPGA-BPNN, and MPGA-BPNN of each test point was obtained and compared with the corresponding actual measured values, as shown in Figure13. It is easy to see that the output values of the MPGA-BPNN are closer to the actual measurement values.Figure 13
Tracking diagram between the actual values obtained by the test point through the ILA, BPNN, SPGA-BPNN, and MPGA-BPNN and the corresponding measured values.
(a)(b)(c)(d)Furthermore, through equation (15), Eip, Eib, Eis, and Eim of the test points are calculated, respectively, as shown in Table 2. The AAEs obtained by equation (19) are 48.71 mm, 18.92 mm, 11.18 mm, and 2.50 mm, respectively. Compared with the AAE of the initial position value, the AAE of the output values of the BPNN and SPGA-BPNN is reduced by 61.16% and 75.77%, respectively. However, the AAE of the output values of our algorithm is reduced by 94.87%. These results further illustrate that error correction algorithm of the MPGA-BPNN is more effective in the actual positioning of the upper limb prosthesis.Table 2
Deviations of test points.
Test point number deviations12345678910Eip (mm)56.5044.5849.1046.6549.6750.0751.2344.8648.4346.05Eib (mm)20.8621.4419.8017.8519.2417.7418.9217.5618.8916.86Eis (mm)11.2810.5211.1310.4511.3611.3811.0510.3012.3612.00Eim (mm)2.332.562.452.202.942.722.722.142.372.52It is well known that classical visual location algorithms use point description to match features between the current view and the map. After consulting the related literature, we find that the visual positioning accuracy is approximately 5 mm. However, our positioning accuracy is 2.5 mm, which is higher than visual location algorithms. In addition, our method is an interactive localization method. In the case of multiple targets, visual localization algorithms cannot understand which random target the user is going to grasp, but our algorithm can aim the laser beam at a target and command the upper limb prosthesis to grasp it. Therefore, the proposed algorithm is more concise and accurate than visual localization algorithms.


## 4.3. Experiment Analysis of IK Algorithm

By inputting the output coordinates of MPGA-BPNN into GRNN solving model, the joint angles of the front three joints of the upper limb prosthesis were obtained, as shown in column 4 of Table3. The upper limb prosthesis moves according to the obtained joint angles, and finally the gripper center accurately moves to the position of the laser point, as shown in Figure 14.Table 3
Inverse and positive solution results of testing points.
Test pointxit,yit,zit (mm)xim,yim,zim (mm)Joint angle (rad)xif,yif,zif (mm)1−4118−500−39.8316.46−498.82−0.21−0.260.32−40.4117.14−498.772−61100−98−62.30101.71−96.63−0.33−1.842.62−62.61101.83−96.093−17−42−488−18.66−40.83−489.37−0.230.410.50−18.91−40.51−489.634−14121−486−142.3322.32−484.84−0.24−2.370.15−142.0022.09−484.76523−105−46321.50−103.63−465.08−0.140.870.6922.18−103.14−466.166−39−63−489−40.38−64.44−490.72−0.200.840.42−40.52−64.37−490.3076209−2707.69210.57−271.630.02−1.561.687.71210.72−271.79810−121−43011.23−122.21−431.31−0.270.770.9811.64−122.57−431.8496215−48263.4116.33−483.36−0.10−0.150.5663.4116.83−483.36109−141−41110.12−142.53−412.67−0.270.871.0810.86−142.91−412.77Figure 14
Artificial limb accurately moving to the target position. The numbers represent the laser test point at different positions.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)To verify the accuracy of the joint angle solution, the joint angles solved by GRNN are substituted into equation (3) to obtain the coordinates of the center of the gripper, as shown in column 5 of Table 3. At this time, px,py,pz is regarded as the actual position, and xim,yim,zim is regarded as the desired position. The responses of the actual position and the desired position in the 3D coordinate system are obtained, as shown in Figure 15(a), and the projection results in the xy-, xz-, and yz-planes are illustrated in Figures 15(b)–15(d). It is easy to see that the IK algorithm can obtain a unique solution with high accuracy.Figure 15
Response diagrams of the actual position and the desired position.
(a)(b)(c)(d)


## 4.4. Practical Applications of Artificial Limbs

An experiment at which a cup is picked up from the table and moved to the mouth of the wearer is performed. First, the laser point is targeted to the center of the cup through wearer’s head movement. Then, through the target localization algorithm and IK algorithm, the gripper moved to the center of the cup. Finally, the human–computer interaction system was used to complete the process of gripping the cup and moving it to the mouth, as shown in Figure16. The effectiveness of the localization algorithm and IK algorithm is further verified.Figure 16
Motion process of the upper limb prosthesis. (a) Locating the position of the cup, (b) gripping the cup, and (c) moving the cup to the wearer’s mouth.
(a)(b)(c)


## 5. Conclusions and Future Work

To achieve the purpose of accurately grasping a random target with the upper limb prosthesis, a novel type of random target localization algorithm is proposed. Firstly, an initial localization algorithm (ILA) that uses two 3D attitude sensors and a laser range sensor to detect the target attitude and distance is presented. Secondly, MPGA-BPNN error correction algorithm is proposed to improve the localization accuracy of the target based on the ILA is utilized. Thirdly, GRNN algorithm is presented to calculate the prosthetic joint angles. Finally, the proposed algorithm is applied to the 5-DOF upper limb prosthesis. The simulations show that the average positioning error by MPGA-BPNN error correction algorithm is 1 mm, and the average error of the IK algorithm is 0.035 mm. Compared with ILA, the accuracy by MPGA-BPNN error correction algorithm is greatly improved and better than BPNN error correction algorithm and SPGA-BPNN error correction algorithm.The laser test point positioning experiment shows that the AAE between the output values after error correction by MPGA-BPNN and the actual values is 2.5 mm, and the proposed IK algorithm can accurately obtain a unique IK solution. The experiment of gripping a cup from a table and moving it to the mouth of the wearer’s further verifies that the positioning algorithm and the IK algorithm can meet the requirements of the wearer.In our future work, we will try to eliminate the restriction of the upper limb prosthesis’s DOF to meet the wearer’s need for more use. We also aim to consider using voice or brain waves to control the movement of the upper limb prosthesis.



---

*Source: 5297043-2021-06-21.xml*