CN115098978A - RBF neural network-based forward kinematics analysis method for improving Newton iterative algorithm - Google Patents

RBF neural network-based forward kinematics analysis method for improving Newton iterative algorithm Download PDF

Info

Publication number
CN115098978A
CN115098978A CN202210876632.9A CN202210876632A CN115098978A CN 115098978 A CN115098978 A CN 115098978A CN 202210876632 A CN202210876632 A CN 202210876632A CN 115098978 A CN115098978 A CN 115098978A
Authority
CN
China
Prior art keywords
neural network
center
platform
equation
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202210876632.9A
Other languages
Chinese (zh)
Other versions
CN115098978B (en
Inventor
宋孝宗
付海涛
王笑荣
包振良
贺亚洲
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lanzhou University of Technology
Original Assignee
Lanzhou University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Lanzhou University of Technology filed Critical Lanzhou University of Technology
Priority to CN202210876632.9A priority Critical patent/CN115098978B/en
Publication of CN115098978A publication Critical patent/CN115098978A/en
Application granted granted Critical
Publication of CN115098978B publication Critical patent/CN115098978B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/10Geometric CAD
    • G06F30/17Mechanical parametric or variational design
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/11Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/16Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • G06F30/27Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/04Architecture, e.g. interconnection topology
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00Details relating to CAD techniques
    • G06F2111/04Constraint-based CAD
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00Details relating to CAD techniques
    • G06F2111/08Probabilistic or stochastic CAD
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Pure & Applied Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • Mathematical Optimization (AREA)
  • Software Systems (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Geometry (AREA)
  • Artificial Intelligence (AREA)
  • Computing Systems (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Databases & Information Systems (AREA)
  • Algebra (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Molecular Biology (AREA)
  • Computer Hardware Design (AREA)
  • Operations Research (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Medical Informatics (AREA)
  • Numerical Control (AREA)

Abstract

The invention provides a forward kinematics analysis method based on an RBF neural network improved Newton iteration algorithm, which comprises the following steps: s1, establishing a rod length formula of the series-parallel polishing mechanism under an absolute coordinate system through a closed-loop vector method, and solving a kinematic inverse solution equation and a nonlinear equation set; s2, selecting an RBF neural network center, and randomly selecting sampling points as training data; and S3, performing iterative computation by using the estimated value obtained by neural network training as an iterative initial value through a positive kinematics equation until the precision meets the output result. The method utilizes the predicted value of RBF neural network training as the initial iteration value of Newton iteration to carry out iterative solution, thereby not only avoiding the insufficient precision of the RBF neural network caused by insufficient training sample number, but also avoiding the dependency of Newton iteration method on the initial iteration value.

Description

一种基于RBF神经网络改进牛顿迭代算法的正向运动学分析 方法A Forward Kinematics Analysis of Improved Newton Iterative Algorithm Based on RBF Neural Network method

技术领域technical field

本发明属于计算模型技术领域,具体涉及一种基于RBF神经网络改进牛顿迭代算法的正向运动学分析方法。The invention belongs to the technical field of computing models, in particular to a forward kinematics analysis method based on an RBF neural network improved Newton iterative algorithm.

背景技术Background technique

混联机器人作为机床在机械加工的过程中需要对加工工具头的位姿进行实时控制,才能保证自由曲面的表面质量,而这种运动控制正是建立在机构的正向运动学分析的基础上。因此,对混联抛光机器人开展正向运动学分析变得尤为重要。但是混联机构运动学正解存在求解困难、求解效率低等问题,为此需要提出一种准确可靠的混联机构运动学求解计算方法。As a machine tool, the hybrid robot needs to control the pose of the machining tool head in real time in the machining process to ensure the surface quality of the free-form surface, and this motion control is based on the forward kinematics analysis of the mechanism. . Therefore, it is particularly important to carry out forward kinematics analysis of the hybrid polishing robot. However, the positive solution of the kinematics of the hybrid mechanism has problems such as difficulty in solving and low efficiency. Therefore, it is necessary to propose an accurate and reliable kinematics calculation method for the hybrid mechanism.

牛顿迭代法是求解非线性方程组的重要方法,通过给定特定的迭代初值,将非线性方程组逐步转化成线性方程进行求解,运动学正解的原理是牛顿迭代解算非线性方程组。但是此方法比较依赖于初值的选取,如果初值选取的不合适,会造成迭代结果的不收敛。The Newton iteration method is an important method for solving nonlinear equations. By giving a specific initial value of iteration, the nonlinear equations are gradually transformed into linear equations for solving. The principle of positive kinematics solution is that Newton iteratively solves nonlinear equations. However, this method is more dependent on the selection of the initial value. If the initial value is not selected properly, it will cause the non-convergence of the iterative results.

人工神经网络是一种通过模仿生物的神经网络基本特征和结构理论的一种信息计算模型。其基本单位为神经元,神经元相互之间通过并行连接来构成神经网络,通过模仿生物大脑处理信息的方式和神经元的相互作用,使系统具备了类似于生物大脑的自学习能力。在神经网络中,一个神经元可以接受多个输入信号,用特定的处理方式得到输出信号后,再通过非线性的方式将信号传递给其他神经元。因此,神经网络凭借其可以任意精度的泛函逼近能力,对于控制不确定系统具有很高的精度和很强的鲁棒性。前馈型神经网络由于其简单的结构,在神经网络中广泛使用,如BP神经网络、RBF神经网络、多层感知器神经网络等都是属于前馈型网络。近年来,随着智能算法的发展,越来越多的智能算法应用在机构的运动学上。RBF网络能够逼近任意的非线性函数,可以处理系统内的难以解析的规律性,具有良好的泛化能力,并有很快的学习收敛速度,已成功应用于非线性函数逼近、时间序列分析、数据分类、模式识别、信息处理、图像处理、系统建模、控制和故障诊断等。Artificial neural network is an information computing model by imitating the basic characteristics and structure theory of biological neural network. The basic unit is the neuron, and the neurons are connected in parallel to form a neural network. By imitating the way the biological brain processes information and the interaction of neurons, the system has the self-learning ability similar to the biological brain. In a neural network, a neuron can accept multiple input signals, obtain the output signal in a specific processing method, and then transmit the signal to other neurons in a nonlinear way. Therefore, by virtue of its functional approximation capability of arbitrary precision, neural network has high precision and strong robustness for controlling uncertain systems. Feedforward neural network is widely used in neural network due to its simple structure, such as BP neural network, RBF neural network, multilayer perceptron neural network, etc., all belong to feedforward network. In recent years, with the development of intelligent algorithms, more and more intelligent algorithms are applied to the kinematics of the mechanism. The RBF network can approximate any nonlinear function, can handle the unanalyzable regularities in the system, has good generalization ability, and has a fast learning convergence speed. It has been successfully applied to nonlinear function approximation, time series analysis, Data classification, pattern recognition, information processing, image processing, system modeling, control and fault diagnosis, etc.

发明内容SUMMARY OF THE INVENTION

本发明所要解决的技术问题在于针对上述现有技术的不足,提供一种基于RBF神经网络改进牛顿迭代算法的正向运动学分析方法,该计算方法利用RBF神经网络训练的预测值作为牛顿迭代的迭代初值进行迭代求解,即可以避免RBF神经网络因为训练样本数量不够而导致的精度不足,又可以避免牛顿迭代法对迭代初值的依赖性,设计科学合理,实用性强,计算精度高、计算效率高。The technical problem to be solved by the present invention is to provide a forward kinematics analysis method based on the RBF neural network improved Newton iterative algorithm for the deficiencies of the above-mentioned prior art. The calculation method uses the predicted value trained by the RBF neural network as the The iterative solution of the iterative initial value can avoid the insufficient accuracy of the RBF neural network due to the insufficient number of training samples, and can avoid the dependence of the Newton iteration method on the initial value of the iteration. High computational efficiency.

为解决上述技术问题,本发明采用的技术方案是:一种基于RBF神经网络改进牛顿迭代算法的正向运动学分析方法,其特征在于,包括以下操作步骤:In order to solve the above-mentioned technical problems, the technical scheme adopted in the present invention is: a forward kinematics analysis method based on RBF neural network improvement Newton iterative algorithm, is characterized in that, comprises the following operation steps:

S1、使用闭环矢量法,在绝对坐标系下建立混联抛光机构的杆长公式,得到运动学逆解方程,在逆解方程的基础上,建立非线性方程组作为正向运动学方程;S1. Using the closed-loop vector method, the rod length formula of the hybrid polishing mechanism is established in the absolute coordinate system, and the kinematic inverse solution equation is obtained. On the basis of the inverse solution equation, the nonlinear equation system is established as the forward kinematic equation;

S2、选取RBF神经网络中心,选用高斯函数作为基函数根据运动学的逆解结果,在规定的运动范围内,随机选取j个采样点作为神经网络的训练数据,大部分采样点作为训练样本,其余少数采样点作为测试样本;S2. Select the center of the RBF neural network, and select the Gaussian function as the basis function. According to the inverse solution result of kinematics, within the specified range of motion, randomly select j sampling points as the training data of the neural network, and most of the sampling points are used as training samples. The remaining few sampling points are used as test samples;

S3、将神经网络训练得到的估计值作为迭代初值通过正向运动学方程进行迭代计算,记录每一次的迭代差值|hi-hi-1|,并判断迭代差值|hi-hi-1|是否小于精度要求ε,若|hi-hi-1|小于精度要求ε,则输出迭代值并结束流程,反之,则继续迭代,直到精度满足输出结果。S3. Use the estimated value obtained by neural network training as the initial iterative value to perform iterative calculation through the forward kinematics equation, record each iteration difference |h i -h i-1 |, and judge the iterative difference |h i - Whether h i-1 | is less than the accuracy requirement ε, if |h i -h i-1 | is less than the accuracy requirement ε, output the iteration value and end the process, otherwise, continue to iterate until the accuracy meets the output result.

优选地,所述S1具体包括以下操作步骤:Preferably, the S1 specifically includes the following operation steps:

S101、针对XY-3-RPS混联抛光平台机构模型,绘制混联机构的结构简图,Ai和Pi(i=1,2,3)分别是并联平台的转动副和球副的中心,由此构成的三角形ΔA1A2A3和ΔP1P2P3分别表示为定平台和动平台,定平台的外接圆半径分别用R和r来表示,每条支链用向量AiPi来表示,X向串联平台用移动副M来表示,Y向串联平台用移动副N来表示;S101. Draw a schematic structural diagram of the hybrid mechanism for the XY-3-RPS hybrid polishing platform mechanism model. A i and P i (i=1, 2, 3) are the centers of the rotating pair and the ball pair of the parallel platform, respectively. , the triangles ΔA 1 A 2 A 3 and ΔP 1 P 2 P 3 formed by this are represented as the fixed platform and the moving platform, respectively, the circumradius of the fixed platform is represented by R and r respectively, and each branch is represented by a vector A i It is represented by Pi , the X-direction series platform is represented by the moving pair M, and the Y-direction series platform is represented by the moving pair N;

S102、对XY-3-RPS混联抛光机器人的结构,分别建立动平台坐标系{C1}、定平台坐标系{C2}、绝对坐标系{C0},坐标原点分别是动平台的几何中心C1、定平台的几何中心C2、移动副M的中心C0S102. For the structure of the XY-3-RPS hybrid polishing robot, establish a moving platform coordinate system {C 1 }, a fixed platform coordinate system {C 2 }, and an absolute coordinate system {C 0 } respectively, and the coordinate origins are respectively the moving platform. The geometric center C 1 , the geometric center C 2 of the fixed platform, and the center C 0 of the moving pair M;

S103、采用闭环矢量法进行运动学分析,运动环的起点是定平台坐标系的原点C,先经过驱动杆与定平台的铰点Ai,再经过驱动杆与动平台的铰点Pi,终点就是动平台坐标系的坐标原点C1S103, using the closed-loop vector method for kinematics analysis, the starting point of the motion loop is the origin C of the coordinate system of the fixed platform, first passes through the hinge point A i of the driving rod and the fixed platform, and then passes through the hinge point P i of the driving rod and the moving platform, The end point is the coordinate origin C 1 of the moving platform coordinate system;

S104、3-RPS并联机构总共有三条支链,每个都是独立的封闭的运动环,每个运动环用向量形式表示,CC1+C1Pi=CAi+AiPi,经改写为

Figure BDA0003762421300000031
S104, 3-RPS parallel mechanism has a total of three branch chains, each of which is an independent closed motion loop, and each motion loop is represented by a vector form, CC 1 +C 1 P i =CA i +A i P i , after rewrite as
Figure BDA0003762421300000031

S105、由于每条支链都会受到转动副的约束,且转动副轴线单位向量ji始终与支链垂直,所以可得支链的约束方程

Figure BDA0003762421300000032
S105. Since each branch chain will be constrained by the rotation pair, and the unit vector ji of the rotation pair axis is always perpendicular to the branch chain, the constraint equation of the branch chain can be obtained
Figure BDA0003762421300000032

S106、:得到xc、yc、γ关于zc、α、β的表达式,S106: Obtain the expressions of x c , y c , γ about z c , α, β,

Figure BDA0003762421300000033
Figure BDA0003762421300000033

yC=-rcosβsinγy C = -rcosβsinγ

Figure BDA0003762421300000034
Figure BDA0003762421300000034

S107、由于3阶矩阵只能表示纯旋转运动,为了表示混联机构的平移运动,所以需要将其广义化为4阶的齐次坐标,即S107. Since the third-order matrix can only represent pure rotational motion, in order to represent the translational motion of the hybrid mechanism, it needs to be generalized to the fourth-order homogeneous coordinates, that is,

Figure BDA0003762421300000035
Figure BDA0003762421300000035

S108、定平台坐标系相对于绝对坐标系只有沿X、Y轴向的平移,由于3-RPS并联平台是跟随串联十字滑台的Y平台整体移动,所以动平台相对于定平台没有沿X、Y轴向的相对运动,因此,动平台坐标系相对于绝对坐标系的变换矩阵为:S108. The fixed platform coordinate system only translates along the X and Y axes relative to the absolute coordinate system. Since the 3-RPS parallel platform moves as a whole with the Y platform of the series cross slide, the moving platform does not move along the X, Y axes relative to the fixed platform. The relative movement of the Y axis, therefore, the transformation matrix of the moving platform coordinate system relative to the absolute coordinate system is:

Figure BDA0003762421300000041
Figure BDA0003762421300000041

Figure BDA0003762421300000042
Figure BDA0003762421300000042

S109、经公式代入求解转化可以得到XY-3-RPS混联抛光机构的驱动杆长li,表示为:S109. The driving rod length l i of the XY-3-RPS hybrid polishing mechanism can be obtained by substituting the formula into the solution and transformation, which is expressed as:

Figure BDA0003762421300000043
Figure BDA0003762421300000043

式中,

Figure BDA0003762421300000044
为点Ai在绝对坐标系下的位置;In the formula,
Figure BDA0003762421300000044
is the position of point A i in the absolute coordinate system;

S110、将串联十字滑台的驱动位移x、y和并联驱动杆位移li,求解机床末端操作平台中心的位姿zC、α、β,进而得到混联抛光机构的杆长公式S110. Calculate the driving displacement x, y of the series cross slide and the parallel driving rod displacement li to solve the pose z C , α, β of the center of the operation platform at the end of the machine tool, and then obtain the rod length formula of the hybrid polishing mechanism

Figure BDA0003762421300000045
Figure BDA0003762421300000045

优选地,所述S2具体包括以下操作步骤:Preferably, the S2 specifically includes the following operation steps:

S201、采用自组织选取中心法选取RBF神经网络函数中心,选用高斯函数作为基函数,函数表达式为S201. Use the self-organizing center selection method to select the function center of the RBF neural network, select the Gaussian function as the basis function, and the function expression is

Figure BDA0003762421300000046
Figure BDA0003762421300000046

其中,x=[xi]T(i=1,2,…,n)为神经网络的输入,输入参数为XY-3-RPS混联抛光机床三根驱动杆的杆长值,n表示训练样本的数量,输入层与隐含层的连接权值为1,h=[hj]T为神经网络隐含层的输出,j为隐含层节点数;u=[uj]T是隐含层第j个神经元基函数的中心向量,v=[vj]T为隐含层第j个元基函数的宽度;Among them, x=[x i ] T (i=1,2,...,n) is the input of the neural network, the input parameter is the rod length value of the three driving rods of the XY-3-RPS hybrid polishing machine, and n represents the training sample The number of , the connection weight between the input layer and the hidden layer is 1, h=[h j ] T is the output of the hidden layer of the neural network, j is the number of hidden layer nodes; u=[u j ] T is the hidden layer The center vector of the jth neuron basis function of the layer, v=[v j ] T is the width of the jth element basis function of the hidden layer;

S202、确定RBF神经网络的输出为

Figure BDA0003762421300000051
其中w=[wm]T是隐含层到输出层的权值,ym为神经网络的实际输出;S202. Determine the output of the RBF neural network as
Figure BDA0003762421300000051
Where w=[w m ] T is the weight from the hidden layer to the output layer, and y m is the actual output of the neural network;

S203、先进行网络初始化,在混联机构的运动学逆解中随机选取j个训练作为聚类中心ujS203, initialize the network first, randomly select j trainings as the cluster center u j in the kinematic inverse solution of the hybrid mechanism;

S204、按照最近邻规则分组,将xi按照与聚类中心的欧式距离分配到样本的各个聚类集合φi(i=1,2,…,n)中;S204, grouping according to the nearest neighbor rule, and assigning x i to each cluster set φ i (i=1,2,...,n) of the sample according to the Euclidean distance from the cluster center;

S205、然后调整聚类中心,计算聚类集合φp中训练样本的平均值作为新的聚类中心,如果新的聚类中心不再发生变化,则所得到的聚类中心即为RBF神经网络的最终基函数中心,如果不是,则返回上一步,重新进行聚类中心求解;S205, then adjust the cluster center, and calculate the average value of the training samples in the cluster set φ p as the new cluster center. If the new cluster center no longer changes, the obtained cluster center is the RBF neural network The final basis function center of , if not, return to the previous step and re-solve the cluster center;

S206、基函数宽度求解,由于选取的RBF神经网络的基函数为高斯函数,高斯基函数宽度的求解公式

Figure BDA0003762421300000052
umax为所选取中心之间的最大距离;S206, solve the width of the basis function, since the basis function of the selected RBF neural network is a Gaussian function, the solution formula for the width of the Gaussian basis function
Figure BDA0003762421300000052
u max is the maximum distance between the selected centers;

S207、计算权值:隐含层到输出层的权值用最小二乘法计算,计算公式为S207. Calculate the weight: the weight from the hidden layer to the output layer is calculated by the least square method, and the calculation formula is

Figure BDA0003762421300000053
Figure BDA0003762421300000053

S208、根据运动学的逆解结果,在规定的运动范围内,随机选取5000个采样点,作为神经网络的训练数据,其中4800个采样点作为训练样本,其余的200个采样点作为测试样本。S208. According to the inverse kinematics solution result, within a specified motion range, randomly select 5000 sampling points as training data of the neural network, of which 4800 sampling points are used as training samples, and the remaining 200 sampling points are used as test samples.

优选地,所述S3具体包括以下操作步骤:Preferably, the S3 specifically includes the following operation steps:

S301、将求解机构正向运动学方程组,即求解末端操作平台中心的β位姿zC、α、β方程根的问题转化为求解方程Fi(hi)-Fi(hi-1)=Fi`(hi-1)(hi-hi-1);S301. Convert the problem of solving the forward kinematic equations of the mechanism, that is, the problem of solving the β pose z C , α and β equation roots of the center of the terminal operating platform, into solving the equation F i (hi )-F i ( hi -1 )=F i `(h i-1 )(h i -h i-1 );

S302、求解方程Fi(hi)-Fi(hi-1)=Fi`(hi-1)(hi-hi-1)转换为矩阵形式得S302, solve the equation F i (h i )-F i (h i-1 )=F i `(h i-1 )(h i -h i-1 ) and convert it into matrix form to obtain

Figure BDA0003762421300000061
Figure BDA0003762421300000061

其中in

Figure BDA0003762421300000062
为XY-3-RPS混联抛光机构的雅克比矩阵;
Figure BDA0003762421300000062
It is the Jacobian matrix of the XY-3-RPS mixed polishing mechanism;

S303、取测试样本训练的估计值作为牛顿迭代的初始值通过正运动学方程进行迭代计算,记录每一次的迭代差值|hi-hi-1|,并判断迭代差值|hi-hi-1是否小于精度要求ε,当|hi-hi-1|小于精度要求ε时,输出迭代值,而此时的hi就是混联机构的正向运动学方程组Fi(α,β,zC)=0的近似解,反之,则继续迭代,直到精度满足输出结果。S303, take the estimated value of the test sample training as the initial value of the Newton iteration, perform iterative calculation through the forward kinematic equation, record the difference value of each iteration |h i -h i-1 |, and judge the iterative difference value |h i - Whether h i-1 is less than the accuracy requirement ε, when |h i -h i-1 | is smaller than the accuracy requirement ε, the iterative value is output, and h i at this time is the forward kinematic equation system F i ( α, β, z C ) = 0 approximate solution, otherwise, continue to iterate until the accuracy meets the output result.

本发明与现有技术相比具有以下优点:Compared with the prior art, the present invention has the following advantages:

1、本发明利用牛顿迭代法和RBF神经网络算法的特点和优点,利用RBF神经网络训练的预测值作为牛顿迭代的迭代初值进行迭代求解,即可以避免RBF神经网络因为训练样本数量不够而导致的精度不足,又可以避免牛顿迭代法对迭代初值的依赖性。1. The present invention utilizes the characteristics and advantages of the Newton iteration method and the RBF neural network algorithm, and uses the predicted value of the RBF neural network training as the iterative initial value of the Newton iteration to iteratively solve, so as to avoid the RBF neural network caused by the insufficient number of training samples. The accuracy is insufficient, and it can avoid the dependence of the Newton iteration method on the initial value of the iteration.

2、本发明设计科学合理,实用性强,能在对混联机器人进行工作空间、奇异位形、误差补偿以及运动控制等方面得到广泛应用。2. The invention has scientific and reasonable design and strong practicability, and can be widely used in the aspects of working space, singular configuration, error compensation and motion control of the hybrid robot.

下面结合附图和实施例对本发明作进一步详细说明。The present invention will be described in further detail below with reference to the accompanying drawings and embodiments.

附图说明Description of drawings

图1是本发明的流程图。Figure 1 is a flow chart of the present invention.

图2是本发明中XY-3-RPS混联抛光机构的结构简图。FIG. 2 is a schematic diagram of the structure of the XY-3-RPS hybrid polishing mechanism in the present invention.

图3是牛顿迭代算法的几何原理图。Figure 3 is a geometric schematic diagram of Newton's iterative algorithm.

图4是牛顿迭代法流程框图。Figure 4 is a flow chart of the Newton iteration method.

图5是RBF神经网络结构图。Figure 5 is a structural diagram of the RBF neural network.

图6是改进前的误差曲线。Figure 6 is the error curve before improvement.

图7是改进后的本实施方式的误差曲线。FIG. 7 is an error curve of the improved embodiment.

图8是改进后的本实施方式的迭代次数曲线。FIG. 8 is a graph of the number of iterations of the improved embodiment.

图9是改进后的本实施方式的迭代时间曲线。FIG. 9 is an iterative time curve of the improved embodiment.

具体实施方式Detailed ways

如图1所示,本发明包括以下操作步骤:As shown in Figure 1, the present invention includes the following operation steps:

S1、使用闭环矢量法,在绝对坐标系下建立混联抛光机构的杆长公式,得到运动学逆解方程,在逆解方程的基础上,建立非线性方程组作为正向运动学方程;S1. Using the closed-loop vector method, the rod length formula of the hybrid polishing mechanism is established in the absolute coordinate system, and the kinematic inverse solution equation is obtained. On the basis of the inverse solution equation, the nonlinear equation system is established as the forward kinematic equation;

S2、选取RBF神经网络中心,选用高斯函数作为基函数根据运动学的逆解结果,在规定的运动范围内,随机选取j个采样点作为神经网络的训练数据,大部分采样点作为训练样本,其余少数采样点作为测试样本;S2. Select the center of the RBF neural network, and select the Gaussian function as the basis function. According to the inverse solution result of kinematics, within the specified range of motion, randomly select j sampling points as the training data of the neural network, and most of the sampling points are used as training samples. The remaining few sampling points are used as test samples;

S3、将神经网络训练得到的估计值作为迭代初值通过正向运动学方程进行迭代计算,记录每一次的迭代差值|hi-hi-1|,并判断迭代差值|hi-hi-1|是否小于精度要求ε,若|hi-hi-1|小于精度要求ε,则输出迭代值并结束流程,反之,则继续迭代,直到精度满足输出结果。S3. Use the estimated value obtained by neural network training as the initial iterative value to perform iterative calculation through the forward kinematics equation, record each iteration difference |h i -h i-1 |, and judge the iterative difference |h i - Whether h i-1 | is less than the accuracy requirement ε, if |h i -h i-1 | is less than the accuracy requirement ε, output the iteration value and end the process, otherwise, continue to iterate until the accuracy meets the output result.

本实施例中,所述S1具体包括以下操作步骤:In this embodiment, the S1 specifically includes the following operation steps:

S101、如图2所示,针对XY-3-RPS混联抛光平台机构模型,绘制混联机构的结构简图,Ai和Pi(i=1,2,3)分别是并联平台的转动副和球副的中心,由此构成的三角形ΔA1A2A3和ΔP1P2P3分别表示为定平台和动平台,定平台的外接圆半径分别用R和r来表示,每条支链用向量AiPi来表示,X向串联平台用移动副M来表示,Y向串联平台用移动副N来表示;S101. As shown in Figure 2, for the mechanism model of the XY-3-RPS hybrid polishing platform, draw a schematic structural diagram of the hybrid mechanism. A i and P i (i=1, 2, 3) are the rotation of the parallel platform respectively. The center of the pair and the ball pair, and the triangles ΔA 1 A 2 A 3 and ΔP 1 P 2 P 3 formed by this are represented as the fixed platform and the moving platform, respectively, and the radius of the circumscribed circle of the fixed platform is represented by R and r respectively. The branch chain is represented by the vector A i P i , the X-direction series platform is represented by the moving pair M, and the Y-direction series platform is represented by the moving pair N;

S102、对XY-3-RPS混联抛光机器人的结构,分别建立动平台坐标系{C1}、定平台坐标系{C2}、绝对坐标系{C0},坐标原点分别是动平台的几何中心C1、定平台的几何中心C2、移动副M的中心C0S102. For the structure of the XY-3-RPS hybrid polishing robot, establish a moving platform coordinate system {C 1 }, a fixed platform coordinate system {C 2 }, and an absolute coordinate system {C 0 } respectively, and the coordinate origins are respectively the moving platform. The geometric center C 1 , the geometric center C 2 of the fixed platform, and the center C 0 of the moving pair M;

S103、采用闭环矢量法进行运动学分析,运动环的起点是定平台坐标系的原点C,先经过驱动杆与定平台的铰点Ai,再经过驱动杆与动平台的铰点Pi,终点就是动平台坐标系的坐标原点C1S103, using the closed-loop vector method for kinematics analysis, the starting point of the motion loop is the origin C of the coordinate system of the fixed platform, first passes through the hinge point A i of the driving rod and the fixed platform, and then passes through the hinge point P i of the driving rod and the moving platform, The end point is the coordinate origin C 1 of the moving platform coordinate system;

S104、3-RPS并联机构总共有三条支链,每个都是独立的封闭的运动环,每个运动环用向量形式表示,CC1+C1Pi=CAi+AiPi,经改写为

Figure BDA0003762421300000081
S104, 3-RPS parallel mechanism has a total of three branch chains, each of which is an independent closed motion loop, and each motion loop is represented by a vector form, CC 1 +C 1 P i =CA i +A i P i , after rewrite as
Figure BDA0003762421300000081

S105、由于每条支链都会受到转动副的约束,且转动副轴线单位向量ji始终与支链垂直,所以可得支链的约束方程

Figure BDA0003762421300000082
S105. Since each branch chain will be constrained by the rotation pair, and the unit vector ji of the rotation pair axis is always perpendicular to the branch chain, the constraint equation of the branch chain can be obtained
Figure BDA0003762421300000082

S106、:得到xc、yc、γ关于zc、α、β的表达式,S106: Obtain the expressions of x c , y c , γ about z c , α, β,

Figure BDA0003762421300000083
Figure BDA0003762421300000083

yC=-rcosβsinγy C = -rcosβsinγ

Figure BDA0003762421300000084
Figure BDA0003762421300000084

S107、由于3阶矩阵只能表示纯旋转运动,为了表示混联机构的平移运动,所以需要将其广义化为4阶的齐次坐标,即S107. Since the third-order matrix can only represent pure rotational motion, in order to represent the translational motion of the hybrid mechanism, it needs to be generalized to the fourth-order homogeneous coordinates, that is,

Figure BDA0003762421300000085
Figure BDA0003762421300000085

S108、定平台坐标系相对于绝对坐标系只有沿X、Y轴向的平移,由于3-RPS并联平台是跟随串联十字滑台的Y平台整体移动,所以动平台相对于定平台没有沿X、Y轴向的相对运动,因此,动平台坐标系相对于绝对坐标系的变换矩阵为:S108. The fixed platform coordinate system only translates along the X and Y axes relative to the absolute coordinate system. Since the 3-RPS parallel platform moves as a whole with the Y platform of the series cross slide, the moving platform does not move along the X, Y axes relative to the fixed platform. The relative movement of the Y axis, therefore, the transformation matrix of the moving platform coordinate system relative to the absolute coordinate system is:

Figure BDA0003762421300000091
Figure BDA0003762421300000091

Figure BDA0003762421300000092
Figure BDA0003762421300000092

S109、经公式代入求解转化可以得到XY-3-RPS混联抛光机构的驱动杆长li,表示为:S109. The driving rod length l i of the XY-3-RPS hybrid polishing mechanism can be obtained by substituting the formula into the solution and transformation, which is expressed as:

Figure BDA0003762421300000093
Figure BDA0003762421300000093

式中,

Figure BDA0003762421300000094
为点Ai在绝对坐标系下的位置;In the formula,
Figure BDA0003762421300000094
is the position of point A i in the absolute coordinate system;

S110、将串联十字滑台的驱动位移x、y和并联驱动杆位移li,求解机床末端操作平台中心的位姿zC、α、β,进而得到混联抛光机构的杆长公式S110. Calculate the driving displacement x, y of the series cross slide and the parallel driving rod displacement li to solve the pose z C , α, β of the center of the operation platform at the end of the machine tool, and then obtain the rod length formula of the hybrid polishing mechanism

Figure BDA0003762421300000095
Figure BDA0003762421300000095

本实施例中,所述S2具体包括以下操作步骤:In this embodiment, the S2 specifically includes the following operation steps:

S201、采用自组织选取中心法选取RBF神经网络函数中心,选用高斯函数作为基函数,函数表达式为S201. Use the self-organizing center selection method to select the function center of the RBF neural network, select the Gaussian function as the basis function, and the function expression is

Figure BDA0003762421300000096
Figure BDA0003762421300000096

其中,x=[xi]T(i=1,2,…,n)为神经网络的输入,输入参数为XY-3-RPS混联抛光机床三根驱动杆的杆长值,n表示训练样本的数量,输入层与隐含层的连接权值为1,h=[hj]T为神经网络隐含层的输出,j为隐含层节点数;u=[uj]T是隐含层第j个神经元基函数的中心向量,v=[vj]T为隐含层第j个元基函数的宽度;Among them, x=[x i ] T (i=1,2,...,n) is the input of the neural network, the input parameter is the rod length value of the three driving rods of the XY-3-RPS hybrid polishing machine, and n represents the training sample The number of , the connection weight between the input layer and the hidden layer is 1, h=[h j ] T is the output of the hidden layer of the neural network, j is the number of hidden layer nodes; u=[u j ] T is the hidden layer The center vector of the jth neuron basis function of the layer, v=[v j ] T is the width of the jth element basis function of the hidden layer;

S202、确定RBF神经网络的输出为

Figure BDA0003762421300000097
其中w=[wm]T是隐含层到输出层的权值,ym为神经网络的实际输出;S202. Determine the output of the RBF neural network as
Figure BDA0003762421300000097
Where w=[w m ] T is the weight from the hidden layer to the output layer, and y m is the actual output of the neural network;

S203、先进行网络初始化,在混联机构的运动学逆解中随机选取j个训练作为聚类中心ujS203, initialize the network first, randomly select j trainings as the cluster center u j in the kinematic inverse solution of the hybrid mechanism;

S204、按照最近邻规则分组,将xi按照与聚类中心的欧式距离分配到样本的各个聚类集合φi(i=1,2,…,n)中;S204, grouping according to the nearest neighbor rule, and assigning x i to each cluster set φ i (i=1,2,...,n) of the sample according to the Euclidean distance from the cluster center;

S205、然后调整聚类中心,计算聚类集合φp中训练样本的平均值作为新的聚类中心,如果新的聚类中心不再发生变化,则所得到的聚类中心即为RBF神经网络的最终基函数中心,如果不是,则返回上一步,重新进行聚类中心求解;S205, then adjust the cluster center, and calculate the average value of the training samples in the cluster set φ p as the new cluster center. If the new cluster center no longer changes, the obtained cluster center is the RBF neural network The final basis function center of , if not, return to the previous step and re-solve the cluster center;

S206、基函数宽度求解,由于选取的RBF神经网络的基函数为高斯函数,高斯基函数宽度的求解公式

Figure BDA0003762421300000101
umax为所选取中心之间的最大距离;S206, solve the width of the basis function, since the basis function of the selected RBF neural network is a Gaussian function, the solution formula for the width of the Gaussian basis function
Figure BDA0003762421300000101
u max is the maximum distance between the selected centers;

S207、计算权值:隐含层到输出层的权值用最小二乘法计算,计算公式为S207. Calculate the weight: the weight from the hidden layer to the output layer is calculated by the least square method, and the calculation formula is

Figure BDA0003762421300000102
Figure BDA0003762421300000102

S208、根据运动学的逆解结果,在规定的运动范围内,随机选取5000个采样点,作为神经网络的训练数据,其中4800个采样点作为训练样本,其余的200个采样点作为测试样本。S208. According to the inverse kinematics solution result, within a specified motion range, randomly select 5000 sampling points as training data of the neural network, of which 4800 sampling points are used as training samples, and the remaining 200 sampling points are used as test samples.

本实施例中,所述S3具体包括以下操作步骤:In this embodiment, the S3 specifically includes the following operation steps:

S301、将求解机构正向运动学方程组,即求解末端操作平台中心的β位姿zC、α、β方程根的问题转化为求解方程Fi(hi)-Fi(hi-1)=Fi`(hi-1)(hi-hi-1);S301. Convert the problem of solving the forward kinematic equations of the mechanism, that is, the problem of solving the β pose z C , α and β equation roots of the center of the terminal operating platform, into solving the equation F i (hi )-F i ( hi -1 )=F i `(h i-1 )(h i -h i-1 );

S302、求解方程Fi(hi)-Fi(hi-1)=Fi`(hi-1)(hi-hi-1)转换为矩阵形式得S302, solve the equation F i (h i )-F i (h i-1 )=F i `(h i-1 )(h i -h i-1 ) and convert it into matrix form to obtain

Figure BDA0003762421300000103
Figure BDA0003762421300000103

其中in

Figure BDA0003762421300000111
为XY-3-RPS混联抛光机构的雅克比矩阵;
Figure BDA0003762421300000111
It is the Jacobian matrix of the XY-3-RPS mixed polishing mechanism;

S303、取测试样本训练的估计值作为牛顿迭代的初始值通过正运动学方程进行迭代计算,记录每一次的迭代差值|hi-hi-1|,并判断迭代差值|hi-hi-1是否小于精度要求ε,当|hi-hi-1|小于精度要求ε时,输出迭代值,而此时的hi就是混联机构的正向运动学方程组Fi(α,β,zC)=0的近似解,反之,则继续迭代,直到精度满足输出结果。S303, take the estimated value of the test sample training as the initial value of the Newton iteration, perform iterative calculation through the forward kinematic equation, record the difference value of each iteration |h i -h i-1 |, and judge the iterative difference value |h i - Whether h i-1 is less than the accuracy requirement ε, when |h i -h i-1 | is smaller than the accuracy requirement ε, the iterative value is output, and h i at this time is the forward kinematic equation system F i ( α, β, z C ) = 0 approximate solution, otherwise, continue to iterate until the accuracy meets the output result.

进行实验测试验证该算法:Carry out experimental tests to verify the algorithm:

本方案中使用的理论方法有:The theoretical methods used in this scheme are:

(1)闭环矢量法,基于闭环矢量法的连杆运动学分析在用矢量法建立机构的位置方程时,需将杆件用矢量来表示,并做出机构的封闭矢量多边形,矢量之和必等于零。并联机构的支链数个数,即独立的封闭的运动环数。运动环已经用红线表示出。运动环的起点终点都是定、静平台坐标系的原点,经过平台与定静平台的铰点,此方法体现的结构简图如图2所示。(1) Closed-loop vector method, link kinematics analysis based on closed-loop vector method When the vector method is used to establish the position equation of the mechanism, the rod must be represented by a vector, and the closed vector polygon of the mechanism is made. The sum of the vectors must be equal to zero. The number of branches of the parallel mechanism, that is, the number of independent closed motion rings. The motion ring has been shown with a red line. The starting point and end point of the motion loop are the origin of the coordinate system of the fixed and static platforms, passing through the hinge point between the platform and the fixed and static platform. The structure diagram of this method is shown in Figure 2.

(2)如图3和图4所示,牛顿迭代法是数值法中使用最广泛的算法之一,其求解的基本思想就是将非线性方程组逐步转化成线性方程,通过给定特定的迭代初值,利用有限次的迭代,求出近似解。而混联抛光机构的正运动学方程的本质即为求解一组隐式的非线性方程组。求解此类问题往往只能通过数值法来得到近似解。(2) As shown in Figure 3 and Figure 4, the Newton iteration method is one of the most widely used algorithms in numerical methods. The basic idea of its solution is to gradually convert nonlinear equations into linear equations. The initial value, using a finite number of iterations, to obtain an approximate solution. The essence of the forward kinematic equations of the hybrid polishing mechanism is to solve a set of implicit nonlinear equations. Solving such problems can often only be approximated by numerical methods.

(3)自组织选取中心法,根据径向基函数中心选取方法的不同,RBF网络有多种学习方法,如随机选取中心法、自组织选取中心法、有监督选取中心法和正交最小二乘法等。该方法由两个阶段组成:一是自组织学习阶段,此阶段为无导师学习过程,求解隐含层基函数的中心与方差;二是有导师学习阶段,此阶段求解隐含层到输出层之间的权值,在此选用高斯函数

Figure BDA0003762421300000121
作为基函数,其中,x=[xi]T(i=1,2,…,n)为神经网络的输入,输入参数为XY-3-RPS混联抛光机床三根驱动杆的杆长值,n表示训练样本的数量。输入层与隐含层的连接权值为1。h=[hj]T为神经网络隐含层的输出,j为隐含层节点数;u=[uj]T是隐含层第j个神经元基函数的中心向量,v=[vj]T为隐含层第j个神经元基函数的宽度也称作为方差,此方法对应的从输入层到隐含层再到输出层对应的RBF神经网络结构图如图5所示。(3) Self-organizing center selection method. According to different radial basis function center selection methods, RBF network has a variety of learning methods, such as random selection center method, self-organizing center selection method, supervised center selection method and orthogonal least squares method. Multiplication, etc. The method consists of two stages: one is the self-organized learning stage, this stage is the unsupervised learning process, and the center and variance of the underlying function of the hidden layer are solved; the second is the tutored learning stage, which solves the hidden layer to the output layer. The weight between , choose Gaussian function here
Figure BDA0003762421300000121
As the basis function, where x=[x i ] T (i=1,2,...,n) is the input of the neural network, and the input parameter is the rod length value of the three driving rods of the XY-3-RPS hybrid polishing machine, n represents the number of training samples. The connection weight between the input layer and the hidden layer is 1. h=[h j ] T is the output of the hidden layer of the neural network, j is the number of nodes in the hidden layer; u=[u j ] T is the center vector of the basis function of the jth neuron in the hidden layer, v=[v j ] T is the width of the basis function of the jth neuron in the hidden layer, also known as the variance. The corresponding RBF neural network structure diagram from the input layer to the hidden layer to the output layer corresponding to this method is shown in Figure 5.

对几种算法的性能比较:Performance comparison of several algorithms:

理论方法中算法各参数的设置:The settings of the parameters of the algorithm in the theoretical method:

如图5所示,由于RBF神经网络的训练需要大量的样本数据,在XY-3-RPS混联抛光机床的运动范围内,随机选取多组逆解,以供神经网络的训练。神经网络的训练精度与样本数有关,样本数越多,训练的结果精度越高,相应的运行速度也越慢;反之,样本数偏少的话,训练的结果精度也会偏低。因此,RBF神经网络往往受限于样本数的原因而导致结果的精度不如牛顿迭代法的精度高。然而,牛顿迭代法也受限于初值的选取,选取合适的初值会在极大程度上减少算法的迭代次数与时间,可以更快速的得到高精度的结果,其中算法的各个参数设置如下:As shown in Figure 5, since the training of the RBF neural network requires a large amount of sample data, within the motion range of the XY-3-RPS hybrid polishing machine, multiple sets of inverse solutions are randomly selected for the training of the neural network. The training accuracy of a neural network is related to the number of samples. The more samples, the higher the accuracy of the training results and the slower the corresponding running speed; on the contrary, if the number of samples is too small, the accuracy of the training results will be lower. Therefore, the RBF neural network is often limited by the number of samples, and the accuracy of the results is not as high as that of the Newton iteration method. However, the Newton iteration method is also limited by the selection of the initial value. Selecting a suitable initial value will greatly reduce the number of iterations and time of the algorithm, and can obtain high-precision results faster. The parameters of the algorithm are set as follows :

在规定的运动范围内,随机选取5000个采样点,作为神经网络的训练数据,其中4800个采样点作为训练样本,其余的200个采样点作为测试样本,将测试样本训练的估计值作为牛顿迭代的初始值通过正运动学方程进行迭代计算,记录每一次的迭代差值,本发明中混合算法的牛顿迭代法迭代代数根据具体函数以及函数变量的维数而变化。Within the specified range of motion, 5000 sampling points are randomly selected as the training data of the neural network, of which 4800 sampling points are used as training samples, and the remaining 200 sampling points are used as test samples, and the estimated value of the test sample training is used as the Newton iteration The initial value of is iteratively calculated through the forward kinematic equation, and the difference value of each iteration is recorded. The iterative algebra of the Newton iteration method of the hybrid algorithm in the present invention changes according to the specific function and the dimension of the function variable.

得到改进前的误差曲线如图6所示,改进后的误差曲线如图7所示。均方误差如表1所示,迭代次数曲线如图8所示,迭代时间曲线如图9所示,改进前后的迭代次数、时间如表2所示。The error curve before improvement is shown in Figure 6, and the error curve after improvement is shown in Figure 7. The mean square error is shown in Table 1, the iteration number curve is shown in Figure 8, the iteration time curve is shown in Figure 9, and the iteration number and time before and after improvement are shown in Table 2.

Figure BDA0003762421300000131
Figure BDA0003762421300000131

表1均方误差Table 1 Mean Square Error

Figure BDA0003762421300000132
Figure BDA0003762421300000132

表2Table 2

以上所述,仅是本发明的较佳实施例,并非对本发明作任何限制。凡是根据发明技术实质对以上实施例所作的任何简单修改、变更以及等效变化,均仍属于本发明技术方案的保护范围内。The above descriptions are only preferred embodiments of the present invention, and do not limit the present invention in any way. Any simple modifications, changes and equivalent changes made to the above embodiments according to the technical essence of the invention still fall within the protection scope of the technical solutions of the present invention.

Claims (4)

1.一种基于RBF神经网络改进牛顿迭代算法的正向运动学分析方法,其特征在于,包括以下操作步骤:1. a forward kinematics analysis method based on RBF neural network improvement Newton iterative algorithm, is characterized in that, comprises the following operation steps: S1、使用闭环矢量法,在绝对坐标系下建立混联抛光机构的杆长公式,得到运动学逆解方程,在逆解方程的基础上,建立非线性方程组作为正向运动学方程;S1. Using the closed-loop vector method, the rod length formula of the hybrid polishing mechanism is established in the absolute coordinate system, and the kinematic inverse solution equation is obtained. On the basis of the inverse solution equation, a nonlinear equation system is established as the forward kinematic equation; S2、选取RBF神经网络中心,选用高斯函数作为基函数根据运动学的逆解结果,在规定的运动范围内,随机选取j个采样点作为神经网络的训练数据,并将j个采样点分为训练样本和测试样本;S2. Select the center of the RBF neural network, and select the Gaussian function as the basis function. According to the inverse solution result of kinematics, within the specified motion range, randomly select j sampling points as the training data of the neural network, and divide the j sampling points into training samples and test samples; S3、将神经网络训练得到的估计值作为迭代初值通过正向运动学方程进行迭代计算,记录每一次的迭代差值|hi-hi-1|,并判断迭代差值|hi-hi-1|是否小于精度要求ε,若|hi-hi-1|小于精度要求ε,则输出迭代值并结束流程,反之,则继续迭代,直到精度满足输出结果。S3. Use the estimated value obtained by neural network training as the initial iterative value to perform iterative calculation through the forward kinematics equation, record each iteration difference |h i -h i-1 |, and judge the iterative difference |h i - Whether h i-1 | is less than the accuracy requirement ε, if |h i -h i-1 | is less than the accuracy requirement ε, output the iteration value and end the process, otherwise, continue to iterate until the accuracy meets the output result. 2.根据权利要求1所述的一种基于RBF神经网络改进牛顿迭代算法的正向运动学分析方法,其特征在于,所述S1具体包括以下操作步骤:2. a kind of forward kinematics analysis method based on RBF neural network improvement Newton iterative algorithm according to claim 1, is characterized in that, described S1 specifically comprises the following operation steps: S101、针对混联抛光平台机构模型,绘制混联机构的结构简图,Ai和Pi(i=1,2,3)分别是并联平台的转动副和球副的中心,由此构成的三角形ΔA1A2A3和ΔP1P2P3分别表示为定平台和动平台,定平台的外接圆半径分别用R和r来表示,每条支链用向量AiPi来表示,X向串联平台用移动副M来表示,Y向串联平台用移动副N来表示;S101. Draw a schematic structural diagram of the hybrid mechanism according to the mechanism model of the hybrid polishing platform. A i and P i (i=1, 2, 3) are the centers of the rotating pair and the ball pair of the parallel platform, respectively. The triangles ΔA 1 A 2 A 3 and ΔP 1 P 2 P 3 are respectively represented as a fixed platform and a moving platform, the circumradius of the fixed platform is represented by R and r respectively, and each branch is represented by a vector A i P i , The X-direction series platform is represented by the moving pair M, and the Y-direction series platform is represented by the moving pair N; S102、对混联抛光机器人的结构,分别建立动平台坐标系{C1}、定平台坐标系{C2}、绝对坐标系{C0},坐标原点分别是动平台的几何中心C1、定平台的几何中心C2、移动副M的中心C0S102. For the structure of the hybrid polishing robot, establish a moving platform coordinate system {C 1 }, a fixed platform coordinate system {C 2 }, and an absolute coordinate system {C 0 } respectively, and the coordinate origins are the geometric center C 1 , The geometric center C 2 of the fixed platform and the center C 0 of the moving pair M; S103、采用闭环矢量法进行运动学分析,运动环的起点是定平台坐标系的原点C,先经过驱动杆与定平台的铰点Ai,再经过驱动杆与动平台的铰点Pi,终点就是动平台坐标系的坐标原点C1S103, using the closed-loop vector method for kinematics analysis, the starting point of the motion loop is the origin C of the coordinate system of the fixed platform, first passes through the hinge point A i of the driving rod and the fixed platform, and then passes through the hinge point P i of the driving rod and the moving platform, The end point is the coordinate origin C 1 of the moving platform coordinate system; S104、并联机构总共有三条支链,每个都是独立的封闭的运动环,每个运动环用向量形式表示为CC1+C1Pi=CAi+AiPi,并改写为
Figure FDA0003762421290000028
S104. The parallel mechanism has a total of three branch chains, each of which is an independent closed motion loop, and each motion loop is expressed in vector form as CC 1 +C 1 P i =CA i +A i P i , and rewritten as
Figure FDA0003762421290000028
S105、每条支链都会受到转动副的约束,且转动副轴线单位向量ji始终与支链垂直,所以可得支链的约束方程
Figure FDA0003762421290000029
S105. Each branch chain will be constrained by the rotation pair, and the unit vector ji of the rotation pair axis is always perpendicular to the branch chain, so the constraint equation of the branch chain can be obtained
Figure FDA0003762421290000029
S106、:得到xc、yc、γ关于zc、α、β的表达式,S106: Obtain the expressions of x c , y c , γ about z c , α, β,
Figure FDA0003762421290000021
Figure FDA0003762421290000021
yC=-r cosβsinγy C = -r cosβsinγ
Figure FDA0003762421290000022
Figure FDA0003762421290000022
S107、限于3阶矩阵只能表示纯旋转运动,为了表示混联机构的平移运动,将xc、yc、γ关于zc、α、β的表达式广义化为4阶的齐次坐标,即S107. Limited to the third-order matrix, it can only represent pure rotational motion. In order to represent the translational motion of the hybrid mechanism, the expressions of x c , y c , and γ about z c , α, and β are generalized to the fourth-order homogeneous coordinates, which is
Figure FDA0003762421290000023
Figure FDA0003762421290000023
S108、定平台坐标系相对于绝对坐标系只有沿X、Y轴向的平移,动平台相对于定平台没有沿X、Y轴向的相对运动,因此,动平台坐标系相对于绝对坐标系的变换矩阵为:S108, the fixed platform coordinate system only has translation along the X and Y axes relative to the absolute coordinate system, and the moving platform has no relative movement along the X and Y axes relative to the fixed platform. The transformation matrix is:
Figure FDA0003762421290000024
Figure FDA0003762421290000024
Figure FDA0003762421290000025
Figure FDA0003762421290000025
S109、经公式代入求解转化可以得到XY-3-RPS混联抛光机构的驱动杆长li,表示为:S109. The driving rod length l i of the XY-3-RPS hybrid polishing mechanism can be obtained by substituting the formula into the solution and transformation, which is expressed as:
Figure FDA0003762421290000026
Figure FDA0003762421290000026
式中,
Figure FDA0003762421290000027
为点Ai在绝对坐标系下的位置;
In the formula,
Figure FDA0003762421290000027
is the position of point A i in the absolute coordinate system;
S110、串联十字滑台的驱动位移为x、y,并联驱动杆位移为li,求解机床末端操作平台中心的位姿zC、α、β,进而得到混联抛光机构的杆长公式S110, the drive displacement of the series cross slide is x, y, the parallel drive rod displacement is li , solve the pose z C , α, β of the center of the operation platform at the end of the machine tool, and then obtain the rod length formula of the hybrid polishing mechanism
Figure FDA0003762421290000031
Figure FDA0003762421290000031
3.根据权利要求1所述的一种基于RBF神经网络改进牛顿迭代算法的正向运动学分析方法,其特征在于,所述S2具体包括以下操作步骤:3. a kind of forward kinematics analysis method based on RBF neural network improvement Newton iterative algorithm according to claim 1 is characterized in that, described S2 specifically comprises the following operation steps: S201、采用自组织选取中心法选取RBF神经网络函数中心,选用高斯函数作为基函数,函数表达式为S201. Use the self-organizing center selection method to select the function center of the RBF neural network, select the Gaussian function as the basis function, and the function expression is
Figure FDA0003762421290000032
Figure FDA0003762421290000032
其中,x=[xi]T(i=1,2,...,n)为神经网络的输入,输入参数为混联抛光机床三根驱动杆的杆长值,n表示训练样本的数量,输入层与隐含层的连接权值为1,h=[hj]T为神经网络隐含层的输出,j为隐含层节点数;u=[uj]T是隐含层第j个神经元基函数的中心向量,v=[vj]T为隐含层第j个元基函数的宽度;Among them, x=[x i ] T (i=1,2,...,n) is the input of the neural network, the input parameter is the rod length value of the three driving rods of the hybrid polishing machine, n represents the number of training samples, The connection weight between the input layer and the hidden layer is 1, h=[h j ] T is the output of the hidden layer of the neural network, j is the number of nodes in the hidden layer; u=[u j ] T is the jth hidden layer The center vector of the neuron basis functions, v=[v j ] T is the width of the jth element basis function of the hidden layer; S202、确定RBF神经网络的输出为
Figure FDA0003762421290000033
其中w=[wm]T是隐含层到输出层的权值,ym为神经网络的实际输出;
S202. Determine the output of the RBF neural network as
Figure FDA0003762421290000033
Where w=[w m ] T is the weight from the hidden layer to the output layer, and y m is the actual output of the neural network;
S203、先进行网络初始化,在混联机构的运动学逆解中随机选取j个训练作为聚类中心ujS203, initialize the network first, randomly select j trainings as the cluster center u j in the kinematic inverse solution of the hybrid mechanism; S204、按照最近邻规则分组,将xi按照与聚类中心的欧式距离分配到样本的各个聚类集合φi(i=1,2,…,n)中;S204, grouping according to the nearest neighbor rule, and assigning x i to each cluster set φ i (i=1,2,...,n) of the sample according to the Euclidean distance from the cluster center; S205、调整聚类中心,计算聚类集合φp中训练样本的平均值作为新的聚类中心,如果新的聚类中心不再发生变化,则所得到的聚类中心即为RBF神经网络的最终基函数中心,如果新的聚类中心发生变化,则返回上一步,重新进行聚类中心求解;S205. Adjust the cluster center, and calculate the average value of the training samples in the cluster set φ p as the new cluster center. If the new cluster center no longer changes, the obtained cluster center is the value of the RBF neural network. The final basis function center, if the new cluster center changes, return to the previous step and re-solve the cluster center; S206、基函数宽度求解:高斯基函数宽度的求解公式为
Figure FDA0003762421290000034
umax为所选取中心之间的最大距离;
S206, basis function width solution: the solution formula for the Gaussian basis function width is:
Figure FDA0003762421290000034
u max is the maximum distance between the selected centers;
S207、计算权值:隐含层到输出层的权值用最小二乘法计算,计算公式为S207. Calculate the weight: the weight from the hidden layer to the output layer is calculated by the least square method, and the calculation formula is
Figure FDA0003762421290000035
Figure FDA0003762421290000035
S208、根据运动学的逆解结果,在规定的运动范围内,随机选取5000个采样点作为神经网络的训练数据,其中4800个采样点作为训练样本,其余的200个采样点作为测试样本。S208. According to the inverse kinematics solution result, within a specified motion range, randomly select 5000 sampling points as training data of the neural network, of which 4800 sampling points are used as training samples, and the remaining 200 sampling points are used as test samples.
4.根据权利要求1所述的一种基于RBF神经网络改进牛顿迭代算法的正向运动学分析方法,其特征在于,所述S3具体包括以下操作步骤:4. a kind of forward kinematics analysis method based on RBF neural network improvement Newton iterative algorithm according to claim 1, is characterized in that, described S3 specifically comprises following operation steps: S301、将求解机构正向运动学方程组,即求解末端操作平台中心的β位姿zC、α、β方程根的问题转化为求解方程Fi(hi)-Fi(hi-1)=Fi`(hi-1)(hi-hi-1);S301. Convert the problem of solving the forward kinematic equations of the mechanism, that is, the problem of solving the β pose z C , α and β equation roots of the center of the terminal operating platform, into solving the equation F i (hi )-F i ( hi -1 )=F i `(h i-1 )(h i -h i-1 ); S302、求解方程Fi(hi)-Fi(hi-1)=Fi`(hi-1)(hi-hi-1)转换为矩阵形式得S302, solve the equation F i (h i )-F i (h i-1 )=F i `(h i-1 )(h i -h i-1 ) and convert it into matrix form to obtain
Figure FDA0003762421290000041
Figure FDA0003762421290000041
其中in
Figure FDA0003762421290000042
为XY-3-RPS混联抛光机构的雅克比矩阵;
Figure FDA0003762421290000042
It is the Jacobian matrix of the XY-3-RPS mixed polishing mechanism;
S303、取测试样本训练的估计值作为牛顿迭代的初始值通过正运动学方程进行迭代计算,记录每一次的迭代差值|hi-hi-1|,并判断迭代差值|hi-hi-1|是否小于精度要求ε,当|hi-hi-1|小于精度要求ε时,输出迭代值,而此时的hi就是混联机构的正向运动学方程组Fi(α,β,zC)=0的近似解,反之,则继续迭代,直到精度满足输出结果。S303, take the estimated value of the test sample training as the initial value of the Newton iteration, perform iterative calculation through the forward kinematic equation, record the difference value of each iteration |h i -h i-1 |, and judge the iterative difference value |h i - Whether h i-1 | is less than the accuracy requirement ε, when |h i -h i-1 | is smaller than the accuracy requirement ε, the iterative value is output, and h i at this time is the forward kinematic equation system F i of the hybrid mechanism (α,β,z C )=0 approximate solution, otherwise, continue to iterate until the accuracy meets the output result.
CN202210876632.9A 2022-07-25 2022-07-25 A forward kinematics analysis method based on RBF neural network to improve Newton's iterative algorithm Active CN115098978B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210876632.9A CN115098978B (en) 2022-07-25 2022-07-25 A forward kinematics analysis method based on RBF neural network to improve Newton's iterative algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210876632.9A CN115098978B (en) 2022-07-25 2022-07-25 A forward kinematics analysis method based on RBF neural network to improve Newton's iterative algorithm

Publications (2)

Publication Number Publication Date
CN115098978A true CN115098978A (en) 2022-09-23
CN115098978B CN115098978B (en) 2025-04-18

Family

ID=83297879

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210876632.9A Active CN115098978B (en) 2022-07-25 2022-07-25 A forward kinematics analysis method based on RBF neural network to improve Newton's iterative algorithm

Country Status (1)

Country Link
CN (1) CN115098978B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115972216A (en) * 2023-03-17 2023-04-18 中南大学 Parallel robot forward motion solution method, control method, equipment and storage medium
CN116276990A (en) * 2023-03-02 2023-06-23 珞石(北京)科技有限公司 Kinematics Forward Solution Method of Two Degrees of Freedom Parallel Structure Based on Neural Network Training
CN117609673A (en) * 2024-01-24 2024-02-27 中南大学 Six-degree-of-freedom parallel mechanism forward solution method based on physical information neural network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114329825A (en) * 2021-12-20 2022-04-12 燕山大学 An Improved Method for Solving Forward Kinematic Parameters of Stewart Parallel Mechanisms
CN114779643A (en) * 2022-04-29 2022-07-22 哈尔滨理工大学 A terminal sliding mode control system for manipulator based on screw model

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114329825A (en) * 2021-12-20 2022-04-12 燕山大学 An Improved Method for Solving Forward Kinematic Parameters of Stewart Parallel Mechanisms
CN114779643A (en) * 2022-04-29 2022-07-22 哈尔滨理工大学 A terminal sliding mode control system for manipulator based on screw model

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
宋伟刚 等: "基于径向基函数神经网络的并联机器人运动学正问题", 东北大学学报, no. 4, 15 April 2004 (2004-04-15), pages 386 - 389 *
尧章鹏: "基于混合策略的Stewart平台正解与伺服控制系统研究", 中国优秀硕士学位论文全文数据库 信息科技辑, no. 4, 15 April 2020 (2020-04-15), pages 140 - 43 *
王笑荣: "XY-3-RPS混联抛光机床神经网络滑模变结构控制研究", 中国优秀硕士学位论文全文数据库 工程科技Ⅰ辑, no. 2, 15 February 2023 (2023-02-15), pages 022 - 2405 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116276990A (en) * 2023-03-02 2023-06-23 珞石(北京)科技有限公司 Kinematics Forward Solution Method of Two Degrees of Freedom Parallel Structure Based on Neural Network Training
CN115972216A (en) * 2023-03-17 2023-04-18 中南大学 Parallel robot forward motion solution method, control method, equipment and storage medium
CN117609673A (en) * 2024-01-24 2024-02-27 中南大学 Six-degree-of-freedom parallel mechanism forward solution method based on physical information neural network
CN117609673B (en) * 2024-01-24 2024-04-09 中南大学 Six-degree-of-freedom parallel mechanism forward solution method based on physical information neural network

Also Published As

Publication number Publication date
CN115098978B (en) 2025-04-18

Similar Documents

Publication Publication Date Title
CN115098978A (en) RBF neural network-based forward kinematics analysis method for improving Newton iterative algorithm
CN110275436B (en) RBF neural network self-adaptive control method of multi-single-arm manipulator
You et al. Model-free control for soft manipulators based on reinforcement learning
CN108932216B (en) A solution method of robot inverse kinematics based on particle swarm optimization algorithm
CN110238839B (en) Multi-shaft-hole assembly control method for optimizing non-model robot by utilizing environment prediction
CN112926641B (en) Three-stage feature fusion method for fault diagnosis of rotating machinery based on multimodal data
CN116460860B (en) A model-based offline reinforcement learning control method for robots
CN111203890B (en) A Robot Position Error Compensation Method
CN110297490B (en) Self-reconstruction planning method of heterogeneous modular robot based on reinforcement learning algorithm
CN106097322A (en) A kind of vision system calibration method based on neutral net
Wagaa et al. Analytical and deep learning approaches for solving the inverse kinematic problem of a high degrees of freedom robotic arm
CN108717262B (en) A special-shaped surface tracking method and system based on moment feature learning neural network
CN109344477B (en) A solution method for inverse kinematics of a 6-DOF manipulator
US20240289610A1 (en) Hybrid data- and model-driven method for predicting remaining useful life of mechanical component
CN110543727B (en) Improved particle swarm algorithm-based omnidirectional mobile intelligent wheelchair robot parameter identification method
Ghasemi et al. Kinematic synthesis of parallel manipulator via neural network approach
CN108959787A (en) Consider the thermal deformation prediction technique and system of the macro dual drive system of actual condition
CN115366099A (en) Mechanical arm depth certainty strategy gradient training method based on forward kinematics
CN114942591A (en) Visual Servo Method and Device
CN112686323B (en) An image recognition method based on convolution extreme learning machine
CN114012733A (en) A robotic arm control method for PC component mold scribing
CN112380655A (en) Robot inverse kinematics solving method based on RS-CMSA algorithm
CN107729991A (en) The neutral net neuron selectivity Activiation method that a kind of position can learn
CN116079730B (en) A control method and system for improving the operation accuracy of robot arms
CN109670538B (en) Method for identifying assembly contact state of non-rigid part

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant