一种基于充要强度的优化规则发现方法

提出了一种基于信息系统的优化规则的提取方法,主要目的是提取信息系统中具有一定充要性的优化规则。首先,提出了充要强度并讨论了它的性质。其次,由于搜索空间的巨大和遗传算法的全局优化的特性,设计了使用遗传算法进行优化规则搜索的方法。最后,通过实验说明方法的有效性。     

控制与通信协同设计的新进展

详尽地论述、分析、对比和讨论了网络化控制系统中的控制与通信协同设计问题．通过对该问题国内外研究现状的分析,强调了控制与通信协同设计研究的必要性、重要性和紧迫性,并着重从通信序列及通信协议两个方面阐述了控制与通信协同设计研究领域存在的不足、现有解决策略及主要结果的分析和对比,从而指出该领域急需解决的科学问题、可能的求解方向和今后的发展趋势,并为将来的研究工作提出了有益的建议和参考思路．     

一种基于决策树的快速关联规则挖掘算法

本文对关联规则的挖掘问题进行了深入研究.在总结现有算法优缺点的基础上,提出了一种新的基于决策树的快速关联规则挖掘算法(RABDT),结合决策树的构造过程,给出了算法的原理和实现步骤,并通过实验对比验证了算法的有效性.     

一种基于阈值变化的增量式更新算法研究

关联规则的挖掘算法已被数据库界广泛研究,这些关联规则挖掘算法在原有的基础上不断被优化、改进,使挖掘的效率不断提高.本文讨论了度变小的情况下典型的增量算法IUA算法以及它已有的一些改进,分析了特点与不足,在此基础上,提出了改进算法QIUA算法,并且从理论和实验两个方面验证了算法的可行性与有效性.     

基于蕴涵算子族L-λ-R_0的模糊推理α-三I约束算法

提出了基于蕴涵算子族L-λ-R0的模糊推理的思想,这将有助于提高推理结果的可靠性。针对蕴涵算子族L-λ-R0给出了模糊推理的FMP模型及FMT模型的α-三I约束算法。     

多星侦察移动目标：一种基于潜在区域的求解策略

针对面向移动目标侦察的多星联合调度,提出了一种新颖的求解策略:将移动目标问题转变为区域目标问题,即在多星联合侦察的框架内利用电子侦察引导信息构建移动目标的潜在区域,基于约束满足问题(CSP)描述方法以最大覆盖率为目标建立了面向潜在区域目标的多星联合调度模型,并提出了相应的禁忌搜索算法。通过基于潜在区域的求解策略,可以优化星载遥感器的侦察方案,指导移动目标侦察任务的执行。     

The capacitated multi-AGV scheduling problem with conflicting products: Model and a decentralized multi-agent approach

Automated guided vehicles (AGVs) are a key technology to facilitate flexible production systems in the context of Industry 4.0. This paper investigates an optimization model and a solution using a decentralized multi-agent approach for a new capacitated multi-AGV scheduling problem with conflicting products (CMASPCP) to take full advantage of AGVs. The novelty of the problem and our model lies in the introduction of AGV capacity constraints and constraints arising from conflicting products, i.e. products that cannot be transported together. As the new I4.0 paradigm tends towards decentralized control, we also present a decentralized multi-agent approach in which AGVs autonomously coordinate to solve the task. The performance of the proposed decentralized approach is compared to a mixed-integer linear programming model on a set of 110 problem instances with different sizes and degrees of complexity. The obtained results show that the proposed decentralized multi-agent approach is effective and competitive in terms of the solution quality and computational time.     

永磁同步电机模型预测转矩控制简化控制策略

传统永磁同步电机(PMSM)模型预测转矩控制(MPTC)遍历逆变器生成的全部7个电压矢量, 计算负担较大.当转矩误差较小时, 零电压矢量利用率较高, 则可当转矩误差位于阈值范围, 电机系统直接输出零电压矢量, 否则,依然遍历7个电压矢量, 并给出阈值确定方法. 基于上述策略, 本文增加了6个定子磁链扇区位置约束, 将转矩误差大于阈值时的备选电压矢量降至4个, 并增加磁链扇区数目至12个和磁链误差约束, 进一步减小备选电压矢量. 仿真结果表明, 提出的3种简化策略控制下, 永磁同步电机系统运行正常, 控制性能与传统模型预测转矩控制基本相当,平均开关频率分别降低至77.48%, 77.09%和76.12%, 平均遍历电压矢量个数分别降低至58.29%, 32.86%和29.14%.实时性实验结果表明运行时间分别减小至57.70%, 32.96%和29.48%.     

Parallel Cloth Simulation Using OpenGL Shading Language

The primary goal of cloth simulation is to express object behavior in a realistic manner and achieve real-time performance by following the fundamental concept of physic. In general, the mass–spring system is applied to real-time cloth simulation with three types of springs. However, hard spring cloth simulation using the mass–spring system requires a small integration time-step in order to use a large stiffness coefficient. Furthermore, to obtain stable behavior, constraint enforcement is used instead of maintenance of the force of each spring. Constraint force computation involves a large sparse linear solving operation. Due to the large computation, we implement a cloth simulation using adaptive constraint activation and deactivation techniques that involve the mass–spring system and constraint enforcement method to prevent excessive elongation of cloth. At the same time, when the length of the spring is stretched or compressed over a defined threshold, adaptive constraint activation and deactivation method deactivates the spring and generate the implicit constraint. Traditional method that uses a serial process of the Central Processing Unit (CPU) to solve the system in every frame cannot handle the complex structure of clothmodel in real-time. Our simulation utilizes the Graphic Processing Unit (GPU) parallel processing with compute shader in OpenGL Shading Language (GLSL) to solve the system effectively. In this paper, we design and implement parallel method for cloth simulation, and experiment on the performance and behavior comparison of the mass–spring system, constraint enforcement, and adaptive constraint activation and deactivation techniques the using GPU-based parallel method.     

关键词最优路径查询的分段拓展算法

关键词最优路径查询（KOR）查找在满足关键词全覆盖和路径长度约束条件下,时间开销最小的路线常用于旅行规划。现有优化算法虽然采用各种剪枝策略缩小搜索规模,但是本质上是广度优先搜索,在查找长路径时,搜索规模依然过大,执行时间长。针对该问题,提出一种关键词最优路径查询的分段拓展算法（SE-KOR）。SE-KOR算法根据关键词倒排索引表构建关键词顶点路径,将路径划分为多段分别拓展,降低搜索规模,从而缩短执行时间。该算法在路径拓展时给出路径走向,而现有剪枝策略不控制路径拓展方向,因此提出局部代价阈值剪枝,控制路径的走向沿关键词顶点路径拓展,并综合运用近似支配、可行解目标值剪枝和全局优先拓展策略加速拓展。实验结果表明,在不损失精度的情况下,该算法执行时间分别在不同关键词个数、代价阈值与查询图规模下至少缩短8.0%、61.0%和57.7%。