针对多种电机采用的控制器模型也存在不同,电机参数存在多样性,并且针对多种工况下,电机在工作过程中存在参数变化、负载扰动等情况,导致电机参数辨识精度不高、电机-控制器模型失配等问题,提出了一种改进递归最小二乘法(recursive leas...针对多种电机采用的控制器模型也存在不同,电机参数存在多样性,并且针对多种工况下,电机在工作过程中存在参数变化、负载扰动等情况,导致电机参数辨识精度不高、电机-控制器模型失配等问题,提出了一种改进递归最小二乘法(recursive least squares,RLS)算法进行多种工况下多电机参数失配诊断。针对传统的递归最小二乘法在进行在线电机参数辨识时,容易固遗忘因子影响,存在跟随速度慢、抗干扰性差等问题,在原始递归最小二乘法基础上引入了随系统工况变化而变化的“变遗忘因子”,提高电机参数的跟踪速度和抗负载扰动能力;为验证改进后的递归最小二乘法是否具有可靠性、鲁棒性和泛化性,分别设置了5种假设工况,并进行多组实验对比,通过分析电机速度响应、d-q轴电流以及量化分析转矩跟踪和R_(s)参数辨识精度等,验证改进后的算法具有较强的鲁棒性和泛化性;并通过分析性能指标数据,主要包括平均速度、平均q轴电流等,得出改进后算法分析数据的有效性。展开更多
The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covarian...The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.展开更多
In the strip rolling process, shape control system possesses the characteristics of nonlinearity, strong coupling, time delay and time variation. Based on self adapting Elman dynamic recursion network prediction model...In the strip rolling process, shape control system possesses the characteristics of nonlinearity, strong coupling, time delay and time variation. Based on self adapting Elman dynamic recursion network prediction model, the fuzzy control method was used to control the shape on four-high cold mill. The simulation results showed that the system can be applied to real time on line control of the shape.展开更多
The traditional program refinement strategy cannot be refined to an executable program,and there are issues such as low verification reliability and automation.To solve the above problems,this paper proposes a nonline...The traditional program refinement strategy cannot be refined to an executable program,and there are issues such as low verification reliability and automation.To solve the above problems,this paper proposes a nonlinear program construction and verification method based on partition recursion and Morgan’s refinement rules.First,we use recursive definition technique to characterize the initial specification.The specification is then transformed into GCL(Guarded Command Language)programs using loop invariant derivation and Morgan’s refinement rules.Furthermore,VCG(Verification Condition Generator)is used in the GCL program to generate the verification condition automatically.The Isabelle theorem prover then validates the GCL program’s correctness.Finally,the GCL code generates a C++executable program automatically via the conversion system.The effectiveness of this method is demonstrated using binary tree preorder traversal program construction and verification as an example.This method addresses the problem that the construction process’s loop invariant is difficult to obtain and the refinement process is insufficiently detailed.At the same time,the method improves verification process automation and reduces the manual verification workload.展开更多
文摘针对多种电机采用的控制器模型也存在不同,电机参数存在多样性,并且针对多种工况下,电机在工作过程中存在参数变化、负载扰动等情况,导致电机参数辨识精度不高、电机-控制器模型失配等问题,提出了一种改进递归最小二乘法(recursive least squares,RLS)算法进行多种工况下多电机参数失配诊断。针对传统的递归最小二乘法在进行在线电机参数辨识时,容易固遗忘因子影响,存在跟随速度慢、抗干扰性差等问题,在原始递归最小二乘法基础上引入了随系统工况变化而变化的“变遗忘因子”,提高电机参数的跟踪速度和抗负载扰动能力;为验证改进后的递归最小二乘法是否具有可靠性、鲁棒性和泛化性,分别设置了5种假设工况,并进行多组实验对比,通过分析电机速度响应、d-q轴电流以及量化分析转矩跟踪和R_(s)参数辨识精度等,验证改进后的算法具有较强的鲁棒性和泛化性;并通过分析性能指标数据,主要包括平均速度、平均q轴电流等,得出改进后算法分析数据的有效性。
文摘The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.
基金ItemSponsored by Provincial Natural Science Foundation of Hebei Province of China (E2004000206)
文摘In the strip rolling process, shape control system possesses the characteristics of nonlinearity, strong coupling, time delay and time variation. Based on self adapting Elman dynamic recursion network prediction model, the fuzzy control method was used to control the shape on four-high cold mill. The simulation results showed that the system can be applied to real time on line control of the shape.
基金Supported by the National Natural Science Foundation of China(62262031)Science and Technology Key Project of Education Department of Jiangxi Province(GJJ2200302,GJJ210307)the Graduate Innovative Special Fund Projects of Jiangxi Province(YJS2022064)
文摘The traditional program refinement strategy cannot be refined to an executable program,and there are issues such as low verification reliability and automation.To solve the above problems,this paper proposes a nonlinear program construction and verification method based on partition recursion and Morgan’s refinement rules.First,we use recursive definition technique to characterize the initial specification.The specification is then transformed into GCL(Guarded Command Language)programs using loop invariant derivation and Morgan’s refinement rules.Furthermore,VCG(Verification Condition Generator)is used in the GCL program to generate the verification condition automatically.The Isabelle theorem prover then validates the GCL program’s correctness.Finally,the GCL code generates a C++executable program automatically via the conversion system.The effectiveness of this method is demonstrated using binary tree preorder traversal program construction and verification as an example.This method addresses the problem that the construction process’s loop invariant is difficult to obtain and the refinement process is insufficiently detailed.At the same time,the method improves verification process automation and reduces the manual verification workload.
