高能动力电池是供配电系统的核心储能模块,针对高能动力电池的应用构建了二阶等效电路模型。在等效电路模型的基础上,提出联合递推最小二乘(Recursive Least Squares,RLS)法和扩展卡尔曼滤波(Extended Kalman Filter,EKF)的荷电状态(Sta...高能动力电池是供配电系统的核心储能模块,针对高能动力电池的应用构建了二阶等效电路模型。在等效电路模型的基础上,提出联合递推最小二乘(Recursive Least Squares,RLS)法和扩展卡尔曼滤波(Extended Kalman Filter,EKF)的荷电状态(Stage of Charge,SOC)算法,并在其基础上改进为基于温度补偿的联合RLS法和EKF融合的SOC算法。基于MATLAB软件,设计改进前和改进后联合算法的仿真验证程序,并对结果进行了比较分析。仿真结果表明,基于温度补偿的联合算法可实现当SOC处于(0.25,1)的区域内,相对误差基本小于5%,验证了所提出的建模方法和求解方法的有效性。展开更多
An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together fo...An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together form an overall effect that "draws" CA,n towards best fitting to the group of points. The basic element of the force is called circular attracting factor(CAF) which is defined as a real scalar in a radial direction of CA,n. An iterative algorithm based on this idea is proposed, and the convergence and accuracy are analyzed. The algorithm converges uniformly which is proved by the analysis of Lyapunov function, and the accuracy of the algorithm is in accord with that of geometric least squares of circle fitting. The algorithm is adopted to circle detection in grayscale images, in which the transferring to binary images is not required, and thus the algorithm is less sensitive to lightening and background noise. The main point for the adaption is the calculation of CAF which is extended in radial directions of CA,n for the whole image. All pixels would apply forces to CA,n, and the overall effect of forces would be equivalent to a force from the centroid of pixels to CA,n. The forces from would-be edge pixels would overweigh that from noisy pixels, so the following approximate circle would be of better fitting. To reduce the amount of calculation, pixels are only used in an annular area including the boundary of CA,n just in between for the calculation of CAF. Examples are given, showing the process of circle fitting of scattered points around a circle from an initial assuming circle, comparing the fitting results for scattered points from some related literature, applying the method proposed for circular edge detection in grayscale images with noise, and/or with only partial arc of a circle, and for circle detection in BGA inspection.展开更多
In this paper we give a parallel algorithm for obtaining the eigenvalues and eigenvectors of a matrix.The practical background of this algorithm is the numerical computation in conjunction with the symbolic computation.
锂电池荷电状态(state of charge,SOC)的准确估计依赖于精确的锂电池模型参数。在采用带遗忘因子的递推最小二乘法(forgetting factor recursive least square,FFRLS)对锂电池等效电路模型进行参数辨识时,迭代初始值选取不当会造成辨识...锂电池荷电状态(state of charge,SOC)的准确估计依赖于精确的锂电池模型参数。在采用带遗忘因子的递推最小二乘法(forgetting factor recursive least square,FFRLS)对锂电池等效电路模型进行参数辨识时,迭代初始值选取不当会造成辨识精度低、收敛速度慢的问题。为此,将电路分析法与FFRLS相结合,提出基于改进初值带遗忘因子的递推最小二乘法(improved initial value-FFRLS,IIV-FFRLS)。首先,通过离线辨识得到各荷电状态点对应的等效电路模型参数并进行多项式拟合;然后,利用初始开路电压(open circuit voltage,OCV)和OCV-SOC曲线获得初始SOC,代入参数拟合函数得到初始参数;最后,将初始参数带入递推公式得到IIV-FFRLS迭代初始值。对4种锂电池工况进行参数辨识,结果表明:与传统方法相比,IIV-FFRLS的平均相对误差、收敛时间分别减小58%、23%以上;IIV-FFRLS具有更高的辨识精度与更快的收敛速度。展开更多
永磁同步电机(permanent magnet synchronous motor,PMSM)的磁链准确辨识是实现高性能电机控制的基础。针对传统递推最小二乘(recursive least squares,RLS)法受噪声影响小但存在数据饱和,影响辨识精度和动态性问题,以及遗忘最小二乘(re...永磁同步电机(permanent magnet synchronous motor,PMSM)的磁链准确辨识是实现高性能电机控制的基础。针对传统递推最小二乘(recursive least squares,RLS)法受噪声影响小但存在数据饱和,影响辨识精度和动态性问题,以及遗忘最小二乘(recursive least squares with forgetting factor,FRLS)法避免数据饱和但存在参数估计误差与动态跟踪性能矛盾的问题,文章提出一种基于折息最小二乘(recursive least squares with discount factor,DRLS)法的磁链辨识方法。该算法在FRLS法中引入加权因子构成折息因子,采用递推方法进行磁链辨识,减小参数估计误差,提高磁链辨识精度及动态跟踪能力。通过MATLAB仿真及半实物仿真试验,验证所提磁链识别方法的有效性。展开更多
传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squ...传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squares algorithm based on the earth-centered earth-fixed coordinate system,ECEF-GLS)进行了修正,弱化历史量测对配准的影响,并对渐消因子的选取问题进行了研究,给出了合理的设计方法。算法验证表明,基于渐消因子的ECEF-GLS估计算法能够对时变的系统偏差进行有效估计,精度满足配准要求。展开更多
The combination of structural health monitoring and vibration control is of great importance to provide components of smart structures.While synthetic algorithms have been proposed,adaptive control that is compatible ...The combination of structural health monitoring and vibration control is of great importance to provide components of smart structures.While synthetic algorithms have been proposed,adaptive control that is compatible with changing conditions still needs to be used,and time-varying systems are required to be simultaneously estimated with the application of adaptive control.In this research,the identification of structural time-varying dynamic characteristics and optimized simple adaptive control are integrated.First,reduced variations of physical parameters are estimated online using the multiple forgetting factor recursive least squares(MFRLS)method.Then,the energy from the structural vibration is simultaneously specified to optimize the control force with the identified parameters to be operational.Optimization is also performed based on the probability density function of the energy under the seismic excitation at any time.Finally,the optimal control force is obtained by the simple adaptive control(SAC)algorithm and energy coefficient.A numerical example and benchmark structure are employed to investigate the efficiency of the proposed approach.The simulation results revealed the effectiveness of the integrated online identification and optimal adaptive control in systems.展开更多
Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direc...Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direction method of multipliers and hierarchical alternating least squares method.When the given matrix is huge,the cost of computation and communication is too high.Therefore,ONMF becomes challenging in the large-scale setting.The random projection is an efficient method of dimensionality reduction.In this paper,we apply the random projection to ONMF and propose two randomized algorithms.Numerical experiments show that our proposed algorithms perform well on both simulated and real data.展开更多
文摘高能动力电池是供配电系统的核心储能模块,针对高能动力电池的应用构建了二阶等效电路模型。在等效电路模型的基础上,提出联合递推最小二乘(Recursive Least Squares,RLS)法和扩展卡尔曼滤波(Extended Kalman Filter,EKF)的荷电状态(Stage of Charge,SOC)算法,并在其基础上改进为基于温度补偿的联合RLS法和EKF融合的SOC算法。基于MATLAB软件,设计改进前和改进后联合算法的仿真验证程序,并对结果进行了比较分析。仿真结果表明,基于温度补偿的联合算法可实现当SOC处于(0.25,1)的区域内,相对误差基本小于5%,验证了所提出的建模方法和求解方法的有效性。
基金Project(2013CB035504) supported by the National Basic Research Program of ChinaProject(2012zzts078) supported by the Fundamental Research Funds for the Central Universities of Central South University,ChinaProject(2009ZX02038) supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China
文摘An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together form an overall effect that "draws" CA,n towards best fitting to the group of points. The basic element of the force is called circular attracting factor(CAF) which is defined as a real scalar in a radial direction of CA,n. An iterative algorithm based on this idea is proposed, and the convergence and accuracy are analyzed. The algorithm converges uniformly which is proved by the analysis of Lyapunov function, and the accuracy of the algorithm is in accord with that of geometric least squares of circle fitting. The algorithm is adopted to circle detection in grayscale images, in which the transferring to binary images is not required, and thus the algorithm is less sensitive to lightening and background noise. The main point for the adaption is the calculation of CAF which is extended in radial directions of CA,n for the whole image. All pixels would apply forces to CA,n, and the overall effect of forces would be equivalent to a force from the centroid of pixels to CA,n. The forces from would-be edge pixels would overweigh that from noisy pixels, so the following approximate circle would be of better fitting. To reduce the amount of calculation, pixels are only used in an annular area including the boundary of CA,n just in between for the calculation of CAF. Examples are given, showing the process of circle fitting of scattered points around a circle from an initial assuming circle, comparing the fitting results for scattered points from some related literature, applying the method proposed for circular edge detection in grayscale images with noise, and/or with only partial arc of a circle, and for circle detection in BGA inspection.
文摘In this paper we give a parallel algorithm for obtaining the eigenvalues and eigenvectors of a matrix.The practical background of this algorithm is the numerical computation in conjunction with the symbolic computation.
文摘永磁同步电机(permanent magnet synchronous motor,PMSM)的磁链准确辨识是实现高性能电机控制的基础。针对传统递推最小二乘(recursive least squares,RLS)法受噪声影响小但存在数据饱和,影响辨识精度和动态性问题,以及遗忘最小二乘(recursive least squares with forgetting factor,FRLS)法避免数据饱和但存在参数估计误差与动态跟踪性能矛盾的问题,文章提出一种基于折息最小二乘(recursive least squares with discount factor,DRLS)法的磁链辨识方法。该算法在FRLS法中引入加权因子构成折息因子,采用递推方法进行磁链辨识,减小参数估计误差,提高磁链辨识精度及动态跟踪能力。通过MATLAB仿真及半实物仿真试验,验证所提磁链识别方法的有效性。
文摘传统的误差配准算法假设系统偏差恒定或缓慢变化,当系统误差发生突变或快速变化时,这一假设不再成立。针对这一问题,研究了时变条件下的误差配准算法,引入渐消因子,对常规的基于地心地固坐标系的广义最小二乘算法(generalized least squares algorithm based on the earth-centered earth-fixed coordinate system,ECEF-GLS)进行了修正,弱化历史量测对配准的影响,并对渐消因子的选取问题进行了研究,给出了合理的设计方法。算法验证表明,基于渐消因子的ECEF-GLS估计算法能够对时变的系统偏差进行有效估计,精度满足配准要求。
文摘The combination of structural health monitoring and vibration control is of great importance to provide components of smart structures.While synthetic algorithms have been proposed,adaptive control that is compatible with changing conditions still needs to be used,and time-varying systems are required to be simultaneously estimated with the application of adaptive control.In this research,the identification of structural time-varying dynamic characteristics and optimized simple adaptive control are integrated.First,reduced variations of physical parameters are estimated online using the multiple forgetting factor recursive least squares(MFRLS)method.Then,the energy from the structural vibration is simultaneously specified to optimize the control force with the identified parameters to be operational.Optimization is also performed based on the probability density function of the energy under the seismic excitation at any time.Finally,the optimal control force is obtained by the simple adaptive control(SAC)algorithm and energy coefficient.A numerical example and benchmark structure are employed to investigate the efficiency of the proposed approach.The simulation results revealed the effectiveness of the integrated online identification and optimal adaptive control in systems.
基金the National Natural Science Foundation of China(No.11901359)Shandong Provincial Natural Science Foundation(No.ZR2019QA017)。
文摘Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direction method of multipliers and hierarchical alternating least squares method.When the given matrix is huge,the cost of computation and communication is too high.Therefore,ONMF becomes challenging in the large-scale setting.The random projection is an efficient method of dimensionality reduction.In this paper,we apply the random projection to ONMF and propose two randomized algorithms.Numerical experiments show that our proposed algorithms perform well on both simulated and real data.
