检索结果-内蒙古大学图书馆

distributed Optimization for Integrated Frequency Regulation and Economic Dispatch in Microgrids

IEEE TRANSACTIONS ON SMART GRID 2021年第6期12卷 4595-4606页

作者： Xu, Yiqiao Dong, Zhen Li, Zhongguo Liu, Yixing Ding, Zhengtao Univ Manchester Dept Elect & Elect Engn Manchester M13 9PL Lancs England Loughborough Univ Dept Aeronaut & Automot Engn Loughborough LE11 3TU Leics England

In hierarchically controlled microgrids, economic dispatch and corresponding real-time control action are inherently performed at different timescales. Owing to the uncertainty in renewables, running economic dispatch in advance may not adequately guarantee the anticipated outcomes. In this paper, distributed optimization algorithms are developed to manage economic dispatch and frequency regulation in microgrids concurrently, leaving the inter-layer coordination across timescales unnecessary. We first formulate a distributed economic dispatch problem that minimizes the overall opportunity cost yielded by renewable energy sources participating in frequency regulation. Then, by considering the dynamical characteristics of inverter-based microgrids, we reconstruct the optimization problem from the perspective of feedback control design utilizing local frequency feedback to perceive and compensate supply-demand imbalance in an online fashion, despite resistance losses. As a result, the proposed algorithms can settle the optimal dispatch and restore the frequency to its nominal value. Under reasonable operational assumptions, the closed-loop stability and asymptotic convergence to the optimal solution are rigorously established. Simulation results demonstrate the effectiveness and tractability of the proposed algorithms.

关键词： Microgrids Inverters Frequency control Economics Optimization Time-frequency analysis Eigenvalues and eigenfunctions Optimization distributed algorithms frequency control power generation dispatch microgrids

来源：评论

学校读者我要写书评

暂无评论

Online Learning Over Dynamic Graphs via distributed Proximal Gradient Algorithm

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2021年第11期66卷 5065-5079页

作者： Dixit, Rishabh Bedi, Amrit Singh Rajawat, Ketan Rutgers State Univ Dept Elect & Comp Engn New Brunswick NJ 08901 USA Indian Inst Technol Kanpur Dept Elect Engn Kanpur 208016 Uttar Pradesh India

We consider the problem of tracking the minimum of a time-varying convex optimization problem over a dynamic graph. Motivated by target tracking and parameter estimation problems in intermittently connected robotic and sensor networks, the goal is to design a distributed algorithm capable of handling nondifferentiable regularization penalties. The proposed proximal online gradient descent algorithm is built to run in a fully decentralized manner and utilizes consensus updates over possibly disconnected graphs. The performance of the proposed algorithm is analyzed by developing bounds on its dynamic regret in terms of the cumulative path length of the timevarying optimum. It is shown that as compared to the centralized case, the dynamic regret incurred by the proposed algorithm over T time slots is worse by a factor of log(T) only, despite the disconnected and time-varying network topology. The empirical performance of the proposed algorithm is tested on the distributed dynamic sparse recovery problem, where it is shown to incur a dynamic regret that is close to that of the centralized algorithm.

关键词： Heuristic algorithms Signal processing algorithms Convex functions distributed algorithms Network topology Optimization Robot sensing systems distributed optimization dynamic regret online convex optimization sparse signal recovery

来源：评论

学校读者我要写书评

暂无评论

distributed Balancing Under Flow Constraints Over Arbitrary Communication Topologies

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2021年第12期66卷 5637-5650页

作者： Hadjicostis, Christoforos N. Dominguez-Garcia, Alejandro D. Univ Cyprus Dept Elect & Comp Engn CY-1678 Nicosia Cyprus Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

In this article, we consider a flow network that is described by a digraph, each edge of which can admit a flow within a certain interval, with non-negative end points that correspond to lower and upper flow limits. We propose and analyze a distributed iterative algorithm for solving the so-called feasible circulation problem, which consists of computing flows that are within the given intervals at each edge and balance the total inflow and the total outflow at each node. Unlike previously proposed distributed algorithms that required bidirectional communication between pairs of nodes that share an edge in the flow network, the algorithm we propose can operate over any communication network, assuming the corresponding digraph that describes it is strongly connected. The proposed algorithm allows the nodes to asymptotically compute (with a geometric rate that depends on the specifics of the given flow network and communication topology) a solution to the feasible circulation problem, as long as such a solution exists. An important special case of the setting studied in this article is the case where the digraph of the flow network matches the digraph of the communication network.

关键词： Network topology Topology distributed algorithms Communication networks Optimization Iterative methods Bidirectional control Digraph directed communication topology distributed balancing feasible circulation flow networks

来源：评论

学校读者我要写书评

暂无评论

distributed Dominating Sets in Interval Graphs 28th

Distributed Dominating Sets in Interval Graphs

引用

28th International Computing and Combinatorics Conference (COCOON)

作者： Gorain, Barun Mondal, Kaushik Pandit, Supantha Indian Inst Technol Bhilai Raipur Chattisgarh India Indian Inst Technol Ropar Rupnagar Punjab India Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar Gujarat India

ISBN: (纸本)9783031221040;9783031221057

The Minimum Dominating Set (MMDS) and Minimum Connected Dominating set (MMCDS) problems are well-studied in the distributed communities due to their numerous applications across the field. These problems are also crucial in wireless ad hoc networks, mainly for the particular type of geometric graphs. We study these problems in geometric graphs such as interval and unit interval graphs. We exploit the underlying geometric structures of these graph classes and present either constant factors distributed algorithms in constant rounds or algorithms with matching lower bounds in the LOCAL communication model.

关键词： Minimum dominating set Minimum connected dominating set distributed algorithms Interval graphs Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Continuous-Time Optimization of Second-Order Multiagent Systems With Nonconvex Input Constraints

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第10期51卷 6404-6413页

作者： Mo, Lipo Yu, Yongguang Zhao, Lin Cao, Xianbing Beijing Technol & Business Univ Sch Math & Stat Beijing 100048 Peoples R China Beijing Jiaotong Univ Dept Math Beijing 100044 Peoples R China Qingdao Univ Sch Automat Qingdao 266071 Peoples R China

This article discusses the distributed continuous-time optimization problem (DCTOP) of second-order multiagent systems (SOMASs). It is assumed that the inputs are required to be in some nonconvex sets, the team objective function (TOF) is a combination of general differentiable convex functions, and each agent can only obtain the information of one local objective function. Based on the neighbors' information, a new distributed continuous-time optimization algorithm (DCTOA) is first proposed for each agent, where its gradient gains are nonuniform. By introducing a scaling factor and a model transformation, the corresponding system is changed into a time-varying nonlinear system which does not contain constraint operator in form. Then, it is proven that all agents' states could reach an agreement and the TOF could be minimized by constructing some new Lyapunov functions. Finally, the effectiveness of the algorithm is shown by simulation results.

关键词： Optimization Multi-agent systems Linear programming distributed algorithms Force Convergence Lyapunov methods Agreement continuous-time algorithm distributed optimization nonconvex constraints nonuniform gains second-order systems

来源：评论

学校读者我要写书评

暂无评论

Randomized Block Proximal Methods for distributed Stochastic Big-Data Optimization

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2021年第9期66卷 4000-4014页

作者： Farina, Francesco Notarstefano, Giuseppe GlaxoSmithKline Artificial Intelligence & Machine Learning Grp London TW8 9GS England Univ Bologna Dept Elect Elect & Informat Engn G Marconi I-40136 Bologna Italy

In this article, we introduce a class of novel distributed algorithms for solving stochastic big-data convex optimization problems over directed graphs. In the addressed set-up, the dimension of the decision variable can be extremely high and the objective function can be nonsmooth. The general algorithm consists of two main steps: a consensus step and an update on a single block of the optimization variable, which is then broadcast to neighbors. Three special instances of the proposed method, involving particular problem structures, are then presented. In the general case, the convergence of a dynamic consensus algorithm over random row stochastic matrices is shown. Then, the convergence of the proposed algorithm to the optimal cost is proven in expected value. Exact convergence is achieved when using diminishing (local) stepsizes, whereas approximate convergence is attained when constant stepsizes are employed. The convergence rate is shown to be sublinear and an explicit rate is provided in the case of constant stepsizes. Finally, the algorithm is tested on a distributed classification problem, first on synthetic data and, then, on a real, high-dimensional, text dataset.

关键词： Optimization Convergence Linear programming Stochastic processes distributed algorithms Approximation algorithms Heuristic algorithms Big data applications distributed algorithms optimization methods Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

distributed Time-Varying Output Formation Tracking Control for General Linear Multi-Agent Systems With Multiple Leaders and Relative Output-Feedback

引用

IEEE ACCESS 2021年 9卷 59586-59596页

作者： Wang, Rui Univ Toronto Dept Elect & Comp Engn Syst Control Grp Toronto ON M5S 3G4 Canada

In this paper, a unified distributed swarm intelligence algorithm is developed to study time-varying output formation (TVOF) for a general linear multi-agent system (MAS) with a directed network. New adaptive output-feedback formation protocols are proposed to achieve TVOF stabilization for leaderless directed networks and TVOF tracking for leader-follower networks. For the leaderless case, only agents' outputs are required to achieve the desired time-varying formation. An adaptive observer-type formation protocol is constructed via relative outputs of neighboring agents. No global information of the directed network is used to determine the protocol. A distributed algorithm is developed to solve the TVOF stabilization problem after the observability decomposition. For the leader-follower case, only partial agents have knowledge of the leaders' information. An adaptive formation tracking protocol is constructed using dynamic relative output-feedback for neighboring followers. Based on the distributed algorithm, it is proved that the TVOF tracking problem with multiple leaders can be solved in a fully distributed manner.

关键词： Protocols distributed algorithms Multi-agent systems Matrix decomposition Eigenvalues and eigenfunctions 5G mobile communication Vehicle dynamics Output formation tracking adaptive observer-type protocol dynamic relative output-feedback time-varying formation multi-agent system

来源：评论

学校读者我要写书评

暂无评论

distributed Estimation Under Sensor Attacks: Linear and Nonlinear Measurement Models

引用

IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS 2021年 7卷 156-165页

作者： Meng, Min Li, Xiuxian Xiao, Gaoxi Tongji Univ Dept Control Sci & Engn Coll Elect & Informat Engn Shanghai 201804 Peoples R China Tongji Univ Inst Advanced Study Shanghai 200092 Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

This paper investigates distributed estimation of an unknown vector parameter in adversarial environments. Individual agents make successive local measurements of the unknown parameter and aim at estimating the unknown parameter consistently by sharing these measurements with their neighbors over a time-varying directed communication graph even when some of the agents are under attacks and their measurements are manipulated arbitrarily. To this end, we design push-sum-based recursive algorithms to estimate the unknown parameter for linear and nonlinear measurement models, respectively. It is demonstrated that the presented algorithms can ensure that the local estimates at all the agents converge to the true value of the parameter under some mild assumptions, such as, B-strong-connectedness of the communication topologies and a topology-independent constraint on the number of compromised measurements. A numerical example is presented to illustrate the effectiveness of the proposed algorithms.

关键词： Estimation Time measurement Particle measurements Atmospheric measurements distributed algorithms Topology Robot sensing systems distributed estimation sensor attacks push-sum linear and nonlinear measurement models

来源：评论

学校读者我要写书评

暂无评论

Chance Constrained distributed Optimisation for Interconnected Power Systems ⁎

引用

IFAC-PapersOnLine 2024年第13期58卷 128-133页

作者： Ineza Remy Mugenga Abebe Geletu Pu Li African Institute of Mathematical Sciences (AIMS) Rwanda P.O. Box: 7150 Kigali Rwanda Group of Process Optimization Institute for Automation and Systems Engineering Technische Universität Ilmenau P.O. Box 100565 98684 Ilmenau Germany

Microgrids have been attracted increasingly attention due to renewable energy integration. Multiple microgrids are often interconnected for benefiting each other. A significant challenge in operating such power systems lies in the uncertainties including intermittence in renewable energy sources and load demands estimation. Sharing state variables in interconnected systems poses additional difficulties. This paper proposes a numerical solution approach to a chance constrained distributed optimisation for interconnected power systems under uncertainty. The inner-outer approximation approach is used for the solution and ALADIN for numerical implementation. An interconnected optimal power flow problem with a three-bus and a four-bus system is solved as a case study.

关键词： Interconnecting microgrids shared state systems distributed algorithms ALADIN chance constraints inner-outer approximation

来源：评论

学校读者我要写书评

暂无评论

distributed approximation for f-matching

引用

THEORETICAL COMPUTER SCIENCE 2024年 1014卷

作者： Czygrinow, Andrzej Hanckowiak, Michal Ruminski, Andrzej Witkowski, Marcin Arizona State Univ Sch Math & Stat Sci Tempe AZ 85287 USA Adam Mickiewicz Univ Fac Math & Comp Sci Poznan Poland

Let G = (V, E) be a graph and let f: V -> Z(+). An f-matching in G is a set of edges F subset of E such that every vertex v is an element of V is incident to at most f(v) edges. In this paper we will give a constan... 详细信息

关键词： distributed algorithms Matching f-matching LOCAL model

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：