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

Dynamic Power Distribution System Management With a Locally Connected Communication Network

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2018年第4期12卷 673-687页

作者： Zhang, Kaiqing Shi, Wei Zhu, Hao Dall'Anese, Emiliano Basar, Tamer Univ Illinois Coordinated Sci Lab Champaign IL 61820 USA Arizona State Univ Tempe AZ 85281 USA Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA Natl Renewable Energy Lab Golden CO 80401 USA

Coordinated optimization and control of distribution-level assets enables a reliable and optimal integration of massive amount of distributed energy resources (DERs) and facilitates distribution system management (DSM). Accordingly, the objective is to coordinate the power injection at the DERs to maintain certain quantities across the network, e.g., voltage magnitude, line flows, and line losses, to be close to a desired profile. By and large, the performance of the DSM algorithms has been challenged by two factors: 1) the possibly nonstrongly connected communication network over DERs that hinders the coordination;and 2) the dynamics of the real system caused by the DERs with heterogeneous capabilities, time-varying operating conditions, and real-time measurement mismatches. In this paper, we investigate the modeling and algorithm design and analysis with the consideration of these two factors. In particular, a game-theoretic characterization is first proposed to account for a locally connected communication network over DERs, along with the analysis of the existence and uniqueness of the Nash equilibrium therein. To achieve the equilibrium in a distributed fashion, a projected-gradient-based asynchronous DSM algorithm is then advocated. The algorithm performance, including the convergence speed and the tracking error, is analytically guaranteed under the dynamic setting. Extensive numerical tests on both synthetic and realistic cases corroborate the analytical results derived.

关键词： Distribution system management communication game theoretical control equilibrium learning distributed algorithm asynchronous algorithm

来源：评论

学校读者我要写书评

暂无评论

A POINT SET CONNECTION PROBLEM FOR AUTONOMOUS MOBILE ROBOTS IN A GRID

引用

COMPUTING AND INFORMATICS 2012年第2期31卷 349-369页

作者： Kosowski, Adrian Suzuki, Ichiro Zylinski, Pawel Gdansk Univ Technol Dept Algorithms & Syst Modeling PL-80952 Gdansk Poland Univ Wisconsin Dept Elect Engn & Comp Sci Milwaukee WI 53201 USA Univ Gdansk Inst Informat PL-80952 Gdansk Poland

Consider an orthogonal grid of streets and avenues in a Manhattan-like city populated by stationary sensor modules at some intersections and mobile robots that can serve as relays of information that the modules exchange, where both module-module and module-robot communication is limited to a straight line of sight within the grid. The robots are oblivious and move asynchronously. We present a distributed algorithm that, given the sensor locations as input, moves the robots to suitable locations in the grid so that a connected network of all modules is established. The number of robots that the algorithm uses is worst case optimal.

关键词： asynchronous algorithm autonomous mobile robot distributed algorithm connected network oblivious algorithm grid

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed max-flow algorithm for Wireless Sensor Networks

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2015年第Aug.期54卷 20-32页

作者： Homayounnejad, Saman Bagheri, Alireza Amirkabir Univ Technol Dept Comp Engn & Informat Technol Tehran Iran Islamic Azad Univ Tehran North Branch Dept Comp Engn Tehran Iran

The max-flow problem (MFP) is one of the most explored problems in the area of combinatorial optimization and it has a wide variety of potential applications in computer networks, especially in Wireless Sensor Networks (WSNs). In this paper, we propose a WSN-specific solution to MFP based on the well-known push-relabel method. In our solution we provide several techniques and heuristics to implement asynchronous communication, reduce message complexity, support adaptability, and satisfy soft real-time requirements. Because these heuristics are independent, we can adjust the algorithm by applying some heuristics and ignoring the others, according to the application requirements. Both theoretical analysis and simulation results show that the proposed algorithm makes a significant improvement in the case of message and time complexities in comparison with the best existing algorithms. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Wireless Sensor Networks Max-flow problem Adaptive algorithm Distributed algorithm asynchronous algorithm Near-optimal flow

来源：评论

学校读者我要写书评

暂无评论

Distributed Constrained Optimization With Asynchrony and Delays

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2022年第6期69卷 2772-2776页

作者： Su, Enbing Li, Huaqing Zheng, Zuqing Lu, Qingguo Wang, Zheng Xinzhou Teachers Univ Dept Comp Sci Xinzhou 034000 Peoples R China Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia

This brief investigates a distributed composite optimization problem over an undirected network with equality constraints. The optimization problem includes a smooth term and two possibly non-smooth terms. Most existing results are devoted to developing distributed algorithms in a synchronous setting with a global clock, where the agents cannot proceed to the next iteration until the slowest agent completes its update. A new asynchronous distributed primal-dual forward-backward splitting algorithm (AD-PDFBS) is presented to solve this problem. Each agent can compute and communicate independently at different times, for different durations, with the information it has even if the latest information from its neighbors is not yet available. The convergence of AD-PDFBS is proved by transforming the asynchronous algorithm into a fixed-point problem utilizing the operator splitting scheme under bounded delay assumption. Experiment result confirms the effectiveness of AD-PDFBS.

关键词： Optimization Convergence Delays Distributed algorithms Clocks Communication networks Circuits and systems asynchronous algorithm primal-dual algorithm forward-backward splitting method non-smooth function delay operator splitting scheme

来源：评论

学校读者我要写书评

暂无评论

Parallel treatment of a class of differential-algebraic systems

引用

SIAM JOURNAL ON NUMERICAL ANALYSIS 1996年第5期33卷 1969-1980页

作者： Bahi, J Griepentrog, E Miellou, JC FACHSCH TECH & WIRFSCHAFT D-10318 BERLINGERMANY LAB CALCUL SCI BESANCON F-25030 BESANCONFRANCE

In this paper we derive an asynchronous method for the parallel solution of a class of index-one differential-algebraic systems with initial values. These systems are in the form [GRAPHICS] g(x, y, t) = 0 must be solv... 详细信息

关键词： differential-algebraic equation waveform relaxation asynchronous algorithm

来源：评论

学校读者我要写书评

暂无评论

Convergence Analysis of Dual Decomposition algorithm in Distributed Optimization: Asynchrony and Inexactness

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2023年第8期68卷 4767-4782页

作者： Su, Yifan Wang, Zhaojian Cao, Ming Jia, Mengshuo Liu, Feng Tsinghua Univ Dept Elect Engn State Key Lab Power Syst Beijing 100084 Peoples R China Shanghai Jiao Tong Univ Dept Automat Key Lab Syst Control & Informat Proc Minist Educ China Shanghai 200240 Peoples R China Univ Groningen Fac Sci & Engn NL-9747 AG Groningen Netherlands Swiss Fed Inst Technol Power Syst Lab CH-8092 Zurich Switzerland

Dual decomposition is widely utilized in the distributed optimization of multiagent systems. In practice, the dual decomposition algorithm is desired to admit an asynchronous implementation due to imperfect communication, such as time delay and packet drop. In addition, computational errors also exist when the individual agents solve their own subproblems. In this article, we analyze the convergence of the dual decomposition algorithm in the distributed optimization when both the communication asynchrony and the subproblem solution inexactness exist. We find that the interaction between asynchrony and inexactness slows down the convergence rate from O(1/k) to O(1/v/k). Specifically, with a constant step size, the value of the objective function converges to a neighborhood of the optimal value, and the solution converges to a neighborhood of the optimal solution. Moreover, the violation of v/ the constraints diminishes in O(1/ k). Our result generalizes and unifies the existing ones that only consider either asynchrony or inexactness. Finally, numerical simulations validate the theoretical results.

关键词： asynchronous algorithm distributed optimization dual decomposition inexact algorithm multiagent system (MAS)

来源：评论

学校读者我要写书评

暂无评论

Finding common fixed points of a class of paracontractions

引用

ACTA MATHEMATICA HUNGARICA 2004年第3期103卷 233-241页

作者： Crombez, G Univ Ghent Dept Pure Math & Comp Algebra B-9000 Ghent Belgium

For a suitable set of not necessarily linear operators on a real Hilbert space, such that the set of common fixed points of the operators is nonempty and has an interior point, we construct an asynchronous parallel al... 详细信息

关键词： nonlinear paracontractions common fixed points asynchronous algorithm

来源：评论

学校读者我要写书评

暂无评论

Random relaxation of fixed-point iteration

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 1996年第4期17卷 906-912页

作者： Verkama, M Systems Analysis Laboratory Helsinki University of Technology FIN-02150 Espoo Otakaari 1 Finland

This paper considers a stochastic fixed-point iteration where each coordinate is updated with a certain probability and otherwise left unchanged. The iteration is interesting from the viewpoint of parallel distributed computation because the realized sequences belong to the class of asynchronous fixed-point iterations. It is demonstrated with a linear system that the convergence conditions for randomly relaxed iterations are less stringent than their asynchronous counterparts, and that they can illuminate the tightness of the convergence conditions for asynchronous iterations, which are typically worst-case conditions.

关键词： asynchronous algorithm fixed points stochastic stability linear systems

来源：评论

学校读者我要写书评

暂无评论

Comments on "Optimization flow control, I: Basic algorithm and convergence" (vol 7, pg 861, 1999)

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2003年第2期11卷 338-339页

作者： Karbowski, A Res & Acad Compt Network NASK PL-00716 Warsaw Poland

In this Comments, an error in Low and Lapsley's article [1] is pointed out. Because of this error, the proof of the Theorem 2 presented in the article is incomplete and some assessments are wrong. In the second pa... 详细信息

关键词： asynchronous algorithm congestion pricing convergence optimization flow control

来源：评论

学校读者我要写书评

暂无评论

A Hybrid HLA Time Management algorithm Based on Both Conditional and Unconditional Information

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2009年第9期85卷 559-573页

作者： Pan, Ke Turner, Stephen John Cai, Wentong Li, Zengxiang Nanyang Technol Univ Parallel & Distributed Comp Ctr Sch Comp Engn Singapore 639798 Singapore

The High-Level Architecture (HLA), which is the IEEE standard for distributed simulation, defines six service groups. The Time Management (TM) service group ensures a Time-Stamp-Ordered (TSO) message delivery sequence and correct time advancement of each simulation component (federate) in a HLA-based distributed simulation application (federation). To control time advancement of a federation, a distributed TM algorithm requires each regulating federate to periodically propagate its local time information to all constrained federates for their respective calculation of the Greatest Available Logical Time (GALT). The time information propagated is called conditional information or unconditional information depending on whether it can be guaranteed to be true conditionally or unconditionally. A traditional distributed TM algorithm can be either synchronous or asynchronous. In general, a synchronous algorithm utilizes conditional information while an asynchronous algorithm utilizes unconditional information. However, both synchronous and asynchronous algorithms have their own drawbacks and thus cannot be used for all federation scenarios. To resolve the drawback of each algorithm, this paper proposes a hybrid TM algorithm by combining synchronous and asynchronous algorithms. The three algorithms have been incorporated into a Run-Time Infrastructure (RTI) and experimental results show that the hybrid algorithm effectively combines the advantages of both synchronous and asynchronous algorithms. We also compare the proposed hybrid TM algorithm with the TM algorithm implemented in the Federated Simulations Development Kit (FDK), which also uses both conditional and unconditional information. The hybrid TM algorithm is more scalable than FDK's TM algorithm with respect to the total number of federates in a federation, because FDK's TM algorithm has the overhead of redundant GALT calculations.

关键词： distributed simulation high-level architecture time management synchronous algorithm asynchronous algorithm hybrid algorithm conditional information unconditional information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：