不确定离散模糊随机系统的鲁棒方差约束输出反馈控制

对一类具有范数有界不确定性的离散T-S模糊随机系统。研究不仅使整个闭环模糊系统全局渐近稳定。而且每个模糊子系统的稳态状态方差满足给定上界性能指标约束的输出反馈鲁棒方差控制律的设计问题。利用线性矩阵不等式(LMI)技术，导出输出反馈鲁棒方差控制律的存在条件，并基于矩阵相似变换给出其可解性条件，同时用一组线性矩阵不等式的可行解。给出输出反馈鲁棒方差控制律的一个参数化表达形式。     

模糊推理的三I逄法的RL型支持度分析

在文献[1]提出的三I算法的支持度理论的基础上,全面展开了基于Lukasiewicz蕴函算子RL的三I算法的理论,给出了模糊MP算法与模糊MT算法的计算公式,并考虑了三I算法制还原性问题;进一步研究了三I算法的支持度理论,分析了支持度的性质,得到了一般化的α-三IFMP公式与α-三IFMT公式。     

Approximation-error-ADP-based optimal tracking control for chaotic systems with convergence proof

In this paper, an optimal tracking control scheme is proposed for a class of discrete-time chaotic systems using the approximation-error-based adaptive dynamic programming （ADP） algorithm. Via the system transformation, the optimal tracking problem is transformed into an optimal regulation problem, and then the novel optimal tracking control method is proposed. It is shown that for the iterative ADP algorithm with finite approximation error, the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some convergence conditions. Two examples are given to demonstrate the validity of the proposed optimal tracking control scheme for chaotic systems.     

Way of Breaking Links in the Evolution of Cooperation

We investigate how the way of breaking links and establishing links impacts cooperation by comparing four coevolutionary rules. In the rules, a player chooses to break an existing link according to his environment, and the establishment of a new link depends on the environment of the potential neighbor. It is found that the way of breaking links plays a key role in promoting cooperation. The way of establishing links has a negligible effect on cooperation, but determines the population structure. Our results may provide some insights into understanding the evolution of cooperation.