检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴钦木[1] 王婷婷[2] 黎小燕 WU Qinmu;WANG Tingting;LI Xiaoyan(Electric Engineering Institute,Guizhou University,GuiZhou 550003,China;Electrical Engineering College,Guizhou Institute of Technology,Guizhou 550025,China)
机构地区:[1]贵州大学电气工程学院,贵阳550025 [2]贵州理工学院电气工程学院,贵阳550003
出 处:《微电机》2018年第3期11-17,42,共8页Micromotors
基 金:国家自然科学基金资助项目(51367006);贵州省自然科学基金资助项目(黔科合J字[2013]2133号)
摘 要:提出一种计算简单、迭代次数少和计算量小的IPMSM控制系统优化电流的求解算法。首先,将IPMSM的效率优化建模为基于非线性约束的规划问题;然后,将该问题求解转化为二次型规划(QP)序列的求解;最后利用不动点理论,将Mann迭代序列与QP序列相结合形成改进迭代算法。本文证明了QP序列的收敛性、收敛值和IPMSM控制系统优化电流的同一性,给出了Mann迭代收敛以及与原始QP序列收敛值相同的理论依据。仿真分析了优化电流的五种数值求解方法,其结果表明,本文最终得到的改进的迭代算法具有明显的优越性,比较适用于IPMSM效率优化的数字化控制。Aim to compute optimization currentof control system of IPMSM,this paper proposed analgorithm which have good characteristics,such as computationsimple and less iteration numberand less calculation quantity.First of all,the efficiency optimization of IPMSM was modeled as aconstrainedprogramming problem,then transformed it into linear constraint QP sequence.Finally,according to the fixed point theory,the Mann iteration and the QP sequence were combined for form a new iteration algorithm.The convergenceof QP sequence was proved,and according to theory analysis its convergence value and the solution of the primal programming problem are same.The theoretical basis about the Mann iteration convergence and the same convergence value of the Mann iteration and the prime QP sequence was given.By simulating five computation methods,the improved iteration algorithm proposed finally in this paper has obvious superiority compared with the other four algorithms;it is very fit for the digital control system of IPMSM.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49