具有直流故障穿越能力的模块化多电平换流拓扑推演与对比

直流故障具有影响范围广、故障电流大的特征,已成为制约直流系统发展的重要因素之一。模块化多电平换流器可通过配置双极性子模块实现直流故障穿越,但相比于基于半桥子模块的拓扑,其建造成本与运行损耗均大幅增加。为寻求兼顾硬件成本、运行效率与直流故障穿越能力的模块化多电平换流拓扑,首先通过拓扑抽象定义与模块配置约束,遍历并推导出4大类共13种模块化多电平换流拓扑;进而优选出T型桥臂交替多电平换流器,并提出桥臂移相导通调制,实现其高效功率变换与直流故障穿越的兼顾;最后,计及硬件成本、运行损耗、可靠性与可实现性等维度,对各类具有直流故障穿越能力的拓扑进行了系统性对比,为具有故障穿越能力需求的交直流变换场景提供模块化多电平换流拓扑的选择依据。     

基于运动误差约束的平面定位平台拓扑优化设计

针对传统平面定位平台拓扑优化设计过程中无法预先了解输入输出位移映射矩阵的问题,基于固体各向同性材料惩罚法,采用遗传算法优化得到具有最大运动空间时的平面并联机构雅克比矩阵作为平面定位平台输入输出期望位移映射矩阵,在相同输入条件下,建立以机构实际运动与期望运动间误差最小为目标函数和以机构体积为约束函数的平面定位平台拓扑优化模型并求解。通过3D打印方式得到实验样品,实验与仿真分析表明:采用运动误差约束的平面定位平台拓扑优化设计方法,在一定偏差范围能够得到输入输出位移映射矩阵与给定期望映射矩阵相一致的平面定位平台,表明该方法对平面定位平台设计具备有效性,为其后续研究提供基础。     

一个实用的逆变主电路拓扑

对一种介于单端正激和半桥式之间的实用逆变电路进行了介绍了分析。根据电路特点和工作情况，分为单端正激工作状态、半桥工作状态和混合工作状态3种形式，并进行了具体原理和关系的讨论。针对该电路拓扑结构和工作方式的对称性，对中点C的电位在工作时的变化进行了描述，并在此基础上进行了归纳和总结。     

一种基于点集拓扑分形变幻的云计算登录认证方法

考虑到云服务登录安全性及便捷性的需求,针对单点登录认证模式,提出云计算的统一登录认证方法,并采用点集拓扑分形变幻方法生成随机密钥,提高登录认证的安全等级。首先对云计算登录认证系统结构进行分析,然后以网络公共数据库中的指纹图像为例,进行分形变幻环运算,生成伪随机序列,再将这些序列加密并通过UDP发送给服务器端进行认证,最后进行实例仿真。     

一种能量高效的无线传感器网络拓扑控制算法

通过对现有拓扑控制算法的研究,针对无线传感器网络中节点能耗分布不均匀的问题,提出了一种能量高效的拓扑控制算法(EETCA)。该算法以均衡全局能耗为目标,综合考虑了节点的剩余能量、簇的规模、数据最优传输跳数等因素,避免了部分节点能量消耗过快,从而有效地均衡网络负载。仿真结果表明:EETCA在能耗均衡方面均优于原来的算法,延长了无线传感器网络的生命周期。     

四相永磁容错电机短路故障容错策略

四相永磁容错电机采用被容错齿隔开的集中式绕组结构,本质上具有一定的容错能力和故障出现后连续运行的能力.针对H桥和星形这两种驱动拓扑结构,在发生单相绕组出线端部短路时,以容错控制后的转矩满足正常需求为目标,分别采用直接转矩补偿方法和旋转磁动势不变方法进行容错控制;对两种容错控制策略进行了推导和对比分析,并对相关结果进行了磁-路联合仿真计算,验证了理论分析的正确性.     

Allowable delay bound for consensus of linear multi-agent systems with communication delay

This paper studies the consensus of a group of linear dynamic agents with a uniform communication delay and focuses on searching an allowable delay bound. As long as the delay is less than this bound, there exist linear feedback consensus protocols driving the multi-agent system to achieve consensus. Both fixed and switching topology cases are investigated. In both cases, the consensus problem is converted to the robust stability problem of corresponding uncertain state-delayed systems. By using Lyapunov–Krasovskii functional analysis, consensus conditions which contain the feedback gain conditions and delay conditions are proposed for systems over fixed and switching topologies, respectively. Furthermore, allowable delay bounds are obtained for both systems by solving the optimal robust stabilisation problems. Numerical examples are given to illustrate the results.     

Tool path generation framework for accurate manufacture of complex 3D sheet metal parts using single point incremental forming

The prototyping of complex sheet metal parts using single point incremental forming (SPIF) requires the generation of optimal tool paths and/or tool path sequences that ensure that the formed part is within geometric design specifications. The presence of a multitude of features on complex parts leads to multiple inaccuracy inducing phenomena occurring simultaneously due to interactions between the features. This paper proposes a network analysis methodology using topological conceptual graphs to capture the effects of different phenomena on the final accuracy of a sheet metal part manufactured by SPIF. Using this framework optimized tool paths can be generated that compensate for the inaccuracy inducing behavior. Tool path generation algorithms to create partial tool paths that account for the accuracy of specific features in the part based on the proposed framework are also presented. Finally, the creation of integrated tool paths maintaining complementarity between tool paths and desired continuity behavior using non-uniform cubic B-splines is illustrated. A number of case studies demonstrating the applicability of the integrated framework are discussed, where the maximum deviations in the part are significantly reduced and the average absolute deviations for the complete part are brought down to less than 0.5 mm.     

基于Voronoi图的连续反向最近邻查询

为解决动态环境中移动点的连续反向最近邻查询问题,将连续反向最近邻查询分为单色和双色2种情况进行研究。利用移动点Voronoi图,分别给出单色连续反向最近邻查询算法、双色连续反向最近邻查询算法以及相关定理,对算法正确性和可终止性进行证明,分析算法时间复杂性。按照移动点Voronoi图的拓扑结构是否改变分为2种情况,分析每种情况下候选所在区域的变化,在变化区域内进行Voronoi图的重构,得到对应的解决方法。在多数情况下,该算法只需生成局部移动点的Voronoi图即可找到结果,减小了连续反向最近邻查询的代价。