In this paper, restorations for both voltage and frequency in the droop-controlled inverter-based islanded microgrid (MG) are addressed. A distributed finite-time control approach is used in the voltage restoration which enables the voltages at all the distributed generations (DGs) to converge to the reference value in finite time, and thus, the voltage and frequency control design can be separated. Then, a consensus-based distributed frequency control is proposed for frequency restoration, subject to certain control input constraints. Our control strategies are implemented on the local DGs, and thus, no central controller is required in contrast to existing control schemes proposed so far. By allowing these controllers to communicate with their neighboring controllers, the proposed control strategy can restore both voltage and frequency to their respective reference values while having accurate real power sharing, under a sufficient local stability condition established. An islanded MG test system consisting of four DGs is built in MATLAB to illustrate our design approach, and the results validate our proposed control strategy.
In this paper, we present a distributed economic dispatch (ED) strategy based on projected gradient and finite-time average consensus algorithms for smart grid systems. Both conventional thermal generators and wind turbines are taken into account in the ED model. By decomposing the centralized optimization into optimizations at local agents, a scheme is proposed for each agent to iteratively estimate a solution of the optimization problem in a distributed manner with limited communication among neighbors. It is theoretically shown that the estimated solutions of all the agents reach consensus of the optimal solution asymptomatically. This scheme also brings some advantages, such as plug-and-play property. Different from most existing distributed methods, the private confidential information, such as gradient or incremental cost of each generator, is not required for the information exchange, which makes more sense in real applications. Besides, the proposed method not only handles quadratic, but also nonquadratic convex cost functions with arbitrary initial values. Several case studies implemented on six-bus power system, as well as the IEEE 30-bus power system, are discussed and tested to validate the proposed method.
30 July 2015 in IEEE Transactions on Industrial Informatics
This paper presents a distributed cooperative control scheme for voltage unbalance compensation (VUC) in an islanded microgrid (MG). By letting each distributed generator (DG) share the compensation effort cooperatively, unbalanced voltage in sensitive load bus (SLB) can be compensated. The concept of contribution level (CL) for compensation is first proposed for each local DG to indicate its compensation ability. A two-layer secondary compensation architecture consisting of a communication layer and a compensation layer is designed for each local DG. A totally distributed strategy involving information sharing and exchange is proposed, which is based on finite-time average consensus and newly developed graph discovery algorithm. This strategy does not require the whole system structure as a prior and can detect the structure automatically. The proposed scheme not only achieves similar VUC performance to the centralized one, but also brings some advantages, such as communication fault tolerance and plug-and-play property. Case studies including communication failure, CL variation, and DG plug-and-play are discussed and tested to validate the proposed method.
5 September 2017 in IEEE Transactions on Industrial Informatics
In this paper, a new hierarchical decentralized optimization architecture is proposed to solve the economic dispatch problem for a large-scale power system, without restriction on the number of generators. Conventionally such a problem is solved in a centralized way, which is usually inflexible and costly in computation. In contrast to centralized algorithms, in this paper we decompose the centralized problem into local problems. Each local generator only solves its own problem iteratively, based on its own cost function and generation constraint. An extra coordinator agent is employed to coordinate all the local generator agents. Besides, it also takes responsibility to handle the global demand supply constraint based on a newly proposed concept named virtual agent. In this way, different from existing distributed algorithms, the global demand supply constraint and local generation constraints are handled separately, which would greatly reduce the computational complexity. In addition, as only local individual estimate is exchanged between the local agent and the leader agent, the communication burden is reduced and the information privacy is also protected. It is theoretically shown that under proposed hierarchical decentralized optimization architecture, each local generator agent can obtain the optimal solution in a decentralized fashion. Several case studies implemented on the IEEE 30-bus and the IEEE 118-bus, are discussed and tested to validate the proposed method.
30 April 2007 in IEEE Transactions on Mobile Computing
Dynamic voltage scaling is used in energy-limited systems as a means of conserving energy and prolonging their life. We consider a setting in which the tasks performed by such a system are nonpreemptive and aperiodic. Our objective is to control the processing rate over different tasks so as to minimize energy subject to hard real-time processing constraints. Under any given task scheduling policy, we prove that the optimal solution to the offline version of the problem can be efficiently obtained by exploiting the structure of optimal sample paths, leading to a new dynamic voltage scaling algorithm termed the critical task decomposition algorithm (CTDA). The efficiency of the algorithm rests on the existence of a set of critical tasks that decompose the optimal sample path into decoupled segments within which optimal processing times are easily determined. The algorithm is readily extended to an online version of the problem as well. Its worst-case complexity of both offline and online problems is O(N2)