计及灵活性储备的含风电多微电网系统分布式协调调控策略

高比例风电的接入和需求响应技术的应用对分布式架构下的多微电网系统有功功率动态平衡提出了更高的要求,有必要充分利用灵活性资源对系统进行协调调控.提出一种新颖的灵活性电池储备模型对多微电网系统灵活性备用容量进行评估,定义虚拟灵活性电池储备模型对风电场备用与需求响应负荷备用进行评估,充分挖掘其调频的潜在能力.在此基础上,基于一致性算法求解该模型下各微电网的功率分配,提出计及灵活性储备的含风电多微电网系统分布式协调调控策略,实现分布式架构下灵活性资源的协调优化.通过华东某地区实际数据验证了所提策略的有效性.算例结果表明,协调优化源-荷灵活性储备资源在保障风电消纳的同时,实现了分布式架构下系统的动态功率平衡.     

线性多智能体系统一致性问题的部分稳定性方法（英文）

A linear transformation is proposed to deal with the consensus problem of high-order linear multi-agent systems(LMASs).In virtue of the linear transformation, the consensus problem is equivalently translated into a partial stability problem. We discuss three issues of the LMASs under a generalized linear protocol: 1) to find criteria of consensus convergence; 2) to calculate consensus function; 3) to design gain matrices in the linear consensus protocol. Precisely, we provide a necessary and sufficient criterion of consensus convergence in terms of Hurwitz stability of a matrix and give an analytical expression of the consensus function. In addition, we set up a relation between the gain matrices in the protocol and the convergence time and consensus accuracy of the agents, and then design the gain matrices with respect to a pre-specified convergence time and a required consensus accuracy.     

Protein design to understand peptide ligand recognition by tetratricopeptide repeat proteins

Protein design aims to understand the fundamentals of protein structure by creating novel proteins with pre-specified folds. An equally important goal is to understand protein function by creating novel proteins with pre-specified activities. Here we describe the design and characterization of a tetratricopeptide (TPR) protein, which binds to the C-terminal peptide of the eukaryotic chaperone Hsp90. The design emphasizes the importance of both direct, short-range protein-peptide interactions and of long-range electrostatic optimization. We demonstrate that the designed protein binds specifically to the desired peptide and discriminates between it and the similar C-terminal peptide of Hsp70.     

基于一致性的小型四旋翼机群自主编队分布式运动规划

设计一种小型四旋翼无人机群起飞后自主形成正多边形编队的分布式运动规划方法.在四旋翼无人机的串级控制系统框架下,分布式编队控制器以简化agent模型为基础,同时采用平均一致性算法和有领导一致性算法,共同产生各无人机位置与偏航角的期望轨迹.讨论了达成最终协调目标队形的拓扑条件,并给出一种基于有向Hamilton环的通信拓扑设计方案.最后通过数值仿真验证了所提出算法的有效性.     

Finite-time consensus of multiple second-order dynamic agents without velocity measurements

This article considers the finite-time consensus of multiple second-order dynamic agents without velocity measurements. A feasible protocol under which each agent can only obtain the measurements of its position relative to its neighbours is proposed. By applying the graph theory, Lyapunov theory and the homogeneous domination method, some sufficient conditions for finite-time consensus of second-order multi-agent systems are established under the different kinds of communication topologies. Some examples are presented to illustrate the effectiveness of the theoretical results.     

Robust consensus algorithm for multi-agent systems with exogenous disturbances under convergence conditions

In this paper, a robust consensus algorithm is developed and sufficient conditions for convergence to consensus are proposed for a multi-agent system (MAS) with exogenous disturbances subject to partial information. By utilizing H_∞ robust control, differential game theory and a design-based approach, the consensus problem of the MAS with exogenous bounded interference is resolved and the disturbances are restrained, simultaneously. Attention is focused on designing an H_∞ robust controller (the robust consensus algorithm) based on minimisation of our proposed rational and individual cost functions according to goals of the MAS. Furthermore, sufficient conditions for convergence of the robust consensus algorithm are given. An example is employed to demonstrate that our results are effective and more capable to restrain exogenous disturbances than the existing literature.     

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.     

An approach for selecting seed URLs of focused crawler based on user-interest ontology

Seed URLs selection for focused Web crawler intends to guide related and valuable information that meets a user's personal information requirement and provide more effective information retrieval. In this paper, we propose a seed URLs selection approach based on user-interest ontology. In order to enrich semantic query, we first intend to apply Formal Concept Analysis to construct user-interest concept lattice with user log profile. By using concept lattice merger, we construct the user-interest ontology which can describe the implicit concepts and relationships between them more appropriately for semantic representation and query match. On the other hand, we make full use of the user-interest ontology for extracting the user interest topic area and expanding user queries to receive the most related pages as seed URLs, which is an entrance of the focused crawler. In particular, we focus on how to refine the user topic area using the bipartite directed graph. The experiment proves that the user-interest ontology can be achieved effectively by merging concept lattices and that our proposed approach can select high quality seed URLs collection and improve the average precision of focused Web crawler.     

基于移动无线传感器节点的栅栏覆盖研究

栅栏覆盖可用于入侵检测。研究具有有限移动能力的无线传感器节点在狭长区域中的栅栏覆盖问题。首先将狭长区域划分成网格,然后将移动节点和基准栅栏上的网格中心点构成二部图。基于二部图理论对1-栅栏覆盖问题进行数学描述,提出基于拍卖算法的1-栅栏覆盖算法(A1-BCA),并与基于匈牙利算法的栅栏覆盖算法进行性能比较。仿真结果表明A1-BCA算法在传感器节点较多时,优化性能好于匈牙利算法。     

两种基于个体偏好集结的多属性群决策共识方法

针对多属性群决策中的共识问题, 提出两种使群体达成共识的方法. 假设群体决策的结果以从个体偏好通过集结得到的群体偏好为基础, 在使用算术加权集结算子和几何加权集结算子的条件下, 分别设计相应的共识达成算法, 并对算法的收敛性进行分析. 与已有方法相比, 所提出算法能够体现决策个体的差异和决策个体对群体的影响. 通过某市政图书馆空调系统安装方案的选择表明了所提出方法的合理性和可行性.