变电站程序化操作序列智能生成技术研究应用

变电站程序化操作是智能电网调度高级应用的关键技术之一,其操作序列的智能化自动生成技术是目前亟待研究应用的课题。提出了基于多智能系统（MAS）的变电站程序化操作自动控制序列的生成策略,介绍了MAS模型、操作序列智能生成方案及实现。     

任务联盟演化过程行动策略优选的DINs建模

优化选择一定的行动策略能促使任务联盟向期望的目标效果演化。考虑部分事件/行动在不同时段下影响强度不相一致, 使用考虑影响值时变的动态影响网(DINs)对联盟演化过程行动策略优选问题进行建模, 给出因果强度逻辑下概率传播参数设计的一致性条件, 并基于因果强度逻辑进行影响值计算。结合空中进攻作战想定案例进行仿真验证, 计算结果表明, 通过部分事件/行动节点影响值变化下进行策略优选提高了对因果关系的建模能力。     

基于多主体协作技术的光纤Bragg光栅传感器网络自修复实现

针对光纤布拉格光栅(FBG)传感器监测飞机机翼盒段试验件上的静态载荷,对多主体协作技术实现结构健康监测中光纤Bragg光栅传感器网络的自修复性进行研究。当某个主体的光纤Bragg光栅传感器发生故障时,首先,传感主体依据采集到的传感器信号利用支持向量回归机算法对外部载荷位置进行预测,然后系统协作主体对两个主体的预测结果进行协作,共同对故障传感器信号进行修复,最终获得损伤位置的识别结果。研究表明:多主体协作之后的损伤位置平均识别精度比单独采用任何一个主体的平均识别精度都高,可以对失效传感器信号进行一定的补偿、修复。     

基于互信息和多智能体优化的合成孔径雷达图像配准

提出了一种基于互信息的多智能体优化方法,并将其用于合成孔径雷达(Synthetic Aperture Radar,SAR)图像的配准.采用归一化互信息作为度量准则,直接利用图像的灰度数据进行配准,没有假设图像间灰度值的线性关系,不需要对图像做分割、特征提取等预处理,并利用多智能体优化算法寻找最佳匹配参数,以得到最优的配准结果.实验表明,该算法在SAR图像配准方面有更好的普适性和更高的配准精度.     

Leader-following consensus of multiple uncertain Euler–Lagrange systems under switching network topology

In recent years, the leader-following consensus problem for multiple uncertain Euler–Lagrange systems has been studied under some restrictive assumptions on the network topology. In this paper, we further study the same problem under switching network topology. We propose a distributed adaptive control law that can solve the problem under a switching network satisfying jointly connected condition. Under this condition, our results do not require the network to be undirected and allow the network to be disconnected at any time instant. Moreover, by introducing an exosystem to generate various reference signals, our control law can handle a class of reference signals such as sinusoidal signals with arbitrary amplitudes and initial phases or ramp signals with arbitrary slopes.     

Coordination of heterogeneous nonlinear multi-agent systems with prescribed behaviours

In this paper, we consider a coordination problem for a class of heterogeneous nonlinear multi-agent systems with a prescribed input–output behaviour which was represented by another input-driven system. In contrast to most existing multi-agent coordination results with an autonomous (virtual) leader, this formulation takes possible control inputs of the leader into consideration. First, the coordination was achieved by utilising a group of distributed observers based on conventional assumptions of model matching problem. Then, a fully distributed adaptive extension was proposed without using the input of this input–output behaviour. An example was given to verify their effectiveness.     

架空电力线故障诊断系统的仿真数据生成算法

现代社会的发展对电力的依赖性越来越强,为了保障线路的稳定运行,深入进行线路故障诊断的研究显得非常重要.但是由于数据缺乏一致性、采集困难等问题,模型训练、测试数据的获取一直困扰着相关研究的开展.为此,提出了一种故障数据生成算法PFGA,利用该算法可以生成大量的设备故障数据、单元故障数据及架空电力线路故障数据.由于该算法运用了云模型及多智能体系统等机制,生成的故障数据除了包含一定的先验知识外还存在一定的随机性,故障数据也很好地体现了真实故障数据的层次关联性、多样性、动态性等特点.利用构建的贝叶斯诊断模型分别利用PFGA和其他算法生成的数据进行诊断,结果表明,PFGA生成的数据更符合现实状况,相应的诊断结果也更为可靠.此外,该算法对不同线路状况的适应性也较好,研究人员可以根据实际研究情况生成所需的架空电力线路故障数据,以满足各类故障诊断研究对数据的需求.     

工程环境下计算机支持的协同项目设计模型

本文通过描述工程环境中的协同项目设计模型，建立了三层结构协同设计系统，并分析了各层中的协同工作方式，给出了ｍｕｌｔｉ＿ａｇｅｎｔ在ｃｌｉｅｎ／ｓｅｒｖｅｒ体系结构下的定义。最后我们对绘图协同设计的实现方法进行探讨。     

Automatic Generation of Persistent Formations for Multi-agent Networks Under Range Constraints

In this paper we present a collection of graph-based methods for determining if a team of mobile robots, subjected to sensor and communication range constraints, can persistently achieve a specified formation. What we mean by this is that the formation, once achieved, will be preserved by the direct maintenance of the smallest subset of all possible pairwise inter-agent distances. In this context, formations are defined by sets of points separated by distances corresponding to desired inter-agent distances. Further, we provide graph operations to describe agent interactions that implement a given formation, as well as an algorithm that, given a persistent formation, automatically generates a sequence of such operations. Experimental results are presented that illustrate the operation of the proposed methods on real robot platforms.     

General adaptive scheme

In recent years, many different adaptive schemes have been developed. In addition to the development of specific algorithms, much work has also been done in developing a general complex algorithm for which other algorithms developed by specific approaches are special cases. This paper discusses one such algorithm and shows how it can be further generalized.