The dense deployment of small-cell base stations in heterogeneous networks (HetNets) requires efficient resource allocation and interference management techniques. Especially, the problem of associating users to base ...
详细信息
The dense deployment of small-cell base stations in heterogeneous networks (HetNets) requires efficient resource allocation and interference management techniques. Especially, the problem of associating users to base stations (BSs) and allocating frequency channels must be revised and carefully studied. Finding the optimal solution of such problem is NP-hard. Further, it requires huge amount of information exchange between the BSs. In order to efficiently solve this problem in a distributed manner, we model it using non-cooperative game theory. The proposed game model is proved to not always admit pure Nash equilibria (PNEs), even though simulations show that, for slow fading channels, a PNE exists for most instances of the game. It is shown that, when the game admits PNEs, its prices of anarchy and stability are close to one. By modifying the players' actions set and hence obtaining a new game model, we guarantee the existence of PNEs at the expense of performance degradation. Next, a fully distributed algorithm, based on a learning mechanism, is proposed. It requires no communication between the BSs and needs only one bit of feedback. Simulations show that the fully distributed algorithm has tight-to-optimal performance and solves efficiently the trade-off between complexity, information exchange and performance. We benchmark the proposed algorithm against the centralized optimal algorithm, the maximum signal to interference-plus-noise ratio algorithm, the best response dynamics algorithm and the randomized weighted majority algorithm. (C) 2017 Elsevier B.V. All rights reserved.
This paper addresses a class of optimization problems with time-varying cost functions by proposing a fullydistributed prescribed-time algorithm. The algorithm decomposes the overall optimization problem into three s...
详细信息
This paper addresses a class of optimization problems with time-varying cost functions by proposing a fullydistributed prescribed-time algorithm. The algorithm decomposes the overall optimization problem into three successive subproblems, which are solved sequentially. During the three stages of the algorithm, the estimation of the total cost function's average gradient information, consensus among the states, and tracking of the optimal state trajectories are achieved in turn. Given the segmentation strategy's demand for rapid convergence, the algorithm ensures convergence within a prescribed time. Using the Lyapunov method, it is shown that all three subproblems can be solved within any user-prescribed time, independent of the system's initial states or topology. To further exploit the independence of prescribed-time convergence from system states, the algorithm eliminates the reliance on system topology information in parameter settings by introducing adaptive parameters in place of traditional fixed ones, thus enabling fullydistributed control. Finally, numerical simulations and an UAV target tracking experiment are conducted to validate the effectiveness and practicality of the proposed algorithm.
This paper presents a novel approach to economic dispatch in smart grids equipped with diverse energy *** method integrates features including photovoltaic(PV)systems,energy storage coupling,varied energy roles,and en...
详细信息
This paper presents a novel approach to economic dispatch in smart grids equipped with diverse energy *** method integrates features including photovoltaic(PV)systems,energy storage coupling,varied energy roles,and energy supply and demand *** systemmodel is developed by considering energy devices as versatile units capable of fulfilling various functionalities and playing multiple roles *** strike a balance between optimality and feasibility,renewable energy resources are modeled with considerations for forecasting errors,Gaussian distribution,and penalty ***,this study introduces a distributed event-triggered surplus algorithm designed to address the economic dispatch problem by minimizing production *** in surplus theory and finite time projection,the algorithm effectively rectifies network imbalances caused by directed graphs and addresses local inequality *** algorithm greatly reduces the communication burden through event triggering ***,both theoretical proofs and numerical simulations verify the convergence and event-triggered nature of the algorithm.
As environmental protection greatly influences the social development, for the multi-energy systems (MES) equipped with a cluster of energy devices, the economic dispatch (ED) problem should not only be considered but...
详细信息
As environmental protection greatly influences the social development, for the multi-energy systems (MES) equipped with a cluster of energy devices, the economic dispatch (ED) problem should not only be considered but also the environmental protection problem should be considered in energy utilization. To address this issue, a multi-objective dispatch model of MES using a linear weighted sum algorithm (LWS) is developed in this paper, which considers the environmental and economic costs. On this basis, a fully distributed algorithm with the coupled control mechanism of power and heat is presented to realize coordination optimization between the environmental and economic benefits. Furthermore, an event-triggered communication strategy is implemented in the fully distributed algorithm, which can be effectively applied to the multi-objective dispatch model, to reduce the communication burden. Finally, the simulation results verify the effectiveness of the proposed distributed control strategy.
This paper aims to investigate the fullydistributed Nash equilibrium (NE) seeking problem in networked games under Denial of Service (DoS) attacks. A fullydistributed NE seeking algorithm is proposed, specifically d...
详细信息
ISBN:
(纸本)9798331540845;9789887581598
This paper aims to investigate the fullydistributed Nash equilibrium (NE) seeking problem in networked games under Denial of Service (DoS) attacks. A fullydistributed NE seeking algorithm is proposed, specifically designed to be resilient against DoS attacks. In an environment where DoS attacks can impair network connectivity, existing NE algorithms may experience degraded performance or even failure. To seek NE in a distributed manner without relying on any global information, adaptive control gains are introduced and a topology-dependent adaptive protocol for switching topologies is designed. Moreover, an estimation-feedback-based distributed NE seeking algorithm is proposed. The exponential convergence to NE of the proposed algorithm is established under specific conditions regarding the duration of the DoS attacks. Finally, the effectiveness of the algorithm is validated by numerical simulations.
In city-integrated energy systems containing electric-thermal multi-energy sources, the uncertainty of renewable energy sources and the fluctuation of loads challenge the safe, efficient, economic and stable operation...
详细信息
In city-integrated energy systems containing electric-thermal multi-energy sources, the uncertainty of renewable energy sources and the fluctuation of loads challenge the safe, efficient, economic and stable operation of the integrated energy systems. This paper introduces a novel approach for the operation of a carbon capture plant/CHP with PV accommodation within a city-integrated energy system. The proposed strategy aims to maximize the utilization of photovoltaic (PV) power generation and carbon capture equipment, addressing issues related to small-scale CHP climbing constraints and short-term output regulation. Additionally, this paper presents a multi-timescale optimal scheduling strategy, which effectively addresses deviations caused by PV fluctuations and load changes. This was achieved through a detailed analysis of the CHP climbing constraints, carbon capture equipment operation and real-time characteristics of PV power generation. This paper introduces a fullydistributed neural dynamics-based optimization algorithm designed to address multi-timescale optimization challenges. Utilizing rolling cycles, this algorithm computes both day-ahead and real-time scheduling outcomes for urban integrated energy systems. Theoretical analyses and numerical simulations were conducted to validate the precision and efficacy of the proposed model and algorithm. These analyses quantitatively evaluate the scheduling performance of PV power generation and carbon capture CHP systems across various timescales.
Tremendous number of renewable energy sources (RES) and distributed generators integrated into distribution system, power generation uncertainty and massive decision variables bring about significant challenges to dis...
详细信息
ISBN:
(数字)9781665450669
ISBN:
(纸本)9781665450669
Tremendous number of renewable energy sources (RES) and distributed generators integrated into distribution system, power generation uncertainty and massive decision variables bring about significant challenges to distribution system operator (DSO). Benefiting from advanced information technologies, distribution system evolves into cyber-physical distribution system (CPDS), and effective countermeasures can be made under distributed control framework to achieve optimality and resiliency of CPDS. For this purpose, fullydistributed robust control strategy is specifically explored in this paper. Firstly, a two-stage robust optimization (RO) model is developed for each sub-area in CPDS, which takes uncertainty of wind power into consideration. After that, based on Consensus-ADMM algorithm, a fullydistributed solution strategy of combined Consensus-ADMM and RO model is proposed. Results of study case verify that by adopting our method, accurate robust solution under different uncertainty budge can be obtained adaptively under diverse cyber or physical topologies, which guarantees optimality and resiliency of CPDS.
Here we consider the problem of designing finiteimpulse-response (FIR) graph filter (GF) in a fullydistributed way. For a directed graph with N nodes, each node designs filter coefficients in a distributed manner, wh...
详细信息
Here we consider the problem of designing finiteimpulse-response (FIR) graph filter (GF) in a fullydistributed way. For a directed graph with N nodes, each node designs filter coefficients in a distributed manner, when the knowledge of the graph structure, recognized as global information, is unavailable to each node. By modeling graph signal shifting with observations at a node as a linear dynamical system, we establish fundamental connections between local response of shifting at a node, concerned in the graph signal processing (GSP) field, and the observability of the system, investigated in control theory. The observability, as a measure of how well internal states of a dynamical system can be learned from node's observations, is reflected by the minimal polynomial of a matrix pair related to the system. Specifically, by introducing a notion of observable graph frequencies to a node, we show that the output signals (observations) at a node only contain the spectral components of its so-called observable graph frequencies. Furthermore, we unveil that the observability of a node to the spectral components of a GS is related to the rank of its observability matrix from the perspective of control theory. Our work reveals that partial signal outputs at a node are sufficient to design the FIR GF locally in terms of node-variant (NV) GFs. These findings further enable us to characterize the minimum-degree NV GF, where a minimum number of its shifted GSs are involved in the filter's output, and devise a distributed GF design algorithm for it.
This paper proposes a novel distributed approach to solve a new dynamic economic dispatch problem (DEDP) in which environmental cost function and ramp rate constraints are taken into consideration in islanded microgri...
详细信息
This paper proposes a novel distributed approach to solve a new dynamic economic dispatch problem (DEDP) in which environmental cost function and ramp rate constraints are taken into consideration in islanded microgrid. In our proposed optimization model, the environmental cost function with E-exponential term and ramp rate constraints are considered to make the optimization problem more practical. Then a novel fully distributed algorithm is proposed to address the DEDP based on the alternating direction method of multipliers (ADMM) and distributed consensus theory of the multiagents system. A Lambert $W$ function is employed to tackle the E-exponential term in the environmental cost function, which is different from most existing papers which discuss the DEDP only with quadratic cost functions. A parallel projection method on account of ADMM is used to deal with the ramp rate constraints in this paper. In addition, the power balance can be guaranteed every time when the sum of initial powder output is equal to the total demand. Therefore, the proposed algorithm can deal with the supply-demand constraints, capacity limit constraints, and ramp rate constraints. Finally, simulations on IEEE14-bus are introduced to further illustrate the effectiveness of the proposed algorithm.
Energy management of power distribution network (DN) and multi-stakeholder discrete manufacturing systems (MSs) faces significant challenges, including privacy preservation and high computational complexity. These cha...
详细信息
Energy management of power distribution network (DN) and multi-stakeholder discrete manufacturing systems (MSs) faces significant challenges, including privacy preservation and high computational complexity. These challenges are inherent in centralized energy scheduling methods commonly used in existing research. To address these issues, this paper proposes a computation-efficient hierarchical distributed energy management framework for the DN and MSs. Firstly, we formulate a two-layer energy scheduling model, where the upper layer optimizes energy scheduling for the DN and the lower layer for the MSs. Then, a parallel analytical target cascading (PATC) method is developed to solve the problem in a fullydistributed parallel manner, achieving efficient and privacy-preserving energy scheduling. The novelty of the PATC lies in its integration of the analytical target cascading (ATC) and diagonal quadratic approximation (DQA) methods, enabling problem decoupling and parallelization of solution procedures. To address potential divergence caused by binary decision variables, an alternating optimization procedure (AOP)-based framework is employed. Additionally, conditional value-at-risk is introduced to manage uncertainties in renewable energy outputs, supporting risk-averse scheduling decisions. Simulations on various test systems demonstrate the effectiveness and efficiency of the proposed method. Compared to the alternating direction method of multipliers and ATC, PATC not only effectively solve the two-layer problem but also reduces total solution time by 30.09 % and 16.47 %, respectively.
暂无评论