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

Robust distributed Fixed-Time Economic Dispatch Under Time-Varying Topology

IEEE CONTROL SYSTEMS LETTERS 2021年第4期5卷 1183-1188页

作者： Baranwal, Mayank Garg, Kunal Panagou, Dimitra Hero, Alfred O. Tata Consultancy Serv Div Data & Decis Sci Mumbai 400607 Maharashtra India Univ Michigan Dept Aerosp Engn Ann Arbor MI 48109 USA Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

The centralized power generation infrastructure that defines the North American electric grid is slowly moving to the distributed architecture due to the explosion in use of renewable generation and distributed energy resources (DERs), such as residential solar, wind turbines and battery storage. Furthermore, variable pricing policies and profusion of flexible loads entail frequent and severe changes in power outputs required from the individual generation units, requiring fast availability of power allocation. To this end, a fixed-time convergent, fully distributed economic dispatch algorithm for scheduling optimal power generation among a set of DERs is proposed. The proposed algorithm incorporates both load balance and generation capacity constraints.

关键词： Generators Convergence Topology Heuristic algorithms Power system stability Robustness Power generation distributed algorithms nonlinear control systems optimization power generation dispatch

来源：评论

学校读者我要写书评

暂无评论

An accelerated distributed method with inexact model of relative smoothness and strong convexity

引用

IET SIGNAL PROCESSING 2023年第4期17卷

作者： Zhang, Xuexue Liu, Sanyang Zhao, Nannan Xidian Univ Sch Math & Stat Xian Peoples R China Changan Univ Sch Sci Xian Peoples R China

distributed optimisation methods are widely applied in many systems where agents cooperate with each other to minimise a sum-type problem over a connected network. An accelerated distributed method based on the inexact model of relative smoothness and strong convexity is introduced by the authors. The authors demonstrate that the proposed method can converge to the optimal solution at the linear rate 1(1+1/(4 root kappa g))2 and achieve the optimal gradient computation complexity and the near optimal communication complexity, where kappa(g) denotes the global condition number. Finally, the numerical experiments are provided to validate the theoretical results and further show the efficacy of the proposed method.

关键词： communication complexity computational complexity convergence distributed algorithms distributed control

来源：评论

学校读者我要写书评

暂无评论

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots 37

Fast Deterministic Gathering with Detection on Arbitrary Gra...

引用

37th IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Molla, Anisur Rahaman Mondal, Kaushik Moses, William K., Jr. Indian Stat Inst Comp & Commun Sci Kolkata India Indian Inst Technol Ropar Dept Math Ropar India Univ Durham Dept Comp Sci Durham England

ISBN: (纸本)9798350337662

Over the years, much research involving mobile computational entities has been performed. From modeling actual microscopic (and smaller) robots, to modeling software processes on a network, many important problems have been studied in this context. Gathering is one such fundamental problem in this area. The problem of gathering k robots, initially arbitrarily placed on the nodes of an n-node graph, asks that these robots coordinate and communicate in a local manner, as opposed to global, to move around the graph, find each other, and settle down on a single node as fast as possible. A more difficult problem to solve is gathering with detection, where once the robots gather, they must subsequently realize that gathering has occurred and then terminate. In this paper, we propose a deterministic approach to solve gathering with detection for any arbitrary connected graph that is faster than existing deterministic solutions for even just gathering (without the requirement of detection) for arbitrary graphs. In contrast to earlier work on gathering, it leverages the fact that there are more robots present in the system to achieve gathering with detection faster than those previous papers that focused on just gathering. The state of the art solution for deterministic gathering [Ta-Shma and Zwick, TALG, 2014] takes O-similar to (n(5) log l) rounds, where l is the smallest label among robots and O-similar to hides a polylog factor. We design a deterministic algorithm for gathering with detection with the following trade-offs depending on how many robots are present: (i) when k = >= n/2 + 1, the algorithm takes O(n(3)) rounds, (ii) when k >= [n/3] + 1, the algorithm takes O(n(4) log n) rounds, and (iii) otherwise, the algorithm takes O-similar to (n(5)) rounds. The algorithm is not required to know k, but only n.

关键词： Gathering Mobile agents Mobile robots distributed algorithms Arbitrary graphs

来源：评论

学校读者我要写书评

暂无评论

A distributed Dual Proximal Minimization Algorithm for Constraint-Coupled Optimization Problems

引用

IEEE CONTROL SYSTEMS LETTERS 2021年第1期5卷 259-264页

作者： Falsone, Alessandro Prandini, Maria Politecn Milan Dipartimento Elettron Informaz & Bioingn I-20133 Milan Italy

We address constraint-coupled optimization for a system composed of multiple cooperative agents communicating over a time-varying network. We propose a distributed proximal minimization algorithm that is guaranteed to converge to an optimal solution of the optimization problem, under suitable convexity and connectivity assumptions. The performance of the introduced algorithm is shown on a numerical example of a charging scheduling problem for a fleet of plug-in electric vehicles.

关键词： Couplings Convergence Cost function Minimization Communication networks distributed algorithms Optimization algorithms distributed control agents-based systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Synchronization of CRDTs using VCube-PS 23

Efficient Synchronization of CRDTs using VCube-PS

引用

12th Latin-American Symposium on Dependable and Secure Computing (LADC)

作者： Galesky, Leonardo de Freitas Rodrigues, Luiz Antonio Duarte, Elias Procopio, Jr. Arantes, Luciana Western Parana State Univ UNIOESTE Cascavel Parana Brazil Fed Univ Parana UFPR Curitiba Parana Brazil Sorbonne Univ LIP6 CNRS Paris France

ISBN: (纸本)9798400708442

This work presents VCube-Sync, a distributed datastore that uses the VCube virtual topology to maintain Conflict-free Replicated Data Types (CRDT). CRDT can ensure consistency in a deterministic and conflict-free manner. The VCube has been previously used to implement multiple distributed systems abstractions, due to its properties, in particular fault tolerance and logarithmic latency. The VCube-Sync protocol presented in the present work is based on VCube-PS, a publish-subscribe system based on VCube. VCube-Sync exploits the synergy between VCube-PS and replication systems. Evaluation experiments with VCube-Sync in the context of operations-based CRDTs were performed on the Grid5000 testbed under various loads and network distributions. The experiments include comparisons with EcoSyncTree, another replication protocol recently proposed. The results show that VCube-Sync offers superior performance in terms of latency, scalability, and bandwidth.

关键词： Conflict-Free Replication Data Types vCube replication distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Exact Fault-Tolerant Consensus with Voting Validity 37

Exact Fault-Tolerant Consensus with Voting Validity

引用

37th IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Xu, Zhangchen Li, Yuetai Feng, Chenglin Zhang, Lei Univ Washington Dept Elect & Comp Engn Seattle WA 98195 USA Univ Glasgow James Watt Sch Engn Glasgow Lanark Scotland

ISBN: (纸本)9798350337662

This paper investigates the multi-valued fault-tolerant distributed consensus problem that pursues exact output. To this end, the voting validity, which requires the consensus output of non-faulty nodes to be the exact plurality of the input of non-faulty nodes, is investigated. Considering a specific distribution of nonfaulty votes, we first give the impossibility results and a tight lower bound of system tolerance achieving agreement, termination and voting validity. A practical consensus algorithm that satisfies voting validity in the Byzantine fault model is proposed subsequently. To ensure the exactness of outputs in any non-faulty vote distribution, we further propose safety-critical tolerance and a corresponding protocol that prioritizes voting validity over termination property. To refine the proposed protocols, we propose an incremental threshold algorithm that accelerates protocol operation speed. We also optimize consensus algorithms with the local broadcast model to enhance the protocol's fault tolerance ability.

关键词： Fault Tolerance distributed algorithms Impossibility Results Voting Exact Consensus

来源：评论

学校读者我要写书评

暂无评论

distributed EXACT WEIGHTED ALL-PAIRS SHORTEST PATHS IN RANDOMIZED NEAR-LINEAR TIME

引用

SIAM JOURNAL ON COMPUTING 2023年第2期52卷 STOC19-112-STOC19-127页

作者： Bernstein, Aaron Nanongkai, Danupon Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA KTH Royal Inst Technol Theoret Comp Sci S-10044 Stockholm Sweden

In the distributed all-pairs shortest paths problem, every node in the weighted undirected distributed network (the CONGEST model) needs to know the distance from every other node using least number of communication rounds (typically called time complexity). The problem admits a (1+ o(1))-approximation (Theta) over tilde (n)-time algorithm and a nearly tight (Omega) over tilde (n) lower bound [D. Nanongkai, STOC'14, ACM, New York, 2014, pp. 565-573;C. Lenzen and B. Patt-Shamir, PODC'15, ACM, New York, 2015, pp. 153-162]. ((Theta) over tilde, (O) over tilde and (Omega) over tilde hide polylogarithmic factors. Note that the lower bounds also hold even in the unweighted case and in the weighted case with polynomial approximation ratios (C. Lenzen and D. Peleg, PODC, ACM, New York, 2013, pp. 375--382;S. Holzer and R. Wattenofer, PODC, ACM, New York, 2012, pp. 355-364;D. Peleg, L. Roditty, and E. Tal, ICALP, Springer, Berlin, 2012, pp. 660-672;D. Nanongkai, STOC, ACM, New York, 2014, pp. 565-573-672). For the exact case, Elkin [STOC'17, ACM, New York, 2017, pp. 757-790] presented an O(n(5/3) log(2/3) n) time bound, which was later improved to (O) over tilde (n(5/4)) [C.-C. Huang, D. Nanongkai, T. Saranurak, FOCS'17, IEEE Computer Society, Los Alamitos, CA, 2017, pp. 168-179]. It was shown that any superlinear lower bound (in n) requires a new technique [K. Censor-Hillel, S. Khoury, A. Paz, DISC'17, LIPIcs Leibniz Int. Proc. Inform., Vol. 91, Schloss-Dagstuhl, Wadern, Germany, 2017, 10], but otherwise it remained widely open whether there exists a (O) over tilde (n)-time algorithm for the exact case, which would match the best possible approximation algorithm. This paper resolves this question positively: we present a randomized (Las Vegas) (O) over tilde (n)-time algorithm, matching the lower bound up to polylogarithmic factors. Like the previous (O) over tilde (n(5/4)) bound, our result works for directed graphs with zero (and even negative) edge weights. In addition to

关键词： distributed algorithms CONGEST all-pairs shortest paths graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Improved Consensus in Quantum Networks 23

Brief Announcement: Improved Consensus in Quantum Networks

引用

42nd ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Hajiaghayi, MohammadTaghi Kowalski, Dariusz R. Olkowski, Jan Univ Maryland College Pk MD 20742 USA Augusta Univ Augusta GA USA

ISBN: (纸本)9798400701214

Fault-tolerant consensus is about reaching agreement on some of the input values in a limited time by non-faulty autonomous processes, despite of failures of processes or communication medium. This problem is particularly challenging and costly against an adaptive adversary with full information. Bar-Joseph and Ben-Or [7] (PODC'98) were the first who proved an absolute lower bound Omega(root n/log n) on expected time complexity of consensus in any classic (i.e., randomized or deterministic) message-passing network with n processes succeeding with probability 1 against such a strong adaptive adversary crashing processes. Seminal work of Ben-Or and Hassidim [8] (STOC'05) broke the Omega(root n/log n) barrier for consensus in classic (deterministic and randomized) networks by employing quantum computing. They showed an (expected) constant-time quantum algorithm for a linear number of crashes t < n/3. In this paper, we improve upon that seminalwork by reducing the number of quantum and communication bits to an arbitrarily small polynomial, and even more, to a polylogarithmic number - though, the latter in the cost of a slightly larger polylogarithmic time (still exponentially smaller than the time lower bound Omega(root n/log n)) for classic computation).

关键词： distributed algorithms quantum algorithms adaptive adversary crash failures Consensus quantum common coin approximate counting

来源：评论

学校读者我要写书评

暂无评论

Boundary Sketching with Asymptotically Optimal Distance and Rotation 30th

Boundary Sketching with Asymptotically Optimal Distance and ...

引用

30th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Dani, Varsha Islam, Abir Saia, Jared Rochester Inst Technol Rochester NY 14623 USA Univ New Mexico Albuquerque NM 87131 USA

ISBN: (纸本)9783031327322;9783031327339

We address the problem of designing a distributed algorithm for two robots that sketches the boundary of an unknown shape. Critically, we assume a certain amount of delay in how quickly our robots can react to external feedback. In particular, when a robot moves, it commits to move along path of length at least lambda, or turn an amount of radians at least lambda for some positive lambda <= 1/2(6), that is normalized based on a unit diameter shape. Then, our algorithm outputs a polygon that is an epsilon-sketch, for epsilon = 8 root lambda, in the sense that every point on the shape boundary is within distance epsilon of the output polygon. Moreover, our costs are asymptotically optimal in two key criteria for the robots: total distance travelled and total amount of rotation. Additionally, we implement our algorithm, and illustrate its output on some specific shapes.

关键词： Boundary Sketch Robotics Drones distributed algorithms Euclidean Plane

来源：评论

学校读者我要写书评

暂无评论

A survey on distributed online optimization and online games

引用

ANNUAL REVIEWS IN CONTROL 2023年第1期56卷

作者： Li, Xiuxian Xie, Lihua Li, Na Tongji Univ Coll Elect & Informat Engn Dept Control Sci & Engn Shanghai Peoples R China Tongji Univ Shanghai Res Inst Intelligent Autonomous Syst Shanghai Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn 50 Nanyang Ave Singapore 639798 Singapore Harvard Univ John A Paulson Sch Engn & Appl Sci Cambridge MA 02138 USA 16 Bldg 55 Chuanhe Rd Shanghai 201210 Peoples R China

distributed online optimization and online games have been increasingly researched in the last decade, mostly motivated by their wide applications in sensor networks, robotics (e.g., distributed target tracking and formation control), smart grids, deep learning, and so forth. In these problems, there is a network of agents which interact with each other in a collaborative manner (i.e., distributed online optimization) or noncooperative manner (i.e., online games) through local information exchanges. And the local cost function of each agent is time-varying in dynamic and adversarial environments. At each time, a decision must be made by each agent based on historical information at hand without knowing its future cost functions. For these problems, a comprehensive survey is still lacking. This paper aims to provide a thorough overview of distributed online optimization and online games from the perspective of problem settings, algorithms, communication and computation requirements, and performances. In addition, some potential future directions are also discussed.

关键词： distributed algorithms Autonomous agents Online optimization Online games Multi-agent networks Regret

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：