基于遗传禁忌搜索算法的PMU布点配置

将遗传算法GA（Genetic Algorithm）和禁忌搜索算法TS（Tabu search）相结合,提出一种遗传禁忌搜索算法GATS ( Genetic Algorithm & Tabu search)用于相量测量单元优化配置。GATS算法结合了遗传算法的随机搜索能力、并行性和禁忌搜索算法的记忆功能,有效地解决了遗传算法的爬山能力差、早熟的问题,提高了收敛速度及优化质量;同时遗传算法的种群操作,保留了遗传算法的多出发点的优势,弥补了禁忌搜索的单一单操作缺乏并行性的弱点。在约束条件处理时,采用了不可行解启发性修复方法,提高了算法的优化效果。基于图论的深度优先方法用于系统可观性分析。将GATS算法应用于优化相量测量装置安装地点选择,实现了安装地点最少,而整个系统可观的目标。通过算例证明了算法的有效可靠。     

多变量自适应极点配置系统稳定的充要条件

对于多变量自适应极点配置系统给出了其稳定的充要条件，并在充分性的证明过程中构造性地提出了一种估计参数的修正策略，保证了修正参数所对应的广义Sylvester矩阵渐近一致非奇异，得到了无须能控性的稳定多变量自适应极点配置系统，解决了多变量自适应极点配置的奇异问题，所需的先验知识仅为能观性指数和不确定或干扰的上界。     

结构可观的换热网络温度测点分析及控制系统设计

复杂换热网络中间温度状态变量众多且变量间耦合严重,若不加以控制与观测,往往不利于物流间的热量传递与安全监测。换热网络的温度测点设置是实施控制的基础,为保证全部状态的可观性,凭经验设置的温度测点往往过多,经济性差,也缺乏理论论证与分析。因此从控制理论的角度,基于结构可观性理论分析换热网络的结构特性。分析旁路设置对换热网络结构可观性的影响,权衡可观性与经济性两方面因素,为实现设置最少的温度测点以满足全部状态的可观性要求,提出了换热网络全部状态可观的温度测点优化设计法。然后,基于相对增益分析,将已有旁路与优化得出的温度测点进行配对,构成换热网络的常规控制系统。最后,以某常减压蒸馏装置脱盐前换热网络为例验证了方法的可行性。     

基于拓扑分割的网络可观测性分析方法

针对电力网络可观测性分析问题,对量测网络建模、网络拓扑可观测性分析理论、不可观测节点的影响范围等方面进行了研究,提出了一种基于拓扑分割的网络可观测性分析方法,在某42节点系统上对该方法进行了测试。该方法将带量测的电力网络建模为量测拓扑单线图,并在无注入量测节点处进行了拓扑分割,将网络分割成了多个连通子网。利用广度优先双向搜索算法对含线路潮流量测的各个子网进行了可观测性分析,在不可观测子网中分析了不可观测节点的影响范围,得到了所有可观测拓扑岛。再结合其结果对仅含注入型量测的子网进行分析,得到了剩余的可观测岛。最后将共有相同无注入量测节点的可观测岛进行了合并。算法在判断可观测性的同时,得到了全网所有的可观测拓扑岛。研究结果表明,该方法正确有效,保持了拓扑算法的快速性特点。     

Anticipating Degradation in State Estimation Accuracy via Online Nonlinear Observability Analysis

A methodology is proposed to enable real-time evaluation of the observability of local motions, and generate a local observability cost map to enable informed local motion planning in order to avoid potential degradation or degeneracy in state estimator performance. The proposed approach leverages efficient numerical techniques in nonlinear observability analysis and motion primitive-based planning technique to realize the local observability prediction with real-time performance. The degradation of the state estimation performance can be readily predicted with the local observability evaluation result. The proposed approach is specialized to a representative optimization-based monocular visual-inertial state estimation formulation and evaluated through simulation and experiments. The experimental results demonstrated the ability of the proposed methodology to correctly anticipate the potential state estimation degradation.     

主从式USV协同定位系统性能分析

为研究以距离为观测量的主从式无人水面航行器(unmanned surface vehicle,USV)协同定位系统在不同运动状态下的定位性能问题,建立一种新的协同坐标系,并在该坐标系中推导主从USV运动模型,以主从USV相对距离为观测量分析主从式USV协同定位系统的可观测性及可观测度.同时,针对不可观测路径,提出通过改变控制输入的方法以达到提高系统可观测度的目的.通过MATLAB仿真实验与水面舰艇实验,结果表明:在不同情况下,通过调整控制输入的方法改变系统的可观测度是有效的;利用所提出的分析方法可以反映协同定位系统的定位性能,验证了所得结论及方法的有效性.     

基于弱可观状态分离估计的机载灵巧弹药快速传递对准方法

为了解决机载灵巧弹药微机电系统(MEMS)惯性导航传递对准时间过长、严重制约载机安全的问题,提出了MEMS陀螺零偏两点估计算法和弱可观测状态分离估计的快速传递对准算法。该方法基于对Kain等^［1］提出的速度+姿态匹配快速传递算法的可观测度分析,解决了陀螺零偏弱可观测状态的分离估计。采用系统噪声变分贝叶斯-卡尔曼滤波自适应算法处理快速传递对准算法中分离估计器参数对滤波器收敛的影响。仿真和靶场试验结果表明,在2.5 s内两点估计法估计准确度至少达到88%,对应的传递对准时间缩短到8 s.     

State and input observability recovering by additional sensor implementation: A graph-theoretic approach

This paper deals with the problem of additional sensor location in order to recover the state and input observability for structured linear systems. The proposed method is based on a graph-theoretic approach and assumes only the knowledge of the system’s structure. It allows one to provide the minimal number of the required sensors and either their pertinent location or a necessary and sufficient condition which allows one to check if a sensor location is adequate or not. We obtain a sensor placement procedure based on classical and well-known graph theory algorithms, which have polynomial complexity orders.     

ON THE PROBLEM OF REPRESENTATION IN LOCKEAN AND DIALECTICAL BELIEF SYSTEMS: A SYSTEMS APPROACH TO POLICY ANALYSIS

This paper explores the problems that are associated with building a model (representation) of two systems which are central to the field of policy analysis. The systems are the Lockean and Dialectical Inquiring Systems (ISs). Given two or more belief systems, a Lockean IS will attempt to secure maximum agreement between them, whereas a Dialectical IS will attempt to secure maximum disagreement as the basis for forming a policy.     

Test and realization of 2-separable switching functions†

In this paper a method of test and realization of non-linearly separable switching functions that are 2-rcalizable, i.e. realizable by a network of 2-threshold logic elements is presented. The positive linear dependences among the rows of the coefficient matrix of the set of inequalities representing the function are first determined and systematically removed using a distribution table. All possible solutions are readily obtained. A weight matrix representation of a network of threshold logic elements is used. An example is worked out.