When generation is insufficient to support all loads in a power system under emergencies, effective and efficient load shedding needs to be deployed in order to prevent system collapse. This paper presents a ratio con...
详细信息
ISBN:
(纸本)9781509021574
When generation is insufficient to support all loads in a power system under emergencies, effective and efficient load shedding needs to be deployed in order to prevent system collapse. This paper presents a ratio consensus based distributed algorithm to discover the system overload after disturbance. In the proposed algorithm, the agent at each bus only communicates with its neighboring agents via directed communication links possibly with arbitrarily large but bounded time-varying communication delays. Simulation results are used to validate the proposed method.
The multi-robot network topology control and connectivity preserving problem is studied. We introduce the global message connectivity to represent the quality of service (QoS) of the network. A combined distributed al...
详细信息
ISBN:
(纸本)9781509007684
The multi-robot network topology control and connectivity preserving problem is studied. We introduce the global message connectivity to represent the quality of service (QoS) of the network. A combined distributed algorithm of topology control and connectivity motion control is proposed. Simulation results show that the algorithm can improve the global message connectivity while keeping the network connected.
In this paper, we propose a variable sample distributed algorithm for the computation of stochastic Nash equilibrium in which the objective functions are replaced, at each iteration, by sample average approximations. ...
详细信息
ISBN:
(纸本)9781467397148
In this paper, we propose a variable sample distributed algorithm for the computation of stochastic Nash equilibrium in which the objective functions are replaced, at each iteration, by sample average approximations. We investigate the contraction mapping properties of the variable sample distributed algorithm and show that the accuracy of estimators yielded in the algorithms to their true counterparts are determined by both the sample size schedules and the contraction mapping parameters. We also investigate conditions on the sample size schedules under which the accumulation point generated by the algorithm asymptotically converges to the true Nash equilibrium.
Economic dispatch problem (EDP) is an optimization problem with the objective to minimize the total generation cost subject to the power balance constraint and generator capacity limits. Typically, EDP is solved in a ...
详细信息
ISBN:
(纸本)9781467380409
Economic dispatch problem (EDP) is an optimization problem with the objective to minimize the total generation cost subject to the power balance constraint and generator capacity limits. Typically, EDP is solved in a centralized manner, however, recently, several consensus-based algorithms have been proposed to solve EDP in a distributed manner. In these algorithms, it is assumed that information are exchanged through the perfect communication network. However time delays are ubiquitous in the communication network. This paper investigates impacts of communication time delays on a distributed algorithm. This algorithm has been tested by applying time delays to different types of information exchange. Several case studies are carried out to evaluate the effectiveness and performance of the algorithm in the presence of time delays in communication networks. It is found that time delays can negatively affect convergence rate, resulting in the algorithm either converging to an incorrect value or failing to converge altogether.
This paper considers the dynamic downlink spectrum resource allocation problem in dense small cell networks. To address the problem, we propose a distributed downlink resource allocation (DDRA) algorithm, which allows...
详细信息
ISBN:
(纸本)9781467376877
This paper considers the dynamic downlink spectrum resource allocation problem in dense small cell networks. To address the problem, we propose a distributed downlink resource allocation (DDRA) algorithm, which allows each base station to perform resource allocation for its users in a distributed manner. To support the DDRA algorithm, each base station needs to maintain a couple of interference tables, SITable and WITable, which are used to store those base stations that have a strong interference and a weak interference to each user in the corresponding cell in each timeslot, respectively. Meanwhile, it also needs to maintain a couple of resource status tables, SRSTable and WRSTable, which are used to store the RBs that have been allocated by those base stations contained in the SITable and WITable in each timeslot, respectively. Based on the resource status tables, each base station performs resource block (RB) allocation for its users. For each new user, those RBs that would cause a strong interference are not considered in allocation. Only those RBs that would not cause any interference or only cause a weak interference are considered. Simulation results show that the proposed DDRA algorithm can significantly increase the system capacity as compared to an existing resource allocation algorithm.
In this paper a novel Geometric Programming based distributed approach is proposed which enables small cell users to optimize their downlink performance by exploiting distributed joint allocation of transmission power...
详细信息
ISBN:
(纸本)9781509016983
In this paper a novel Geometric Programming based distributed approach is proposed which enables small cell users to optimize their downlink performance by exploiting distributed joint allocation of transmission power and subchannels. The problem is formulated to maximize the system sum capacity, specifically, the time delay is taken into as a constraint to guarantee the quality of service. Consequently, the original problem is modeled as a non-convex NP-hard problem. To solve this problem, Geometric Programming is used to convert the original optimization problem into a convex one, which is further solved to obtain the global optimal solution. What's more, Simulation results show that the proposed approach yields significant performance gains.
Microgrids (MGs) have been receiving more and more attention, as it can environmentally and reliably integrate intermittent renewable energy sources (RES). Conventionally, an islanded MG is controlled and optimized in...
详细信息
ISBN:
(纸本)9781509054183
Microgrids (MGs) have been receiving more and more attention, as it can environmentally and reliably integrate intermittent renewable energy sources (RES). Conventionally, an islanded MG is controlled and optimized in a hierarchical strategy, i.e., primary droop control, second automatic generation control (AGC), and tertiary economic dispatch (ED). ED has large time-scale while AGC has small time-scale. Thus the gap between ED and AGC may decrease the economic efficiency of a MG. In this paper, a distributed optimal automatic generation control (OAGC) algorithm is proposed to integrate the gap between ED and AGC, i.e., the MG can realize AGC and ED at the same time. In order to implement the OAGC algorithm, each DG is assigned with an agent and the agents only require the local measurements and communicate with its neighbors. The proposed OAGC algorithm is fully distributed, which involves low costs related to modify the architecture of a MG and robust against single point failure. Simulation results demonstrate the effectiveness of the proposed algorithm.
More and more wireless networks and devices now operate on multiple channels, which poses the question: How to use multiple channels to speed up communication? In this paper, we answer this question for the case of wi...
详细信息
More and more wireless networks and devices now operate on multiple channels, which poses the question: How to use multiple channels to speed up communication? In this paper, we answer this question for the case of wireless ad-hoc networks where information dissemination is a primitive operation. Specifically, we propose a randomized distributed algorithm for information dissemination that is very near the optimal. The general information dissemination problem is to deliver information packets, stored initially in different nodes (the packet holders), to all the nodes in the network, and the objective is to minimize the time needed. With an eye toward the reality, we assume a model where the packet holders are determined by an adversary, and neither the number nor the identities of packet holders are known to the nodes in advance. Not knowing the value of sets this problem apart from broadcasting and all-to-all communication (gossiping). We study the information dissemination problem in single-hop networks with bounded-size messages. We present a randomized algorithm which can disseminate all packets in rounds with high probability, where is the number of available channels and is the bound on the number of packets a message can carry. Compared with the lower bound , the given algorithm is very close to the asymptotical optimal except for an additive factor. Our result provides the first solid evidence that multiple channels can indeed substantially speed up information dissemination, which also breaks the lower bound that holds for single-channel networks (even if is infinity).
In this paper, the finite-time consensus for arbitrary undirected graphs is discussed. We develop a parametric distributed algorithm as a function of a linear operator defined on the underlying graph and provide a nec...
详细信息
In this paper, the finite-time consensus for arbitrary undirected graphs is discussed. We develop a parametric distributed algorithm as a function of a linear operator defined on the underlying graph and provide a necessary and sufficient condition guaranteeing weighted average consensus in K steps, where K is the number of distinct eigenvalues of the underlying operator. Based on the novel framework of generalized consensus meaning that consensus is reached only by a subset of nodes, we show that the finite time weighted average consensus can always be reached by a subset corresponding to the non-zero variables of the eigenvector associated with a simple eigenvalue of the operator. It is interesting that the final consensus state is shown to be freely adjustable if a smaller subset of consensus is admitted. Numerical examples, including synthetic and real-world networks, are presented to illustrate the theoretical results. Our approach is inspired by the recent method of successive nulling of eigenvalues by Safavi and Khan.
Automatic generation control (AGC) regulates mechanical power generation in response to load changes through local measurements. Its main objective is to maintain system frequency and keep energy balanced within each ...
详细信息
Automatic generation control (AGC) regulates mechanical power generation in response to load changes through local measurements. Its main objective is to maintain system frequency and keep energy balanced within each control area in order to maintain the scheduled net interchanges between control areas. The scheduled interchanges as well as some other factors of AGC are determined at a slower time scale by considering a centralized economic dispatch (ED) problem among different generators. However, how to make AGC more economically efficient is less studied. In this paper, we study the connections between AGC and ED by reverse engineering AGC from an optimization view, and then we propose a distributed approach to slightly modify the conventional AGC to improve its economic efficiency by incorporating ED into the AGC automatically and dynamically.
暂无评论