Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment

DOI10.1016/J.AUTOMATICA.2016.07.003zbMATH Open1348.93204arXiv1409.4382OpenAlexW2256186208MaRDI QIDQ340665FDOQ340665

Authors: Ashish Cherukuri, J. Cortés 

Publication date: 14 November 2016

Published in: Automatica (Search for Journal in Brave)

Abstract: This paper considers the economic dispatch problem for a network of power generating units communicating over a strongly connected, weight-balanced digraph. The collective aim is to meet a power demand while respecting individual generator constraints and minimizing the total generation cost. We design a distributed coordination algorithm consisting of two interconnected dynamical systems. One block uses dynamic average consensus to estimate the evolving mismatch in load satisfaction given the generation levels of the units. The other block adjusts the generation levels based on the optimization objective and the estimate of the load mismatch. Our convergence analysis shows that the resulting strategy provably converges to the solution of the dispatch problem starting from any initial power allocation, and therefore does not require any specific procedure for initialization. We also characterize the algorithm robustness properties against the addition and deletion of units (capturing scenarios with intermittent power generation) and its ability to track time-varying loads. Our technical approach employs a novel refinement of the LaSalle Invariance Principle for differential inclusions, that we also establish and is of independent interest. Several simulations illustrate our results.

Full work available at URL: https://arxiv.org/abs/1409.4382

Recommendations

• Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem
• Analysis of a distributed consensus based economic dispatch algorithm
• Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
• Distributed learning algorithms and lossless convex relaxation for economic dispatch with transmission losses and capacity limits
• Event-triggered scheme for finite-time distributed economic dispatch in smart grids

zbMATH Keywords

invariance principlesdistributed optimizationeconomic dispatchdynamic average consensuspower networks

Mathematics Subject Classification ID

Application models in control theory (93C95) Applications of graph theory to circuits and networks (94C15) Modulation and demodulation in information and communication theory (94A14)

Cites Work

• Title not available (Why is that?)
• Design and Stability of Load-Side Primary Frequency Control in Power Systems
• Title not available (Why is that?)
• Discontinuous dynamical systems
• Optimal scaling of a gradient method for distributed resource allocation
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Locating omega-limit sets using height functions
• Stability and Stabilization of Discontinuous Systems and Nonsmooth Lyapunov Functions
• Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
• Eigenvalues, diameter, and mean distance in graphs
• Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
• Dynamic average consensus under limited control authority and privacy requirements

Cited In (42)

• Distributed event-triggered algorithms for a class of convex optimization problems over directed networks
• Distributed Nash equilibrium seeking with order-reduced dynamics based on consensus exact penalty
• An exponentially convergent distributed algorithm for resource allocation problem
• Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
• Event-triggered scheme for finite-time distributed economic dispatch in smart grids
• Consensus-based distributed fixed-time optimization for a class of resource allocation problems
• Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem
• Distributed sub-optimal resource allocation via a projected form of singular perturbation
• Privacy-preserving dynamic average consensus via state decomposition: case study on multi-robot formation control
• Predefined-time distributed optimization algorithms for a class of resource allocation problem
• Gradient-free algorithms for distributed online convex optimization
• Cooperative fixed-time/finite-time distributed robust optimization of multi-agent systems
• A local-minimization-free zero-gradient-sum algorithm for distributed optimization
• Analysis of a distributed consensus based economic dispatch algorithm
• A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems
• Linear convergence of primal-dual gradient methods and their performance in distributed optimization
• Distributed optimization for a class of uncertain MIMO nonlinear multi-agent systems with arbitrary relative degree
• Redcho: robust exact dynamic consensus of high order
• Distributed strategy for constrained resource allocation problems of autonomous second-order nonlinear agents and its application to smart grids
• Distributed approximate Newton algorithms and weight design for constrained optimization
• A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems
• Network sensitivity function, optimization and robust performance in dynamic average consensus
• Distributed dynamic event-triggered and practical predefined-time resource allocation in cyber-physical systems
• Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
• Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems
• Distributed event-triggered algorithm for convex optimization with coupled constraints
• Robust dynamic average consensus with prescribed transient and steady state performance
• Distributed optimal in-network resource allocation algorithm design via a control theoretic approach
• A distributed fixed-time optimization algorithm for multi-agent systems
• Distributed algorithm for resource allocation problems under persistent attacks
• Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
• Distributed \(k\)-winners-take-all via multiple neural networks with inertia
• Distributed continuous-time time-varying optimization for networked Lagrangian systems with quadratic cost functions
• Distributed algorithm design for optimal resource allocation problems via incremental passivity theory
• Distributed resource allocation on dynamic networks in quadratic time
• Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
• Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
• Observer‐based distributed average tracking of second‐order multi‐agent systems with disturbances
• Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach
• Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints
• Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization
• A novel dynamic event-triggered mechanism for dynamic average consensus

This page was built for publication: Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340665)