Stochastic power system optimisation algorithm with applications to distributed generation integration

PhD ThesisThe ever increasing level of penetration of Distributed Generation (DG) in power distribution networks is not without its challenges for network planners and operators. Some of these challenges are in the areas of voltage regulation, increase of network fault levels and the disturbance to the network protection settings. Distributed generation can be beneficial to both electricity consumers and if the integration is properly engineered the energy utility. Thus, the need for tools considering these challenges for the optimal placement and sizing of DG units cannot be over emphasized. This dissertation focuses on the application of a soft computing technique based on a stochastic optimisation algorithm (Particle Swarm Optimisation or PSO) for the integration of DG in a power distribution network. The proposed algorithm takes into consideration the inherent nature of the control variables that comprise the search space in the optimal DG sizing/location optimisation problem, without compromising the network operational constraints. The developments of the proposed Multi-Search PSO algorithm (MSPSO) is described, and the algorithm is tested using a standard, benchmarking 69-bus radial distribution network. MSPSO results and performance are compared with that of a conventional PSO algorithm (and other analytical and stochastic methods). Both single-objective (minimising network power loss) and multi-objective (considering nodal voltages as part of the cost function) optimisation studies were conducted. When compared with previously published studies, the proposed MSPSO algorithm produces more realistic results since it accounts for the discrete sizes of commercially available DG units. The new MSPSO algorithm was also found to be the most computationally efficient, substantially reducing the search space and hence the computational cost of the algorithm compared with other methods, without loss of quality in the obtained solutions. As well as the size and location of DG units, these studies considered the operation of the generators to provide ancillary voltage support to the network (i.e. with the generators operating over a realistic range of lagging power factors, injecting reactive power into the network). The algorithm was also employed to optimise the integration of induction generation based DG into the network, considering network short-circuit current ratings and line loading constraints. A new method for computing the reactive power requirement of the Abstract V induction generator (based on the machine equivalent circuit) was developed and interfaced with the MSPSO to solve the optimization problem, including the generator shunt compensation capacitors. Finally, the MSPSO was implemented to carry out a DG integration problem for a real distribution network and the results validated using a commercial power system analysis tool (ERACS).Petroleum Technology Development Fund (PTDF) Overseas Scholarship Schem

A Novel Approach to Transmission Power, Lifetime and Connectivity Optimization in Asymmetric Networks

This thesis deals with the problem of proper power management over asymmetric networks represented by weighted directed graphs (digraphs) in the presence of various constraints. Three different problems are investigated in this study. First, the problem of total transmission power optimization and connectivity control over the network is examined. The notion of generalized algebraic connectivity (GAC), used as a network connectivity measure, is formulated as an implicit function of the nodes' transmission powers. An optimization problem is then presented to minimize the total transmission power of the network while considering constraints on the values of the GAC and the individual transmission power levels. The problem of network lifetime maximization and connectivity control is investigated afterwards. Each node is assumed to deplete its battery linearly with respect to the transmission powers used for communication, and the network lifetime is defined as the minimum lifetime over all nodes. Finally, it is desired to maximize the connectivity level of the network with constraints on the total transmission power of the network and the individual transmission powers. The interior point and the mixed interior point-exterior point methods are utilized to transform these constrained optimization problems into sequential optimization problems. Given the new formulation, each subproblem is then solved numerically via the subgradient method with backtracking line search. A distributed version of the algorithm, taking into account the estimation of global quantities, is provided. The asymptotic convergence of the proposed centralized and distributed algorithms is demonstrated analytically, and their effectiveness is verified by simulations

A Submodular Approach for Electricity Distribution Network Reconfiguration

Distribution network reconfiguration (DNR) is a tool used by operators to balance line load flows and mitigate losses. As distributed generation and flexible load adoption increases, the impact of DNR on the security, efficiency, and reliability of the grid will increase as well. Today, heuristic-based actions like branch exchange are routinely taken, with no theoretical guarantee of their optimality. This paper considers loss minimization via DNR, which changes the on/off status of switches in the network. The goal is to ensure a radial final configuration (called a spanning tree in the algorithms literature) that spans all network buses and connects them to the substation (called the root of the tree) through a single path. We prove that the associated combinatorial optimization problem is strongly NP-hard and thus likely cannot be solved efficiently. We formulate the loss minimization problem as a supermodular function minimization under a single matroid basis constraint, and use existing algorithms to propose a polynomial time local search algorithm for the DNR problem at hand and derive performance bounds. We show that our algorithm is equivalent to the extensively used branch exchange algorithm, for which, to the best of our knowledge, we pioneer in proposing a theoretical performance bound. Finally, we use a 33-bus network to compare our algorithm\u27s performance to several algorithms published in the literature

Solving DCOPs with Distributed Large Neighborhood Search

The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation. Nevertheless, solving Distributed Constraint Optimization Problems (DCOPs) optimally is NP-hard. Therefore, in large-scale, complex applications, incomplete DCOP algorithms are necessary. Current incomplete DCOP algorithms suffer of one or more of the following limitations: they (a) find local minima without providing quality guarantees; (b) provide loose quality assessment; or (c) are unable to benefit from the structure of the problem, such as domain-dependent knowledge and hard constraints. Therefore, capitalizing on strategies from the centralized constraint solving community, we propose a Distributed Large Neighborhood Search (D-LNS) framework to solve DCOPs. The proposed framework (with its novel repair phase) provides guarantees on solution quality, refining upper and lower bounds during the iterative process, and can exploit domain-dependent structures. Our experimental results show that D-LNS outperforms other incomplete DCOP algorithms on both structured and unstructured problem instances

Efficient methods of automatic calibration for rainfall-runoff modelling in the Floreon+ system

Calibration of rainfall-runoff model parameters is an inseparable part of hydrological simulations. To achieve more accurate results of these simulations, it is necessary to implement an efficient calibration method that provides sufficient refinement of the model parameters in a reasonable time frame. In order to perform the calibration repeatedly for large amount of data and provide results of calibrated model simulations for the flood warning process in a short time, the method also has to be automated. In this paper, several local and global optimization methods are tested for their efficiency. The main goal is to identify the most accurate method for the calibration process that provides accurate results in an operational time frame (typically less than 1 hour) to be used in the flood prediction Floreon(+) system. All calibrations were performed on the measured data during the rainfall events in 2010 in the Moravian-Silesian region (Czech Republic) using our in-house rainfall-runoff model.Web of Science27441339

Collective Robot Reinforcement Learning with Distributed Asynchronous Guided Policy Search

In principle, reinforcement learning and policy search methods can enable robots to learn highly complex and general skills that may allow them to function amid the complexity and diversity of the real world. However, training a policy that generalizes well across a wide range of real-world conditions requires far greater quantity and diversity of experience than is practical to collect with a single robot. Fortunately, it is possible for multiple robots to share their experience with one another, and thereby, learn a policy collectively. In this work, we explore distributed and asynchronous policy learning as a means to achieve generalization and improved training times on challenging, real-world manipulation tasks. We propose a distributed and asynchronous version of Guided Policy Search and use it to demonstrate collective policy learning on a vision-based door opening task using four robots. We show that it achieves better generalization, utilization, and training times than the single robot alternative.Comment: Submitted to the IEEE International Conference on Robotics and Automation 201