17 research outputs found
Distributed Apportioning in a Power Network for providing Demand Response Services
Greater penetration of Distributed Energy Resources (DERs) in power networks
requires coordination strategies that allow for self-adjustment of
contributions in a network of DERs, owing to variability in generation and
demand. In this article, a distributed scheme is proposed that enables a DER in
a network to arrive at viable power reference commands that satisfies the DERs
local constraints on its generation and loads it has to service, while, the
aggregated behavior of multiple DERs in the network and their respective loads
meet the ancillary services demanded by the grid. The Net-load Management
system for a single unit is referred to as the Local Inverter System (LIS) in
this article . A distinguishing feature of the proposed consensus based
solution is the distributed finite time termination of the algorithm that
allows each LIS unit in the network to determine power reference commands in
the presence of communication delays in a distributed manner. The proposed
scheme allows prioritization of Renewable Energy Sources (RES) in the network
and also enables auto-adjustment of contributions from LIS units with lower
priority resources (non-RES). The methods are validated using
hardware-in-the-loop simulations with Raspberry PI devices as distributed
control units, implementing the proposed distributed algorithm and responsible
for determining and dispatching realtime power reference commands to simulated
power electronics interface emulating LIS units for demand response.Comment: 7 pages, 11 Figures, IEEE International Conference on Smart Grid
Communication
On Robustness Analysis of a Dynamic Average Consensus Algorithm to Communication Delay
This paper studies the robustness of a dynamic average consensus algorithm to
communication delay over strongly connected and weight-balanced (SCWB)
digraphs. Under delay-free communication, the algorithm of interest achieves a
practical asymptotic tracking of the dynamic average of the time-varying
agents' reference signals. For this algorithm, in both its continuous-time and
discrete-time implementations, we characterize the admissible communication
delay range and study the effect of the delay on the rate of convergence and
the tracking error bound. Our study also includes establishing a relationship
between the admissible delay bound and the maximum degree of the SCWB digraphs.
We also show that for delays in the admissible bound, for static signals the
algorithms achieve perfect tracking. Moreover, when the interaction topology is
a connected undirected graph, we show that the discrete-time implementation is
guaranteed to tolerate at least one step delay. Simulations demonstrate our
results
Push sum with transmission failures
The push-sum algorithm allows distributed computing of the average on a
directed graph, and is particularly relevant when one is restricted to one-way
and/or asynchronous communications. We investigate its behavior in the presence
of unreliable communication channels where messages can be lost. We show that
exponential convergence still holds and deduce fundamental properties that
implicitly describe the distribution of the final value obtained. We analyze
the error of the final common value we get for the essential case of two nodes,
both theoretically and numerically. We provide performance comparison with a
standard consensus algorithm