A Distributed Algorithm for Economic Dispatch with Packet Drops and Time Delays on Digraph

This paper proposes a distributed algorithm to solve the economic dispatch problem (EDP) over fixed directed communication networks, which is based on ratio consensus and running sum method. Under the assumption that the network is strongly connected, the distributed algorithm can handle both packet drops and bounded time delays. The analyses of packet drops and time delays are based on the augmented digraph idea, which models the packet drops and time delays as "virtual buffers" and "virtual" nodes respectively. Finally, some numerical examples are used to verify the proposed algorithm.