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

Multi-game optimization operation strategy for integrated energy system considering spatiotemporal correlation of renewable energy

引用

ENERGY 2024年 303卷

作者： Xu, Xun Shao, Zhenguo Chen, Feixiong Cheng, Guoyang Fuzhou Univ Coll Elect Engn & Automat Key Lab Energy Digitalizat Fuzhou 350108 Peoples R China

With the increasing diversity of market entities in the integrated energy system (IES), the interests of multiple entities become complex and variable, leading to disorganized competition among entities in the trading market. Therefore, this paper presents an optimal operation strategy for IES employing a multi-game with tri-level transactions. Firstly, a tri-level IES framework is established with the energy production provider alliance, energy sales agent, and energy user agents as the main entities. Secondly, to handle the uncertainty of renewable energy, a MD-K2 dynamic bayesian network method describing the spatiotemporal correlation of wind and photovoltaic is proposed, and generates probabilistic scenarios. Then, a tri-level multi-game optimization operation model is constructed considering multi-dimensional transactions and demand responses, and is proved to achieve the game equilibrium. Finally, the tri-level model is converted into bi-level mixed-integer linear programming (BMILP) problem, which is solved by a bisection-based distributed iterative algorithm. The simulation results indicate that the optimization strategy improves the interests of tri-level entities and promotes fair distribution of cooperative benefits among alliance members.

关键词： Integrated energy system Multi-game Dynamic bayesian network distributed algorithm Game equilibrium

来源：评论

学校读者我要写书评

暂无评论

distributed Data-Driven Power Iteration for Strongly Connected Networks

Distributed Data-Driven Power Iteration for Strongly Connect...

引用

European Control Conference (ECC)

作者： Gusrialdi, Azwirman Qu, Zhihua Tampere Univ Fac Engn & Nat Sci Tampere 33014 Finland Univ Cent Florida Dept Elect & Comp Engn Orlando FL 32816 USA

ISBN: (纸本)9789463842365

This paper presents data-driven power iteration to distributively estimate the dominant eigenvalues of an unknown linear time-invariant system. The proposed strategy only requires a single trajectory data or measurements. Furthermore, in order to perform the distributed estimation, the communication network topology can be chosen to be any strongly connected directed graphs. The proposed data-driven power iteration is demonstrated using several numerical examples and is then applied to estimate the generalized algebraic connectivity of cooperative systems and to control the epidemic spreading.

关键词： Eigenvalue estimation distributed algorithm data-driven power iteration strongly connected network

来源：评论

学校读者我要写书评

暂无评论

Optimal robust collaborative management of multiple EHs in power systems by utilizing the game theory

引用

ELECTRIC POWER SYSTEMS RESEARCH 2024年 231卷

作者： Ghobadi, Kasra Khan, Ashraf Ali Mem Univ Newfoundland Dept Elect Engn 240 Prince Phillip Dr40 Arctic Ave St John NF A1E 3X7 Canada

The emergence of energy hubs as integrated energy systems has been a recent development that has the potential to shape the future of the global energy landscape. This article delves into the issue of collaborative economic planning for multiple interconnected energy systems by utilizing the energy hub. In contrast to the conventional non-collaborative methodology of independent operation of each energy hub, the present approach entails the formation of an interdependent community of energy hubs that facilitates the exchange of energy resources. The issue of coordinated management, taking into account the autonomy and individual interests of distinct energy hubs, is conceptualized as a collaborative bargaining game. In this game, the energy hubs involved engage in negotiations with one another regarding the exchange of energy and the associated costs. The collaborative system's bargaining response is determined through the implementation of a distributed optimization approach. This is performed to ensure that the energy hubs' scheduling autonomy and confidentiality of information are maintained. The modeling of uncertainties in forecasting the output power of renewable energy resources and electric demand is a well-known challenge. This study employs the information gap decision-making theory to handle this challenge. Specifically, the study presents a robust bargaining game theory algorithm for energy hubs' optimum and robust operation. The simulation outcomes have ultimately verified the efficacy of the energy hub's collaborative economic planning algorithm that relies on bargaining for energy management, even in uncertainty.

关键词： Energy management Energy hubs Uncertainty Bargaining game theory distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Detecting causality in the presence of Byzantine processes: The case of synchronous systems

引用

INFORMATION AND COMPUTATION 2024年 301卷

作者： Misra, Anshuman Kshemkalyani, Ajay D. Univ Illinois Dept Comp Sci Chicago IL 60607 USA

Detecting causality or the "happens before" relation between events in a distributed system is a fundamental building block for distributed applications. It was recently proved that this problem cannot be solved in an asynchronous distributed system in the presence of Byzantine processes, irrespective of whether the communication mechanism is via unicasts, multicasts, or broadcasts. In light of this impossibility result, we turn attention to synchronous systems and examine the possibility of solving the causality detection problem in such systems. In this paper, we prove that causality detection between events can be solved in the presence of Byzantine processes in a synchronous distributed system. We prove the result by providing two algorithms. The first algorithm uses the Replicated State Machine (RSM) approach and vector clocks. The second algorithm is round-based and uses matrix clocks. The RSM-based algorithm can also run deterministically in partially synchronous systems. (c) 2024 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC license (http://creativecommons .org /licenses /by-nc /4 .0/).

关键词： Byzantine fault-tolerance Causality "Happened before" relation Synchronous system distributed algorithm Synchronization Message-passing

来源：评论

学校读者我要写书评

暂无评论

MapReduce algorithms for robust center-based clustering in doubling metrics

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2024年 194卷

作者： Dandolo, Enrico Mazzetto, Alessio Pietracaprina, Andrea Pucci, Geppino Univ Padua Dept Informat Engn Padova I-35131 Padua Italy Brown Univ Dept Comp Sci Providence RI 02912 USA

Clustering is a pivotal primitive for unsupervised learning and data analysis. A popular variant is the (k, t degrees)- clustering problem, where, given a pointset P from a metric space, one must determine a subset S of k centers minimizing the sum of the t degrees-th powers of the distances of points in P from their closest centers. This formulation covers the well-studied k-median (t degrees t degrees = 1 ) and k-means (t degrees t degrees = 2 ) clustering problems. A more general variant, introduced to deal with noisy pointsets, features a further parameter z and allows up to z points of P (outliers) to be disregarded when computing the sum. We present a distributed coreset-based 3-round approximation algorithm for the (k, t degrees)-clustering problem with z outliers, using MapReduce as a computational model. An important feature of our algorithm is that it obliviously adapts to the intrinsic complexity of the dataset, captured by its doubling dimension D . Remarkably, for D = O (1), , our algorithm requires sublinear local memory per reducer, and yields a solution whose approximation ratio is an additive term O(y) away from the one achievable by the best known sequential (possibly bicriteria) algorithm, where y can be made arbitrarily small. To the best of our knowledge, no previous distributed approaches were able to attain similar quality-performance tradeoffs for metrics with constant doubling dimension.

关键词： Clustering k-means k-median Outliers MapReduce Coreset distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Arbitrary pattern formation on a continuous circle by oblivious robot swarm

引用

THEORETICAL COMPUTER SCIENCE 2024年 1021卷

作者： Mondal, Brati Goswami, Pritam Sharma, Avisek Sau, Buddhadeb Jadavpur Univ Kolkata India

In the field of distributed systems, the Arbitrary Pattern Formation (APF) problem is an extensively studied problem. The purpose of APF is to design an algorithm to move a swarm of robots to a particular position in an environment (discrete or continuous) such that the swarm can form a specific but arbitrary pattern given previously to every robot as an input. In this paper, the solvability of the APF problem on a continuous circle is discussed for a swarm of oblivious and silent robots without chirality under a semi-synchronous scheduler. Firstly a class of configurations (the initial placements of the robots on the circle) called Formable Configuration (FC) FC ) has been provided which is necessary to solve the APF problem on a continuous circle. Then considering the initial configuration to be an FC , a deterministic and distributed algorithm has been provided that solves the APF problem for n robots on a continuous circle of fixed radius within O ( n ) epochs without collision, where an epoch is considered to be a time interval in which all robots are activated at least once.

关键词： APF Continuous circle Oblivious Mobile robots distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Independent Sets in Interval and Segment Intersection Graphs 47th

Distributed Independent Sets in Interval and Segment Interse...

引用

47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)

作者： 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 Gujrat India

ISBN: (纸本)9783030677305;9783030677312

The Maximal Independent Set problem is a well-studied problem in the distributed community. We study Maximum and Maximal Independent Set problems on two geometric intersection graphs;interval graphs and axis-parallel segment intersection graphs, and present deterministic distributed algorithms in the local communication model. We compute the maximum independent set on interval graphs in O(k) rounds and O(n) messages, where k is the size of the maximum independent set and n is the number of nodes in the graph. We provide a matching lower bound of O(k) on the number of rounds whereas O(n) is a trivial lower bound on message complexity. Thus our algorithm is both time and message optimal. We also study the maximal independent set problem in bi-interval graphs, a special case of the interval graphs where the intervals have two different lengths. We prove that a maximal independent set can be computed in bi-interval graphs in constant rounds that is 1 6 -approximation. For axis-parallel segment intersection graphs, we design an algorithm that finds a maximal independent set in O(D) rounds, where D is the diameter of the graph. We further show that this independent set is a 1 2 -approximation. The results in this paper extend the results of Molla et al. [J. Parallel Distrib. Comput. 2019].

关键词： Maximal Independent Set Interval graph Segment intersection graph distributed algorithm Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Stochastic Phase-Shift Optimization in a RIS-Assisted Cellular Network

Distributed Stochastic Phase-Shift Optimization in a RIS-Ass...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Mhanna, Elissa Assaad, Mohamad Debbah, Merouane Destounis, Apostolos Kamoun, Mohamed Cent Supelec Lab Signaux & Syst L2S F-91192 Gif Sur Yvette France Huawei Technol France Math & Algorithm Sci Lab Paris Res Ctr F-92100 Boulogne France

ISBN: (纸本)9781728195056

Reconfigurable intelligent surfaces (RIS) technology, as the name implies, is a grid of many small intelligent surfaces that can be reconfigured. It is a new and promising concept in wireless communications, expected to help realize the requirements of the future cellular generations. Numerous studies have been done to prove its added advantages and to control these surfaces in beneficial ways. However, these control schemes come with difficulties related to efficient and practical implementation. In this paper, we propose to control multiple RISs in a multi-user scheme with an algorithm that leads to a simple implementation. We formulate a stochastic optimization problem and we propose a new method using a distributed stochastic algorithm that allows the optimization to be done locally at each RIS with low computational requirements and without the need for instantaneous channel knowledge at the RIS. Also, the signaling between the base station (BS) and each RIS is limited to the exchange of a scalar only. Simulation results prove the success and efficiency of this algorithm.

关键词： Reconfigurable Intelligent Surface Stochastic Optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

High-precision Time Synchronization algorithm for Unmanned Aerial Vehicle Ad Hoc Networks based on Bidirectional Pseudo-range Measurements

引用

AD HOC NETWORKS 2024年 152卷

作者： Bai, Kaiyuan Wu, Jianfeng Wu, Huabing Chinese Acad Sci Natl Time Serv Ctr Xian 710600 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China

The increasing demand for missions involving unmanned aerial vehicles (UAVs) raises the need for reliable and accurate time synchronization in ad hoc networks. Time synchronization plays a crucial role in coordinating the actions of multiple UAVs, particularly when it comes to positioning, coordination, and data fusion. However, achieving high-precision time synchronization is challenging due to the difficult-to-estimate communication transmission delay, measurement noise, relative motion, and clock source characteristics in wireless ad hoc networks formed by UAVs. To address this issue, this paper proposes a fully distributed high-precision network time synchronization algorithm that is suitable for multi-hop dynamic ad hoc networks. The proposed algorithm is based on bidirectional pseudo-range measurements, graph theory, and random matrix correlation theory. It is composed of relative clock skew estimation, logic clock skew compensation and logic clock offset compensation. The algorithm is rigorously derived, requiring no central node, and it is capable of obtaining relative clock skew even when nodes broadcast clock information asynchronously. In addition, the proposed algorithm enables realtime elimination of transmission delays and has noise-resistant capabilities. Simulation results validate the effectiveness of the algorithm, demonstrating that the time synchronization accuracy in UAV ad hoc networks can reach the sub-nanosecond level.

关键词： time synchronization sub-nanosecond accuracy wireless ad hoc networks distributed algorithm multi-hop dynamic networks transmission delay elimination

来源：评论

学校读者我要写书评

暂无评论

Cooperation of Mobile Devices for Fast Inference of Deep Learning Applications

引用

MOBILE NETWORKS & APPLICATIONS 2021年第3期26卷 1243-1249页

作者： Yang, Qinglin Luo, Xiaofei Li, Peng Miyazaki, Toshiaki Shen, Wenfeng Tong, Weiqin Univ Aizu Sch Comp Sci & Engn Aizu Wakamatsu Fukushima Japan Shanghai Univ Shanghai Inst Adv Commun & Data Sci Shanghai Peoples R China

Deep learning stimulates many novel mobile applications, but it is still challenging to enable efficient mobile deep learning applications. Traditional approach tackles this challenge by offloading computation tasks to cloud, which has weaknesses of high bandwidth requirements and long transmission latency. In this paper, we propose to enable collaborative inference among mobile devices. Instead of sending deep learning inference tasks to cloud, we let mobile devices collaboratively share the computation workloads. This is based on an important observation that batching inference tasks on GPUs can accelerate the inference processing speed. To achieve efficient collaboration, we design an algorithm based on partial swarm optimization (PSO) that is a versatile population-based stochastic optimization technique. We also design a distributed algorithm to address the challenge that is difficult to collect global network information and run the centralized algorithm. Moreover, extensive simulations are conducted to evaluate the performance of the designed algorithm. The simulation results show that the collaborative inference scheme can effectively reduce inference time of mobile deep learning applications.

关键词： Deep learning Mobile computing Inference distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：