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

第35届中国控制与决策会议

作者： Long Huang Bing Liu Li Chai Wuhan University of Science and Technology Zhejiang University

In this paper,we focus on solving the economic dispatch problem(EDP) in the smart grid,which aims to minimize the total generation cost while ensuring the supplydemand coordination and generation capacity ***,we develop a distributed optimization algorithm by employing the gradient tracking *** from most existing works,our proposed algorithm allows the objective function to be strongly convex only in the range of generation capacity constraint rather than in the whole ***,we prove that the convergence rate of the proposed algorithm is O(1/k) with k being the number of iteration and becomes linear rate when the average value of optimization parameters for each agent falls into a closed *** closed interval consists of two endpoints,which are the minimum and the maximum gradients obtained from the cost function of all ***,numerical simulations are given to demonstrate the effectiveness of the proposed algorithm.

关键词： Economic dispatch distributed algorithm gradient tracking method linear convergence

来源：评论

学校读者我要写书评

暂无评论

Random Multiple Access With Hierarchical Users

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第10期20卷 6622-6633页

作者： Heydaryan, Faeze Luo, Jie Colorado State Univ Dept Elect & Comp Engn Ft Collins CO 80523 USA

Classical random access protocols support prioritized user groups by allowing a high priority user to transmit with a relatively high probability. However, when a high priority user competes for the channel with a large number of low priority users, transmission success probability of the high priority user can still diminish to zero. In this paper, a distributed medium access control (MAC) framework is proposed to support hierarchical user groups in a random multiple access system in the following senses. First, when the number of primary users is small, the MAC framework guarantees that channel availability should stay above a pre-determined threshold no matter how many secondary users are competing for the channel. Second, when the number of primary users is large, the MAC framework drives transmission probabilities of the secondary users to zero but does not reject channel access to the primary users. These properties are achieved in a distributed environment without direct message exchange between users, without knowledge on the number of users, and without knowing whether each transmission should belong to a primary or a secondary user. The MAC framework is also extended to systems where each user can be equipped with multiple transmission options.

关键词： Media Access Protocol Receivers Channel coding Wireless sensor networks Wireless networks Transmitters Reliability Random access hierarchical users distributed algorithm wireless network

来源：评论

学校读者我要写书评

暂无评论

Valuation of reactive power support provided by photovoltaic systems in distribution networks

引用

INTERNATIONAL TRANSACTIONS ON ELECTRICAL ENERGY SYSTEMS 2021年第1期31卷 p1-18页

作者： Yousefi, Hadi Gholamian, Seyed Asghar Zakariazadeh, Alireza Babol Noshirvani Univ Technol Dept Elect & Comp Engn Babol Iran Univ Sci & Technol Mazandaran Dept Elect Engn Behshahr Iran

Tariffs for ancillary services like reactive power are a significant tool for raising energy efficiency in the distribution systems. In this paper, a new method for the valuation of reactive power support provided by photovoltaic (PV) systems is proposed. As a valuation approach, it is assumed that the voltage regulation service can be individually provided by other sources like shunt reactors or demand response programs whose service prices have been formerly regulated. The proposed voltage control method is modeled by a network partitioning approach and the distributed algorithm called the alternating direction method of multipliers (ADMMs). Moreover, the uncertain nature of PV generation and load demand is modeled by a stochastic method. The proposed method is tested on a real rural distribution system and 123 bus IEEE distribution test system. The result evidence that the proposed method has a lower computation time compared to the centralized method in addition to having the same accuracy. For distribution companies, also, the proposed method of reactive power valuation will be a basis for pricing reactive power service provided by PVs.

关键词： distributed algorithm photovoltaic system reactive power valuation voltage control

来源：评论

学校读者我要写书评

暂无评论

Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election

引用

JOURNAL OF THE ACM 2021年第1期68卷 1–21页

作者： Gasieniec, Leszek Stachowiak, Grzegorz Univ Liverpool Dept Comp Sci Liverpool Merseyside England Augusta Univ Sch Comp & Cyber Sci Augusta GA 30912 USA Uniwersytet Wroclawski Inst Informatyki Wroclaw Poland

The model of population protocols refers to the growing in popularity theoretical framework suitable for studying pairwise interactions within a large collection of simple indistinguishable entities, frequently called agents. In this article, the emphasis is on the space complexity of fast leader election in population protocols governed by the random scheduler, which uniformly at random selects pairwise interactions between n agents. One of the main results of this article is the first fast space optimal leader election protocol, which works with high probability. The new protocol operates in parallel time O(log(2) n) equivalent to O(n log(2) n) sequential pairwise interactions with each agent's memory space limited to O(log logn) states. This double logarithmic space utilisation matches asymptotically the lower bound 12 log logn on the number of states utilised by agents in any leader election algorithm with the running time o(n/polylog n);see Reference [7]. Our new solution expands also on the classical concept of phase clocks used to synchronise and to coordinate computations in distributed algorithms. In particular, we formalise the concept and provide a rigorous analysis of phase clocks operating in nested modes. Our arguments are also valid for phase clocks propelled by multiple leaders. The combination of the two results in the first time-space efficient leader election algorithm. We also provide a complete formal argumentation, indicating that our solution is always correct, fast, and it works with high probability.

关键词： Population protocols leader election randomised algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots

引用

THEORETICAL COMPUTER SCIENCE 2021年 887卷 111-121页

作者： Molla, Anisur Rahaman Mondal, Kaushik Moses Jr, William K. Moses Indian Stat Inst Comp & Commun Sci Kolkata India Indian Inst Technol Ropar Dept Math Ropar Rupnagar India Technion Israel Inst Technol Fac Ind Engn & Management Haifa Israel

The problem of dispersion of mobile robots on a graph asks that n robots initially placed arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final configuration where each node has at most one robot on it. This problem is of significant interest due to its relationship to other fundamental robot coordination problems, such as exploration, scattering, load balancing, relocation of self-driving electric cars to recharge stations, etc. The robots have unique IDs, typically in the range [1, poly (n)] and limited memory, whereas the graph is anonymous, i.e., the nodes do not have identifiers. The objective is to simultaneously minimize two performance metrics: (i) time to achieve dispersion and (ii) memory requirement at each robot. This problem has been relatively well-studied when robots are non-faulty. In this paper, we introduce the notion of Byzantine faults to this problem, i.e., we formalize the problem of dispersion in the presence of up to f Byzantine robots. We then study the problem on a ring while simultaneously optimizing the time complexity of algorithms and the memory requirement per robot. Specifically, we design deterministic algorithms that attempt to match the time lower bound (Omega(n) rounds) and memory lower bound (Omega(logn) bits per robot). Our main result is a deterministic algorithm that is both time and memory optimal, i.e., O(n) rounds and O(log n) bits of memory required per robot, subject to certain constraints. We subsequently provide results that require less assumptions but are either only time or memory optimal but not both. We also provide a primitive, utilized often, that takes robots initially gathered at a node of the ring and disperses them in a time and memory optimal manner without additional assumptions required. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Dispersion Mobile robots distributed algorithm Byzantine faults Faulty robots Rings

来源：评论

学校读者我要写书评

暂无评论

Real-Time Power Regulation of Flexible User-Side Resources in Distribution Networks via Dual Ascent Method

引用

ENERGIES 2024年第19期17卷 4890-4890页

作者： Yang, Yu Wen, Fushuan Yang, Jiajia Liu, Hangyue Liu, Dazheng Xin, Shujun Fan, Hao Wu, Cong Zhejiang Univ Coll Elect Engn Hangzhou 310027 Peoples R China James Cook Univ Coll Sci & Engn Townsville 4811 Australia Sungrow Australia Grp Pty Ltd Sydney 2060 Australia China Energy Econ & Technol Res Inst Co Ltd Beijing 102299 Peoples R China State Grid Corp China Beijing 100031 Peoples R China State Grid Energy Res Inst China Beijing 102209 Peoples R China

Flexible user-side resources are of great potential in providing power regulation so as to effectively address the challenges of reverse power flow and overvoltage issues in distribution networks characterized by high photovoltaic (PV) penetration. However, existing distributed algorithms typically implement control signals after the convergence of the algorithms, making it difficult to track frequent and rapid fluctuations in PV power outputs in real time. Given this background, an online-distributed control algorithm for the real-time power regulation of flexible user-side resources is proposed in this paper. The objective of the established control model is to minimize network losses by dynamically adjusting active power outputs of flexible user-side resources and reactive power outputs of PV inverters while respecting branch power flow and voltage magnitude constraints. Furthermore, by deconstructing the centralized problem into a primal-dual one, a distributed control strategy based on the dual ascent method is implemented. With the proposed method, agents can achieve global optimality by exchanging limited information with their neighbors. The simulation results verify the good balance between economic efficiency and voltage control performance of the proposed method.

关键词： power regulation voltage control flexible user-side resource distributed algorithm dual ascent method

来源：评论

学校读者我要写书评

暂无评论

distributed Diagnosis of Sensor and Actuator Faults in Air Handling Units in Multi-Zone Buildings: A Model-Based Approach

引用

ENERGY AND BUILDINGS 2022年第0期256卷 111709-111709页

作者： Papadopoulos, Panayiotis M. Lymperopoulos, Georgios Polycarpou, Marios M. Ioannou, Petros Univ Cyprus KIOS Res & Innovat Ctr Excellence Dept Elect & Comp Engn CY-1678 Nicosia Cyprus Univ Southern Calif Dept Elect Engn 3740 McClintock Ave Los Angeles CA 90089 USA

The presence of sensing and actuating equipment faults in Heating, Ventilation and Air-Conditioning (HVAC) systems may result in unsatisfactory indoor thermal conditions and significant wasted energy in the building sector. The design of fault diagnosis algorithms for multi-zone buildings is a highly challenging procedure due to the overall complexity of the system. This paper proposes a distributed model based fault diagnosis algorithm for detecting, isolating and identifying faults that can affect the actuating devices of Air Handling Units (AHUs) and the sensor devices. Based on modeling the temperature dynamics of each local AHU and its underlying zone with respect to its neighboring zones, a local fault diagnosis agent that collects local control signals and local and neighboring sensor measurements is designed. Each local diagnosis agent is designed to estimate on-line the states of each AHU. For each estimation, a residual signal is derived that corresponds to the difference between the measured and estimated value at each time step. Considering healthy conditions, the residual is bounded by its corresponding adaptive threshold that is calculated considering the effects of modeling uncertainties. Each corresponding pair of residual and adaptive threshold forms an analytical redundancy relation which indicates the possible presence of one or more faults. Exploiting the dependency of each actuator and sensor fault with each Analytical Redundancy Relation (ARR), a decision logic is designed, that can reveal under certain conditions the location and type of the fault during the operation of the system. The proposed algorithm is evaluated using a simulation example of a primary school building with 25 zones. (c) 2021 Elsevier B.V. All rights reserved.

关键词： Fault diagnosis distributed algorithm Building automation HVAC system Air handling unit

来源：评论

学校读者我要写书评

暂无评论

Energy and cost trade-off for computational tasks offloading in mobile multi-tenant clouds

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2021年第3期24卷 1793-1824页

作者： Patel, Yashwant Singh Reddy, Manoj Misra, Rajiv Indian Inst Technol Patna Dept Comp Sci & Engn Patna 801106 Bihar India

Mobile cloud computing augments smart-phones with computation capabilities by offloading computations to the cloud. Recent works only consider the energy savings of mobile devices while neglecting the cost incurred to the tasks which are offloaded. We might offload several tasks to minimize the total energy consumption of mobile devices;however, this could incur a huge monetary cost. Furthermore, these issues become more complex in considering the multi-tenant cloud, which is not addressed in literature adequately. Thus, to balance the trade-off between monetary cost and energy consumption of the mobile devices, we need to decide whether to offload the task to the cloud or run it locally. In this article, first, we have formulated a 'MinEMC' optimization problem to minimize both the energy as well as the monetary cost of the mobile devices. The 'MinEMC' problem is proven to be NP-hard. We formulate a special case with an equal amount of resource requirement by each task for which a polynomial-time solution is presented. Further various policies are proposed, the cloud can employ to solve the general case. Then we proposed an efficient heuristic named 'Off-Mat' based on distributed stable matching, the solution for which determines whether the tasks are to be offloaded or not under multi-constraints. We also analyze the complexity of this proposed heuristic algorithm. Finally, performance evaluation through simulation results demonstrates that the Off-Mat algorithm attains high-performance in computational tasks offloading and scale well as the number of tenants increases.

关键词： Computation offloading distributed algorithm Stable matching Mobile cloud computing Multi-tenancy

来源：评论

学校读者我要写书评

暂无评论

Exploration of dynamic networks: Tight bounds on the number of agents

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2021年 122卷 1-18页

作者： Gotoh, Tsuyoshi Flocchini, Paola Masuzawa, Toshimitsu Santoro, Nicola Osaka Univ Suita Osaka Japan Univ Ottawa Ottawa ON Canada Carleton Univ Ottawa ON Canada

We consider, for the first time, the exploration of dynamic graphs of arbitrary unknown topology. We study the number of agents necessary and sufficient to explore such graphs under the fully synchronous (FSYNC) and the semi-synchronous (SSYNC) activation schedulers. We prove that, under the minimal assumption on the dynamics, temporal connectivity, the number of agents sufficient to perform exploration depends on a parameter we call evanescence of the graph, and this number is tight. We then consider the stronger well-known assumption of 1-interval connectivity when the number of edges missing at each time is bounded. We provide tight bounds also in this setting, proving the existence of a difference between FSYNC and SSYNC, as well as between anonymous and non-anonymous agents. (C) 2021 Published by Elsevier Inc.

关键词： distributed algorithm Mobile agents Exploration of dynamic networks Arbitrary footprint

来源：评论

学校读者我要写书评

暂无评论

distributed lifetime optimization in wireless sensor networks using alternating direction method of multipliers

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2020年第3期33卷 e4203-e4203页

作者： Tashtarian, Farzad Montazerolghaem, Ahmadreza Varasteh, Amir Islamic Azad Univ Mashhad Branch Dept Comp Engn Mashhad Razavi Khorasan Iran Quchan Univ Technol Dept Comp Engn Quchan Iran Tech Univ Munich Dept Elect & Comp Engn Munich Germany

Due to the limited energy of sensor nodes in wireless sensor networks, extending the network lifetime is a major challenge that can be formulated as an optimization problem. In this paper, we propose a distributed iterative algorithm based on alternating direction method of multipliers with the aim of maximizing sensor network lifetime. The features of this algorithm are the use of local information, low overhead of message passing, low computational complexity, fast convergence, and, consequently, reduced energy consumption. In this study, we present the convergence results and the number of iterations required to achieve the stopping criterion. Furthermore, the impact of problem size (number of sensor nodes) on the solution and constraints violation is studied, and, finally, the proposed algorithm is compared with one of the well-known subgradient-based algorithms.

关键词： ADMM alternating direction method of multipliers distributed algorithm lifetime wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：