基于遗传算法的混合降阶H2/H∞控制器

讨论了混合降阶H2/H∞控制器的设计问题,提出了应用遗传算法设计混合降阶H2/H∞控制器的一种方法.通过遗传算法对次优H∞降阶控制器进行H2性能优化,设计出鲁棒性既强又满足系统性能要求的混合降阶H2/H∞控制器.它分别在H∞降阶和H2性能优化中两次应用遗传算法,遗传算法采用实数编码形式,其算子分别选用排序选择和最佳个体保存相结合的选择算子、实值中间重组的交叉算子及实值变异的变异算子.利用国产某型飞机对该方法进行仿真,其结果表明得到的混合降阶H2/H∞控制器具有良好的H∞性能和H2性能.     

基于遗传算法的混合H 2 öH ∞状态反馈控制器

提出了应用遗传算法设计混合H2/H∞状态反馈控制器的一种方法.通过遗传算法对H∞控制器进行H2性能优化,从而设计出鲁棒性强并满足系统性能要求的混合H2/H∞状态反馈控制器.该方法采用实数编码、排序选择与最佳个体保存相结合的选择算子、实值中间重组的交叉算子和实值变异的变异算子,并在适应度函数中添加惩罚约束.对国产某型飞机进行仿真,结果表明得到的混合H2/H∞状态反馈控制器具有良好的H∞性能和H2性能.     

一类非线性系统的模糊可靠H_2/H_∞混合控制器设计的LMI方法

基于T-S模糊模型,利用线性矩阵不等式(LMI)方法,研究一类非线性系统的模糊可靠H2/H∞混合控制器设计问题.首先,分别以LMI形式给出了系统模糊可靠H2及H∞控制器存在的充分条件和控制器设计方法;然后.给出系统混合H2/H∞性能的可靠控制器设计方法,所设计的控制器使得故障闭环系统二次稳定,同时满足H∞性能,且优化系统的H2性能指标,最后,通过数值例子验证了结论的正确性和控制器设计方法的有效性.     

具有时延的参数不确定主动悬架广义H2/H∞控制

提出了一种新的综合考虑系统的输入时延和参数不确定性的广义H2/H∞混合控制器设计方法,并将其用于车辆主动悬架设计.假定作动器时延是一个已知其边界但不确定的恒定的量,且系统的小确定参数是范数有界的.针对悬架设计需求,分别用H∞和广义H2性能评价指标反映车身加速度和机械结构设计约束.通过定义一个李亚普诺夫函数来同时满足闭环系统的两个性能指标,将广义H2/H∞混合控制器设计转化为线性矩阵不等式的求解.用两自由度1/4车悬架模型进行仿真,结果表明:不论是否存在有界时延和车身参数变异,控制器始终能给出很好的控制效果.     

混合H2/H∞鲁棒控制器设计

在状态空间描述下,定义了混合H2/H∞控制的完整信息、完整控制、干扰顺馈、输出估计这4种典型情况.在二次稳定意义上,讨论了混合H2/H∞的性能指标,及这4种典型情况的混合H2/H∞线性反馈控制器设计,给出了充分必要条件.在典型情况分析的基础上,研究一般意义上的混合H2/H∞反馈控制器设计.H2和H∞的干扰输入阵及性能评价函数各不相同时的混合H2/H∞反馈控制器,与H2和H∞控制器设计相似,归结为解两个Riccati方程.但这两个Riccati方程含有参数,最优解要通过搜索这两个参数得到.结果包含了单纯的H2和H∞设计,可看作是H2,H∞和混合H2/H∞的统一设计方法.最后通过一个简单的例子,说明了控制器设计方法的可行性.     

H2/H∞混合优化问题综述

H2/H∞混合优化设计方法由于其可以 使系统同时获得较好的鲁棒稳定性和鲁棒性能，一经提出，立即受到研究者的广泛关注．本 文综述了H2/H∞混合优化方法的产生、发展及其特点，概要介绍了H2/H∞优化理论研究的最新进展及实践应用的主要结果，分析了H2/H∞混合优化理论在理 论和实际应用中的发展方向．     

T-S模糊系统H2/H∞混合控制器设计的LMI方法

应用线性矩阵不等式（LMI）方法研究T-S模糊系统的H2／H∞混合控制器的设计问题．首先针对T-S模糊系统分别设计H2和H∞控制器;然后以线性矩阵不等式的形式给出T-S模糊系统H2／H∞混合控制器存在的充分条件及相应的控制器设计方法．在给定的H∞干扰约束下,通过优化H2控制性能指标实现了模糊状态反馈次优控制．最后通过例子验证了所给出的H2／H∞混合控制器设计方法的可行性和有效性．     

基于自适应遗传算法的奇异离散系统降阶H∞控制器

考虑一类奇异离散系统,应用自适应遗传算法给出其降阶H∞控制器的设计方法。通过对目标函数的全局搜索,得到控制器的最小阶次及相应的正定矩阵参数,进而设计出降阶H∞控制器。仿真表明,所提出方法不论对非奇异系统,还是奇异系统都可以得到降阶H∞控制器,且控制器易于求解。     

基于粒子群优化算法的永磁同步电机H2/H∞混合控制

为了提高永磁同步电机(PMSM)控制系统的控制性能,设计了一种混合H2/H∞控制器。通过混合灵敏度方法设计系统的H∞次优控制器,采用粒子群优化(PSO)算法选取H2性能指标最小的控制器,从而得到混合H2/H∞控制器。采用仿真对所设计控制器的性能与比例积分(PI)控制器进行了对比测试,测试结果证明了混合H2/H∞控制器具有比PI控制器更好的控制效果,同时也表明采用PSO算法进行控制器设计是有效、可行的。     

基于 LMI 的广义系统混合H2/ H∞优化控制

研究了广义线性系统的混合H2／H∞状态反馈优化控制问题。设计一个混合H2／H∞状态反馈控制器，在满足闭环系统的容许性及H∞范数界的同时使得H2范数极小。利用线性矩阵不等式(LMI)方法得到该控制器存在的一个充分条件，并且给出闭环系统H2范数的极小上界。     

M/G/c/K blocking probability models and system performance

An exact solution for the M/G/c/K model is only possible for special cases, such as exponential service, a single server, or no waiting room at all. Instead of basing the approximation on an infinite capacity queue as is often the case, an approximation based on a closed-form expression derivable from the finite capacity exponential queue is presented. Properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed. Extensive experiments are provided to test and verify the efficacy of our approximate results.     

设计模式变体的描述与验证*

为解决标准设计模式演化后难以检测的问题,引入设计模式变体思想,以Bridge模式为例,给出了八种常用的变体实现,并以人工形式挖掘了四种开源系统中Bridge模式变体的基准数,接着在Apache Ant1.6.2与JHotDraw5.1开源系统中通过六种主流设计模式检测工具进行了变体检测实验。试验结果表明,FCA-CBR方法简单有效,对2种开源系统中Bridge模式变体检测的精确率达到60%与48.1%,与先前方法相比有了较大的提高。     

(r∞, n12, s12) measurements on the 2-CPU CRAY X-MP

We report performance measurements made on the 2-CPU CRAY X-MP at ECMWF, Reading. Vector (SIMD) performance on one CPU is interpreted by the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), and we find for dyadic operations using FORTRAN $\text{r}{}_{\mathrm{\infty }}\text{= 70}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 53}\text{flop}$. All vector triadic operations produce $\text{r}{}_{\mathrm{\infty }}\text{= 107}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 45}\text{flop}$; and a triadic operation with two vectors and one scalar gives r_∞ = 148 Mflop/s and $\text{n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 60}\text{flop}$. MIMD performance using both CPUs on one job is interpreted with the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), where $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is the amount of arithmetic that could have been done during the time taken to synchronize the two CPUs. We find, for dyadic operations using the TSKSTART and TSKWAIT synchronization primitives, that r_∞ = 130 Mflop/s and $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 5700}\text{flop}$. This means that a job must contain more than ～ 6000 floating-point operations if it is to run at more than 50% of the maximum performance when split between both CPUs by this method. Less expensive synchronization methods using LOCKS and EVENTS reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 4000 flop and 2000 flop respectively. A simplified form of LOCK synchronization written in CAL code further reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 220 flop. This is probably the minimum possible value for synchronization overhead on the CRAY X-MP.     

Complex random sample scheduling and its application to an N/M/F/Fmax problem

“Complex Random Sample Scheduling(CRSS)” was proposed in this paper as an efficient heuristic method for solving any permutation scheduling problems. To show the effectiveness of the proposed CRSS, it was applied to an N-job, M-machine, permutation flowshop scheduling problem to minimize makespan, N/M/F/F_max. Numerical experiments made it clear that the proposed CRSS provides a schedule very close to the near-optimal schedule obtained by the existing promising heuristic methods such as taboo search and simulated annealing, within less computation time than these heuristic methods.     

Geom/G/1/n system with LIFO discipline without interrupts and constrained total amount of customers

Consideration was given to the discrete-time queuing system with inversive servicing without interrupts, second-order geometrical arrivals, arbitrary (discrete) distribution of the customer length, and finite buffer. Each arriving customer has length and random volume. The total volume of the customers sojourning in the system is bounded by some value. Formulas of the stationary state probabilities and stationary distribution of the time of customer sojourn in the system were established.     

Efficient implementation of Johnson''s rule for the n/2/F/Fmax scheduling problem

Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.     

On the M/Ck/1 queue

We obtain the exact analytic expression of the probability distribution of the number of units in a single server queue with Poisson arrivals and Coxian service time distribution (notated as M/C_k/1). A recursive procedure for calculating this probability distribution is given. The well-known queues M/E_k/1 and M/D/1 are re-derived as special cases of the M/C_k/1 queue. Finally, the cases of M/C₂/1 and M/C₃/1 are fully worked out.