Adaptive infinite impulse response system identification using opposition based hybrid coral reefs optimization algorithm

An efficient global adaptive algorithm is required to determine the parameters of infinite impulse response (IIR) filter owing to the error cost surface of adaptive IIR system identification problem being generally nonlinear and non-differentiable. In this paper, a new bio-inspired algorithm, called opposition based hybrid coral reefs optimization algorithm (OHCRO) is applied for the IIR system identification problem. Coral reefs optimization algorithm (CRO) is a novel global algorithm, which mimics the behaviors of corals’ reproduction and coral reef formation. OHCRO is a modified version of CRO, on the one hand utilizing opposition based learning to accelerate global convergence, on the other hand cooperating with rotational direction method to enhance the local search capability. In addition, the Laplace broadcast spawning and power mutation brooding operator are used to maintain the diversity. The simulation studies have been performed for the performance comparison of genetic algorithm, particle swarm optimization and its variants, differential evolution and its variants and the proposed OHCRO for well-known benchmark examples with same order and reduced order filters. Simulation results and comparative studies justify the efficacy of the OHCRO based system identification approach in terms of convergence speed, identified coefficients and fitness values. In conclusion, OHCRO is a promising method for adaptive IIR system identification.     

On a cuckoo search optimization approach towards feedback system identification

This paper presents a cuckoo search algorithm (CSA) based adaptive infinite impulse response (IIR) system identification scheme. The proposed scheme prevents the local minima problem encountered in conventional IIR modeling mechanisms. The performance of the new method has been compared with that obtained by other evolutionary computing algorithms like genetic algorithm (GA) and particle swarm optimization (PSO). The superior system identification capability of the proposed scheme is evident from the results obtained through an exhaustive simulation study.     

一类离散时变系统的在线无限脉冲响应滤波逆控制

针对一类离散时变系统,提出了一种基于自适应惯性权重合作粒子群（AIW—CPSO）算法的在线尢限脉冲响应（IIR）滤波自适应系统辨识方法,实现零极点实时跟踪的全匹配控制．IIR滤波器可解决有限脉冲响应（FIR）滤波器在辨识时变系统时因其相关矩阵的特征值会无规律变大而被迫离线训练的问题．同时义降低了在线训练所需的权值向量长度,提升了优化与建模效率．本文设计的白适应惯性权重合作粒子群（AIW—CPSO）算法可在传统卡讧子群优化（PSO）算法的基础上更好地解决因选用IIR滤波器所带来的全局优化问题．通过仿真分析可以看出,对十此类离散时变系统,基于在线AIW—CPSO—IIR滤波器的自适应逆控制方法可以快速有效的实现未知对象的在线建模,同时实时跟踪时变系统的特征值变化．     

Particle swarm optimization with quantum infusion for system identification

System identification is a challenging and complex optimization problem due to nonlinearity of the systems and even more in a dynamic environment. Adaptive infinite impulse response (IIR) systems are preferably used in modeling real world systems because of their reduced number of coefficients and better performance over the finite impulse response filters. Particle swarm optimization (PSO) and its other variants has been a subject of research for the past few decades for solving complex optimization problems. In this paper, PSO with quantum infusion (PSO–QI) is used in identification of benchmark IIR systems and a real world problem in power systems. PSO–QI’s performance is compared with PSO and differential evolution PSO (DEPSO) algorithms. The results show that PSO–QI has better performance over these algorithms in identifying dynamical systems.     

Distributed and robust parameter estimation of IIR systems using incremental particle swarm optimization

In recent years because of substantial use of wireless sensor network the distributed estimation has attracted the attention of many researchers. Two popular learning algorithms: incremental least mean square (ILMS) and diffusion least mean square (DLMS) have been reported for distributed estimation using the data collected from sensor nodes. But these algorithms, being derivative based, have a tendency of providing local minima solution particularly for minimization of multimodal cost function. Hence for problems like distributed parameters estimation of IIR systems, alternative distributed algorithms are required to be developed. Keeping this in view the present paper proposes two population based incremental particle swarm optimization (IPSO) algorithms for estimation of parameters of noisy IIR systems. But the proposed IPSO algorithms provide poor performance when the measured data is contaminated with outliers in the training samples. To alleviate this problem the paper has proposed a robust distributed algorithm (RDIPSO) for IIR system identification task. The simulation results of benchmark IIR systems demonstrate that the proposed algorithms provide excellent identification performance in all cases even when the training samples are contaminated with outliers.     

基于粒子群优化算法的自适应IIR滤波器设计

针对自适应无限冲激响应(infinite impulse response,IIR)数字滤波器的设计实质上是一个多参数优化问题,提出了一种用粒子群优化算法(particle swarm optimization,PSO)设计IIR数字滤波器的方法.将滤波器的设计问题转化为滤波器参数的优化问题,利用粒子群优化算法对整个参数空间进行高效并行搜索以获得参数的最优化,基于多个典型系统的随机数值仿真以及与最小二乘方法的比较研究,验证了该方法的有效性、全局性和对初值的鲁棒性.     

The evolutionary learning rule for system identification

In this paper, we are proposing an approach for integrating evolutionary computation applied to the problem of system identification in the well-known statistical signal processing theory. Here, some mathematical expressions are developed in order to justify the learning rule in the adaptive process when a breeder genetic algorithm (BGA) is used as the optimization technique. In this work, we are including an analysis of errors, energy measures, and stability.     

基于灰关联分析方法

针对一致关联度算法不具有普遍性和动态改变惯性权的自适应粒子群算法(DCW)不易跳出局部收敛能力的缺陷,本文提出了完全关联度算法和自适应变异的动态粒子群优化算法。完全关联度算法主要用来选择软测量的辅助变量。在改进的粒子群优化算法中,除了采用动态惯性权重外,还引入了自适应学习因子和新的变异算子。为了构造一种性能较好的神经网络,采用改进的粒子群优化算法来优化神经网络所有的权值参数,并将提出的软测量建模方法预测延迟焦化的汽油干点,实验结果表明,与DCW算法优化神经网络(DCWNN)的建模方法相比,该算法不仅具有较好的泛化性能,而且具有较高的精度和良好的应用前景。     

基于双模态自适应小波粒子群的永磁同步电机多参数识别与温度监测方法

提出了一种双模态自适应小波粒子群（Binary-modal adaptive wavelet particle swarm optimization,BAWPSO）的永磁同步电机（Permanent magnet synchronous motor,PMSM）多参数识别与温度监测方法.为了提高算法动态寻优性能,群体被划分为正向学习和反向学习两种模态;对处于不同模态的粒子分别采用正向学习策略与反向学习策略协同求解,扩大了解的搜索空间;同时对粒子个体极值采用自适应小波算子增强学习以提高收敛精度.永磁同步电机参数辨识结果表明所 提方法能够有效地辨识电机电阻,dq轴电感与转子磁链等参数,且能有效追踪系统参数变化值.在辨识出电机定子绕阻值后,根据金属阻值与温度之间的线性 原理间接计算定转子温度,从而实现永磁同步电机系统温度在线监测.     

一种基于粒子群算法的分类器设计

将粒子群算法应用于数据分类,给出了适用于粒子群算法的分类规则编码,构造了新的分类规则适应度函数来更准确的提取规则集,并通过修改粒子位置更新方程使粒子群算法适于解决分类规则挖掘问题,进而实现了基于粒子群算法的分类器设计。该文进一步用UCI基准数据集对作者提出的粒子群分类器进行了测试,并将几种不同速度与位置更新策略的粒子群算法分类器与遗传算法分类器进行对比,实验结果表明,这种粒子群分类器是一种有效、可行的分类器设计方案。     

基于改进PSO的发酵过程同步串联混合建模

准确可靠的过程模型是实现发酵过程优化的基础和前提. 对于反应机理复杂的发酵过程,串联混合建模是一种相对有效的建模方法, 但现有方法需要利用插值所得的数据进行中间变量黑箱模型的构建, 较大程度地影响了所建混合模型的泛化性能. 为此,提出一种可将黑箱模型构建问题转化为动态模型参数辨识问题的同步串联混合建模方法, 从而避免了现有方法需利用插值数据来构建黑箱模型的不足; 通过引入多精英学习策略和惯性权重自适应调整策略, 构造了一种改进的粒子群优化(Particle swarm optimization, PSO)算法自适应多精英学习PSO (Adaptive multi-elite learning PSO, AMLPSO)算法,并采用该算法求取黑箱模型的参数; 借鉴均匀设计思想确定黑箱模型的结构. 利用诺西肽分批发酵过程实际生产数据进行实验研究, 结果验证了所提方法的有效性.     

A novel optimal PID controller autotuning design based on the SLP algorithm

A novel optimal proportional integral derivative (PID) autotuning controller design based on a new algorithm approach, the “swarm learning process” (SLP) algorithm, is proposed. It improves the convergence and performance of the autotuning PID parameter by applying the swarm and learning algorithm concepts. Its convergence is verified by two methods, global convergence and characteristic convergence. In the case of global convergence, the convergence rule of a random search algorithm is employed to judge, and Markov chain modelling is used to analyse. The superiority of the proposed method, in terms of characteristic convergence and performance, is verified through the simulation based on the automatic voltage regulator and direct current motor control system. Verification is performed by comparing the results of the proposed model with those of other algorithms, that is, the ant colony optimization with a new constrained Nelder–Mead algorithm, the genetic algorithm (GA), the particle swarm optimization (PSO) algorithm, and a neural network (NN). According to the global convergence analysis, the proposed method satisfies the convergence rule of the random search algorithm. With respect to the characteristic convergence and performance, the proposed method provides a better response than the GA, the PSO, and the NN for both control systems.     

A PSO-aided neuro-fuzzy classifier employing linguistic hedge concepts

The present paper proposes the development of an adaptive neuro-fuzzy classifier which employs two relatively less explored and comparatively new problem solving domains in fuzzy systems. The relatively less explored field is the domain of the fuzzy linguistic hedges which has been employed here to define the flexible shapes of the fuzzy membership functions (MFs). To achieve finer and finer adaptation, and hence control, over the fuzzy MFs, each MF is composed of several piecewise MF sections and the shape of each such MF section is varied by applying a fuzzy linguistic operator on it. The system employs a Takagi–Sugeno based neuro-fuzzy system where the rule consequences are described by zero order elements. This proposed linguistic hedge based neuro-fuzzy classifier (LHBNFC) employs a relatively new field in the area of combinatorial metaheuristics, called particle swarm optimization (PSO), for its efficient learning. PSO has been employed in this scheme to simultaneously tune the shape of the fuzzy MFs as well as the rule consequences for the entire fuzzy rule base. The performance of the proposed system is demonstrated by implementing it for two classical benchmark data sets: (i) the iris data and (ii) the thyroid data. Performance comparison vis-à-vis other available algorithms shows the effectiveness of our proposed algorithm.     

基于多目标优化策略的在线学习资源推荐方法

目前在线学习资源推荐较多采用单目标转化方法,推荐过程中对学习者偏好考虑相对不足,影响学习资源推荐精度.针对上述问题,文中提出基于多目标优化策略的在线学习资源推荐模型(MOSRAM),在学习者规划时间内,以同时获得学习者对学习资源类型偏好度最大和难度水平适应度最佳为优化目标,设计具有向邻居均值学习能力和探索新区域能力的多目标粒子群优化算法(NEMOPSO),提出以MOSRAM为核心的在线学习资源推荐方法(NEMOPSO-RA).不同问题规模下融合经典多目标优化算法的推荐方法对比实验表明,NEMOPSO-RA可以有效提高在线学习资源的推荐精度和推荐性能.     

基于相似历史信息迁移学习的进化优化框架

现有进化算法大都从问题的零初始信息开始搜索最优解, 没有利用先前解决相似问题时获得的历史信息, 在一定程度上浪费了计算资源.将迁移学习的思想扩展到进化优化领域, 本文研究一种基于相似历史信息迁移学习的进化优化框架.从已解决问题的模型库中找到与新问题匹配的历史问题, 将历史问题对应的知识迁移到新问题的求解过程中, 以提高种群的搜索效率.首先, 定义一种基于多分布估计的最大均值差异指标, 用来评价新问题与历史模型之间的匹配程度; 接着, 将相匹配的历史问题的知识迁移到新问题中, 给出一种基于模型匹配程度的进化种群初始化策略, 以加快算法的搜索速度; 然后, 给出一种基于迭代聚类的代表个体保存策略, 保留求解过程中产生的优势信息, 用于更新历史模型库; 最后, 将自适应骨干粒子群优化算法嵌入到所提框架, 给出一种基于相似历史信息迁移学习的骨干粒子群优化算法.针对多个改进的典型测试函数, 实验结果表明, 所提迁移策略可以加速粒子群的搜索过程, 显著提高算法的收敛速度和搜索效率.     

Adaptive comprehensive learning particle swarm optimization with cooperative archive

Comprehensive learning particle swarm optimization (CLPSO) enhances its exploration capability by exploiting all other particles’ historical information to update each particle’s velocity. However, CLPSO adopts a set of fixed comprehensive learning (CL) probabilities to learn from other particles, which may impair its performance on complex optimization problems. To improve the performance and adaptability of CLPSO, an adaptive mechanism for adjusting CL probability and a cooperative archive (CA) are combined with CLPSO, and the resultant algorithm is referred to as adaptive comprehensive learning particle swarm optimization with cooperative archive (ACLPSO-CA). The adaptive mechanism dividing the CL probability into three levels and adjusting the individual particle’s CL probability level dynamically according to the performance of the particles during the optimization process. The cooperative archive is employed to provide additional promising information for ACLPO-CA and itself is updated by the cooperative operation of the current swarm and archive. To evaluate the performance of ACLPSO-CA, ACLPSO-CA is tested on CEC2013 test suite and CEC2017 test suite and compared with seven popular PSO variants. The test results show that ACLPSO-CA outperforms other comparative PSO variants on the two CEC test suites. ACLPSO-CA achieves high performance on different types of benchmark functions and exhibits high adaptability as well. In the end, ACLPSO-CA is further applied to a radar system design problem to demonstrate its potential in real-life optimization.     

一种辨识Wiener-Hammerstein模型的新方法

针对非线性Wiener-Hammerstein模型,提出利用粒子群优化算法对非线性模型进行辨识的新方法.该方法的基本思想是将非线性系统的辨识问题转化为参数空间上的优化问题;然后采用粒子群优化算法获得该优化问题的解.为了进一步增强粒子群优化算法的辨识性能,提出利用一种混合粒子群优化算法.最后,仿真结果验证了该方法的有效性和可行性.     

一种鲁棒的总体最小二乘自适应辨识算法

针对输入输出观测数据均含有噪声的系统辨识问题，提出了一种鲁棒的总体最小二乘自适应辨识算法．该算法在对总体最小二乘问题与向量的瑞利商及其性质研究的基础上，以被辨识系统的增广权向量的瑞利商(RQ)作为损失函数，利用梯度最陡下降原理导出权向量的自适应迭代算法，并利用随机离散学习规律对权向量模的分析修正了算法梯度，提高了算法的噪声鲁棒性，构成了一种噪声鲁棒的总体最小二乘自适应辨识算法．文中研究了该算法的收敛性能．仿真实验结果表明该算法的鲁棒抗噪性能和稳态收敛精度明显高于其它同类方法，而且可使用较大的学习因子，在较高的噪声环境下仍然保持良好的收敛性．     

DESIGN OF TWO-DIMENSIONAL INFINITE IMPULSE RESPONSE RECURSIVE FILTERS USING HYBRID MULTIAGENT PARTICLE SWARM OPTIMIZATION

We incorporate the optimization problem of two-dimensional infinite impulse response (IIR) recursive filters and the optimization methodology of hybrid multiagent particle swarm optimization (HMAPSO) and then apply the resultant optimized IIR filter in image processing for justifying HMAPSO robustness over other algorithm and its role in optimizing real-time situations. The design of the 2-D IIR filter is reduced to a constrained minimization problem whose robust solution is being achieved by a novel and optimal algorithm HMAPSO. This algorithm integrates the deterministic solution by the multiagent system, the particle swarm optimization (PSO) algorithm, and bee decision-making process. All agents search parallel in an equally distributed lattice-like structure to save energy and computational time as done by the bees in their hive selection process. Thus making use of deterministic search, multiagent PSO, and bee, the HMAPSO realizes the purpose of optimization. Experimental results and the application of the designed filters to focusing the defocused image show that the HMAPSO approach provides better upshots than the previous design methods.     

AN OPTIMAL DESIGN OF IIR DIGITAL FILTER USING PARTICLE SWARM OPTIMIZATION

In this article, a novel approach for infinite-impulse response (IIR) digital filters using particle swarm optimization (PSO) is presented. IIR filter is essentially a digital filter with recursive responses. Because the error surface of digital IIR filters is generally nonlinear and multimodal, so global optimization techniques are required in order to avoid local minima. This study is based on a heuristic way to design IIR filters. PSO is a powerful global optimization algorithm introduced in combinatorial optimization problems. This study finds the optimum coefficients of the IIR digital filter through PSO. It is found that the calculated values are more optimal than the FDA tool and GA available for the design of the filter in MATLAB. Design of low-pass and high-pass IIR digital filters is proposed in order to provide an estimate of the transition band. The simulation results of the employed examples show an improvement on the transition band. The stability of designed filters is described by the position of Pole-Zeros.