State estimation in power systems using linear model infinity norm-based trust region approach

State estimation is one of the most important functions in an energy control centre. An computationally efficient state estimator which is free from numerical instability/ill-conditioning is essential for security assessment of electric power grid. Whereas approaches to successfully overcome the numerical ill-conditioning issues have been proposed, an efficient algorithm for addressing the convergence issues in the presence of topological errors is yet to be evolved. Trust region (TR) methods have been successfully employed to overcome the divergence problem to certain extent. In this study, case studies are presented where the conventional algorithms including the existing TR methods would fail to converge. A linearised model-based TR method for successfully overcoming the convergence issues is proposed. On the computational front, unlike the existing TR methods for state estimation which employ quadratic models, the proposed linear model-based estimator is computationally efficient because the model minimiser can be computed in a single step. The model minimiser at each step is computed by minimising the linearised model in the presence of TR and measurement mismatch constraints. The infinity norm is used to define the geometry of the TR. Measurement mismatch constraints are employed to improve the accuracy. The proposed algorithm is compared with the quadratic model-based TR algorithm with case studies on the IEEE 30-bus system, 205-bus and 514-bus equivalent systems of part of Indian grid.

Support vector clustering-based direct coherency identification of generators in a multi-machine power system

This study investigates the application of support vector clustering (SVC) for the direct identification of coherent synchronous generators in large interconnected multi-machine power systems. The clustering is based on coherency measure, which indicates the degree of coherency between any pair of generators. The proposed SVC algorithm processes the coherency measure matrix that is formulated using the generator rotor measurements to cluster the coherent generators. The proposed approach is demonstrated on IEEE 10 generator 39-bus system and an equivalent 35 generators, 246-bus system of practical Indian southern grid. The effect of number of data samples and fault locations are also examined for determining the accuracy of the proposed approach. An extended comparison with other clustering techniques is also included, to show the effectiveness of the proposed approach in grouping the data into coherent groups of generators. This effectiveness of the coherent clusters obtained with the proposed approach is compared in terms of a set of clustering validity indicators and in terms of statistical assessment that is based on the coherency degree of a generator pair.

A novel index for identification of weak nodes for reactive compensation to improve voltage stability

In this study, a new reactive power loss index (RPLI) is proposed for identification of weak buses in the system. This index is further used for determining the optimal locations for placement of reactive compensation devices in the power system for additional voltage support. The new index is computed from the reactive power support and loss allocation algorithm using Y-bus method for the system under intact condition and as well as critical/severe network contingencies cases. Fuzzy logic approach is used to select the important and critical/severe line contingencies from the contingency list. The inherent characteristics of the reactive power in system operation is properly addressed while determining the reactive power loss allocation to load buses. The proposed index is tested on sample 10-bus equivalent system and 72-bus practical equivalent system of Indian southern region power grid. The validation of the weak buses identification from the proposed index with that from other existing methods in the literature is carried out to demonstrate the effectiveness of the proposed index. Simulation results show that the identification of weak buses in the system from the new RPLI is completely non-iterative, thus requires minimal computational efforts as compared with other existing methods in the literature.

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

工业无线网络化控制系统结构及调度问题研究

无线通信技术在工业网络化控制系统中的应用已成为当今工业领域中的研究热点。然而无线通信技术在恶劣的工业环境中通信质量严重下降，使得现有无线通信技术在工业网络化控制系统中的应用受阻。为此在不断提高和改进无线信号传输性能的同时，更要在控制系统级层面上充分考虑无线通信技术的特点，进行相关系统结构和实时调度机制等方面的改进，以达到使系统产生的通信任务在应用层上得到可靠、实时调度的目的。同时也要从无线网络技术层面上入手，解决上层下达的通信任务在数据链路层中的实时调度问题。要设计适合工业无线网络化控制系统应用特点的MAC协议来有效调度网络所有节点的信息收发，减少高层下达的通信任务在网络中的平均时延，提高吞吐量，进而保证工业无线网络化控制系统的实时性。 因此，本文从工业无线网络化控制系统中的通信任务在数据链路层和应用层上的调度角度出发，以解决、改善工业无线网络化控制系统的实时性和可靠性等性能指标为目的。对工业无线网络化控制系统的结构、应用层调度策略和优化以及数据链路层中的MAC协议进行了系统的研究。主要工作和贡献有以下几点： （1）对工业网络化控制系统的基本问题和引入无线通信技术后产生的问题进行了探讨。在定性分析了工业环境对无线通信的影响及要求的同时，又推导出了无线通信的链路预算模型，并利用Matlab对该预算模型进行了建模，计算出了在工业级噪声指数和工业要求的误码率下，IEEE802.11b和IEEE802.15.4两大主流无线通信技术的链路预算情况及具体的量化数据。 （2）提出了工业无线网络化控制系统的双频二级拓扑结构和多路径传输机制。利用了无线信道特点和路径冗余优势，在系统级上改进了目前无线通信技术在工业网络化控制系统中的应用模式，部分缓解了无线通信技术在工业恶劣环境中的实时性和可靠性问题。为工业无线网络化控制系统结构的设计做了有益的尝试。同时，首次将DS-UWB技术应用于工业网络化控制系统中，设计出了基于该结构的UWB和FF及PROFIBUS的集成方案，为该结构的快速应用提供了有效的途径。 （3）提出了极大容忍无线通信时延的调度算法(GTD)。有效解决了工业无线网络化控制系统中周期性通信任务的实时性问题,部分弥补了因无线网络时延而导致周期性通信任务超时的缺陷。并针对GTD调度算法产生的通信窗口碎片问题进行了优化处理，又提出了面向非周期信息吞吐量最大化的优化调度算法，该算法提高了非周期性通信任务的吞吐量。同时，给出了基于这两种调度算法的非线性规划模型的调度时间表求解方法。 （4）提出了根据通信任务调度时间表进行分配无竞争期的混合CAP和CFP的MAC协议（HAF-MAC）。解决了工业无线网络化控制系统上层下达的周期性通信任务和非周期性通信任务在数据链路层中的实时调度问题，并有效解决了本文提出的应用层调度算法生成的预留时间可能存在浪费的问题。同时，在理论分析了HAF-MAC协议时隙利用率的基础上，提出了基于时隙的HAF-MAC（TSHAF-MAC）协议。TSHAF-MAC协议比HAF-MAC协议提高了时隙利用率，使吞吐量和平均延时得到了进一步改善，进而提高了非周期性通信任务的实时性。最后，对这两个协议进行了仿真建模与验证，进而较系统地解决了工业无线网络化控制系统中的通信任务的实时调度问题。 （5）分别将论文中的第三章和第四章的部分研究成果,在本人博士研究阶段研发的无线智能照明控制系统这一物理实验平台上进行了一定的验证。

Combining Associational and Causal Reasoning to Solve Interpretation and Planning Problems

This report describes a paradigm for combining associational and causal reasoning to achieve efficient and robust problem-solving behavior. The Generate, Test and Debug (GTD) paradigm generates initial hypotheses using associational (heuristic) rules. The tester verifies hypotheses, supplying the debugger with causal explanations for bugs found if the test fails. The debugger uses domain-independent causal reasoning techniques to repair hypotheses, analyzing domain models and the causal explanations produced by the tester to determine how to replace faulty assumptions made by the generator. We analyze the strengths and weaknesses of associational and causal reasoning techniques, and present a theory of debugging plans and interpretations. The GTD paradigm has been implemented and tested in the domains of geologic interpretation, the blocks world, and Tower of Hanoi problems.

Ecological Investigations with the Continuous Plankton Recorder: The Zooplankton (other than Copepoda and Young Fish) in the Southern North Sea, 1932-37.

I. The report describes the main monthly changes in the distribution and abundance of the zooplankton, other than Copepoda and young fish (dealt with in separate reports), over the southern part of the North Sea from 1932 to 1937. The work is part of the survey carried out by Continuous Plankton Recorders towed at a depth of 10 metres on regular steamship lines between England and the Continent. 2. The limitations to the sampling method are discussed, and it is shown to be unsuitable for recording Mysidacea and Euphausiacea on account of their marked diurnal variation due presumably to vertical migration; they are omitted from the report. 3. The changing distribution of Sagitta, Limacina, Clione, Lamellibranch larvae, Cladocera, Caprellid Amphipoda, Decapod larvae, Echinoderm larvae and Oikopleura are shown in a series of monthly charts while their seasonal fluctuations are compared in time-chart histograms. 4. The Alima larvae of Squilla are recorded on a few occasions in the regions where the Channel opens into the North Sea. 5. The distributional characteristics of the different forms, i.e. their tendencies to even or " patchy " production, are compared.

Feasibility of online collaborative voltage stability control of power systems

This paper presents the results of feasibility study of a novel concept of power system on-line collaborative voltage stability control. The proposal of the on-line collaboration between power system controllers is to enhance their overall performance and efficiency to cope with the increasing operational uncertainty of modern power systems. In the paper, the framework of proposed on-line collaborative voltage stability control is firstly presented, which is based on the deployment of multi-agent systems and real-time communication for on-line collaborative control. Then two of the most important issues in implementing the proposed on-line collaborative voltage stability control are addressed: (1) Error-tolerant communication protocol for fast information exchange among multiple intelligent agents; (2) Deployment of multi-agent systems by using graph theory to implement power system post-emergency control. In the paper, the proposed on-line collaborative voltage stability control is tested in the example 10-machine 39-node New England power system. Results of feasibility study from simulation are given considering the low-probability power system cascading faults.

Allocating transmission loss to loads and generators through complex power flow tracing

This paper presents a new method for complex power flow tracing that can be used for allocating the transmission loss to loads or generators. Two algorithms for upstream tracing (UST) and downstream tracing (DST) of the complex power are introduced. UST algorithm traces the complex power extracted by loads back to source nodes and assigns a fraction of the complex power flow through each line to each load. DST algorithm traces the output of the generators down to the sink nodes determining the contributions of each generator to the complex power flow and losses through each line. While doing so, active- and reactive-power flows as well as complex losses are considered simultaneously, not separately as most of the available methods do. Transmission losses are taken into consideration during power flow tracing. Unbundling line losses are carried out using an equation, which has a physical basis, and considers the coupling between active- and reactive-power flows as well as the cross effects of active and reactive powers on active and reactive losses. The tracing algorithms introduced can be considered direct to a good extent, as there is no need for exhaustive search to determine the flow paths as these are determined in a systematic way during the course of tracing. Results of application of the proposed method are also presented.

Efficient computation algorithm for calculating load contributions to line flows and losses

In a deregulated power system, it is usually required to determine the shares of each load and generation in line flows, to permit fair allocation of transmission costs between the interested parties. The paper presents a new method of determining the contributions of each load to line flows and losses. The method is based on power-flow topology and has the advantage of being the least computationally demanding of similar methods.