在测量系统中许多传感器的动态特性是一个非线性Wiener模型,即存在着严重的静态非线性和动态响应滞后。当被测量对象的变化率高于传感器的响应速度时,测量结果与真值之间存在较大的动态误差。为了补偿动态误差,文中采用模型参考和Wiene...在测量系统中许多传感器的动态特性是一个非线性Wiener模型,即存在着严重的静态非线性和动态响应滞后。当被测量对象的变化率高于传感器的响应速度时,测量结果与真值之间存在较大的动态误差。为了补偿动态误差,文中采用模型参考和Wiener逆模型辨识的方法建立动态补偿单元。考虑到Wiener逆模型的参数在辨识过程中是慢变的,辨识算法采用非线性滤波最小均方根(nonlinear filtered least mean squares,NFLMS)算法。仿真实验和应用研究表明,使用NFLMS算法辨识得到的补偿单元,能够很好地补偿Wiener型传感器动态误差。展开更多
This paper describes an innovative, genetic algorithm based inverse model of nonlinear transducer. In the inverse modeling, using a genetic algorithm, the unknown coefficients of the model are estimated accurately. T...This paper describes an innovative, genetic algorithm based inverse model of nonlinear transducer. In the inverse modeling, using a genetic algorithm, the unknown coefficients of the model are estimated accurately. The simulation results indicate that this technique provides greater flexibility and suitability than the existing methods. It is very easy to modify the nonlinear transducer on line. Thus the method improves the transducer's accuracy. With the help of genetic algorithm (GA), the model coefficients' training are less likely to be trapped in local minima than traditional gradient based search algorithms.展开更多
文摘在测量系统中许多传感器的动态特性是一个非线性Wiener模型,即存在着严重的静态非线性和动态响应滞后。当被测量对象的变化率高于传感器的响应速度时,测量结果与真值之间存在较大的动态误差。为了补偿动态误差,文中采用模型参考和Wiener逆模型辨识的方法建立动态补偿单元。考虑到Wiener逆模型的参数在辨识过程中是慢变的,辨识算法采用非线性滤波最小均方根(nonlinear filtered least mean squares,NFLMS)算法。仿真实验和应用研究表明,使用NFLMS算法辨识得到的补偿单元,能够很好地补偿Wiener型传感器动态误差。
文摘This paper describes an innovative, genetic algorithm based inverse model of nonlinear transducer. In the inverse modeling, using a genetic algorithm, the unknown coefficients of the model are estimated accurately. The simulation results indicate that this technique provides greater flexibility and suitability than the existing methods. It is very easy to modify the nonlinear transducer on line. Thus the method improves the transducer's accuracy. With the help of genetic algorithm (GA), the model coefficients' training are less likely to be trapped in local minima than traditional gradient based search algorithms.
