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

International Conference on Knowledge-Based Engineering and Innovation (KBEI)

作者： Ahmadreza Ghaznavi S.M.T. Almodarresi Faculty of Electrical Engineering Yazd University Yazd Iran

Multi-agent system control based on consensus algorithm is an important solution to coordinate distributed energy resources within micro and nanogrids. A significant challenge in the application of consensus algorithm is delay among agents particularly in networks with hubs. In this paper, a novel hierarchical consensus algorithm based on the idea of virtual reduction of hub agents is proposed. As a result, significant gain in consensus speed is obtained which offers a potential time margin for applying techniques against delay, communications failure and other risks to information exchange among agents. The algorithm application is studied in the coordination of distributed photovoltaic resources of several nanogrids as a possible scale-free network with hub via simulation as well.

关键词： consensus algorithm Delays Convergence Topology Network topology Clustering algorithms Tuning

来源：评论

学校读者我要写书评

暂无评论

Distributed Robust Dynamic Average consensus with Dynamic Event-Triggered Communication 57

Distributed Robust Dynamic Average Consensus with Dynamic Ev...

引用

57th IEEE Conference on Decision and Control (CDC)

作者： George, Jemin Yi, Xinlei Yang, Tao US Army Res Lab Adelphi MD 20783 USA Royal Inst Technol ACCESS Linnaeus Ctr Sch Elect Engn & Comp Sci S-10044 Stockholm Sweden Univ North Texas Dept Elect Engn Denton TX 76203 USA

ISBN: (纸本)9781538613955

This paper presents the formulation and analysis of a fully distributed dynamic event-triggered communication based robust dynamic average consensus algorithm. Dynamic average consensus problem involves a networked set of agents estimating the time-varying average of dynamic reference signals locally available to individual agents. We propose an asymptotically stable solution to the dynamic average consensus problem that is robust to network disruptions. Since this robust algorithm requires continuous communication among agents, we introduce a novel dynamic event-triggered communication scheme to reduce the overall inter-agent communications. It is shown that the event-triggered algorithm is asymptotically stable and free of Zeno behavior. Numerical simulations are provided to illustrate the effectiveness of the proposed algorithm.

关键词： Heuristic algorithms consensus algorithm Distributed algorithms Optimization Electrical engineering Upper bound Steady-state

来源：评论

学校读者我要写书评

暂无评论

Distributed Network Size Estimation Executed by Average consensus Bounded by Stopping Criterion for Wireless Sensor Networks

Distributed Network Size Estimation Executed by Average Cons...

引用

International Conference on Applied Electronics, AE

作者： Martin Kenyeres Jozef Kenyeres Slovak Academy of Sciences Institute of Informatics Bratislava Slovakia Sipwise GmbH Brunn am Gebirge Austria

The exact information about the network size is crucial for the proper functioning of many distributed algorithms. In this paper, we analyze the average consensus algorithm for a distributed network size estimation bounded by the stopping criterion proposed for the wireless sensor networks. We analyze its four initial configurations over random geometric graphs of different connectivity under various parameters of the implemented stopping criterion. The performance is evaluated by the mean square error and the convergence rate expressed as the iteration number for the consensus. Finally, the results obtained under various conditions are compared to find the best performing configuration of both the average consensus algorithm and the implemented stopping criterion. Also, the results are compared to the distributed summing functionality.

关键词： Wireless sensor networks Convergence Estimation Measurement Peer-to-peer computing Distributed algorithms consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A High Efficiency Network Using DAG and consensus in Blockchain

A High Efficiency Network Using DAG and Consensus in Blockch...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Kaituo Cao Fei Lin Chaohui Qian Keyu Li School of Computer Science Hangzhou Dianzi University Hangzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Decentralized autonomous system based on blockchain has replaced traditional trusted third parties to process electronic payments. Blockchain has the advantages of decentralization, transparency, security, etc. and thus has great potential for development. But the chain structure and mining in the blockchain increase transaction latency and reduce the number of transactions per second (TPS). Therefore, the SDVP model is proposed to solve the problem in this paper. The model uses a self-referencing directed acyclic graph (DAG) structure and a voting-based PBFT consensus algorithm. The new model not only has good reliability, but also significantly improves the speed of transaction generation and verification, and has high efficiency of transaction processing. These experimental results demonstrate that the TPS of SDVP model under different parameters is between 600 and 1400, which is better than PayPel and has highly efficient transaction processing capabilities. It can also be observed that the model exhibits good fault tolerance when attacked.

关键词： Blockchain consensus algorithm Bitcoin Peer-to-peer computing Computer science Data models

来源：评论

学校读者我要写书评

暂无评论

Topological Characterization of consensus in Distributed Systems

arXiv

引用

arXiv 2019年

作者： Nowak, Thomas Schmid, Ulrich Winkler, Kyrill Université Paris-Saclay CNRS ENS Paris-Saclay Gif-sur-Yvette France Institut Universitaire de France Paris France TU Wien Vienna Austria ITK Engineering Austria

We provide a complete characterization of both uniform and non-uniform deterministic consensus solvability in distributed systems with benign process and communication faults using point-set *** specifically, we non-trivially extend the approach introduced by Alpern and Schneider in 1985, by introducing novel fault-aware topologies on the space of infinite executions: the process-view topology, induced by a distance function that relies on the local view of a given process in an execution, and the minimum topology, which is induced by a distance function that focuses on the local view of the process that is the last to distinguish two executions. consensus is solvable in a given model if and only if the sets of admissible executions leading to different decision values is disconnected in these topologies. By applying our approach to a wide range of different applications, we provide a topological explanation of a number of existing algorithms and impossibility results and develop several new ones, including a general equivalence of the strong and weak validity conditions. Copyright © 2019, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Proportional Dynamic consensus in Open Multi-Agent Systems 57

Proportional Dynamic Consensus in Open Multi-Agent Systems

引用

57th IEEE Conference on Decision and Control (CDC)

作者： Franceschelli, Mauro Frasca, Paolo Univ Cagliari Dept Elect & Elect Engn Cagliari Italy Univ Grenoble Alpes CNRS INRIA Grenoble INPGIPSA Lab F-38000 Grenoble France

ISBN: (纸本)9781538613955

In this paper we investigate a dynamic consensus problem for an open multi-agent system. Open multi-agent systems are characterized by a time-varying set of agents connected by a network: agents may leave and new agents may join the network at any time, thus the term "open". The dynamic consensus problem consists in achieving agreement about the time-varying average of a set of reference signals that are assumed to be the agents' inputs. Dynamic consensus has recently found application in the context of distributed estimation for electric demand-side management, where a large population of connected domestic appliances needs to estimate its future average power consumption. Since the considered network of devices changes as new appliances log in and out, there is a need to develop and characterize dynamic consensus algorithms for these open scenarios. In this paper we give several initial contributions both to a general theory of open multi-agent systems and to the specific problem of dynamic consensus within this context. On the theoretical side, we propose a formal definition of open multi-agent system, a suitable notion of stability, and some sufficient conditions to establish it. On the applied side, we design a novel dynamic consensus algorithm, the Open Proportional Dynamic consensus algorithm. We characterize some of its convergence properties in the proposed open-multi-agent systems framework and we illustrate its evolution by numerical simulations.

关键词： Multi-agent systems Heuristic algorithms consensus algorithm Trajectory Stability analysis Estimation Power demand

来源：评论

学校读者我要写书评

暂无评论

Distributed Quantized Weight-Balancing and Average consensus Over Digraphs 57

Distributed Quantized Weight-Balancing and Average Consensus...

引用

57th IEEE Conference on Decision and Control (CDC)

作者： Lee, Chang-Shen Michelusi, Nicol O. Scutari, Gesualdo Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Purdue Univ Sch Ind Engn W Lafayette IN 47907 USA

ISBN: (纸本)9781538613955

This paper studies distributed quantized weight-balancing and average consensus over fixed digraphs. A digraph with non-negative weights associated to its edges is weight-balanced if, for each node, the sum of the weights of its outgoing edges is equal to that of its incoming edges. We propose and analyze the first distributed algorithm that solves the weight-balancing problem using only quantized (one-bit) information among nodes and simplex communications (compliant to the directed nature of the graph edges). Asymptotic convergence of the scheme is proved and a convergence rate analysis is provided. Building on this result, a novel distributed algorithm is proposed that solves the average consensus problem over digraphs, using, at each iteration, only two-bit simplex communications between adjacent nodes - one bit for the weight-balancing problem, the other for the average consensus. Convergence to the average of the real (i.e., unquantized) node's initial values is proved, both almost surely and in mean square sense. Finally, numerical results validate our theoretical findings.

关键词： Convergence Distributed algorithms Optimization consensus algorithm Buildings Reliability Quantization (signal)

来源：评论

学校读者我要写书评

暂无评论

Resilient Nonlinear consensus in Continuous Time Networks

Resilient Nonlinear Consensus in Continuous Time Networks

引用

American Control Conference (ACC)

作者： Halil Yiğit Öksüz Mehmet Akar Department of Electrical and Electronics Engineering Boğaziçi University Bebek İstanbul Turkey

In this paper, a fault tolerant continuous time consensus algorithm is proposed for nonlinearly networked multi-agent systems. The proposed light-weight algorithm is novel in the sense that it solves the continuous time nonlinear consensus problem in the presence of Byzantine agents while removing minimal useful information. Necessary and sufficient conditions for the success of the proposed algorithm are presented for fixed topologies. Then, the results are extended for time-varying networks. Numerical examples are also provided to illustrate the theoretical results.

关键词： Approximation algorithms Fault tolerance Fault tolerant systems Multi-agent systems Heuristic algorithms consensus algorithm Convergence

来源：评论

学校读者我要写书评

暂无评论

Blockchain and Cryptocurrencies: Mode Techniques, and Applications

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2018年第9期48卷 1421-1428页

作者： Yuan, Yong Wang, Fei-Yue Chinese Acad Sci State Key Lab Management & Control Complex Syst Inst Automat Beijing 100190 Peoples R China Qingdao Acad Intelligent Ind Innovat Ctr Parallel Blockchain Qingdao 266109 Peoples R China Natl Univ Def Technol Res Ctr Mil Computat Expt & Parallel Syst Changsha 410073 Hunan Peoples R China Univ Chinese Acad Sci Ctr China Econ & Social Secur Beijing 100049 Peoples R China

As an emerging decentralized architecture and distributed computing paradigm underlying Bitcoin and other cryptocurrencies, blockchain has attracted intensive attention in both research and applications in recent years. The key advantage of this technology lies in the fact that it enables the establishment of secured, trusted, and decentralized autonomous ecosystems for various scenarios, especially for better usage of the legacy devices, infrastructure, and resources. In this paper, we presented a systematic investigation of blockchain and cryptocurrencies. Related fundamental rationales, technical advantages, existing and potential ecosystems of Bitcoin and other cryptocurrencies are discussed, and a six-layer reference model of the blockchain framework is proposed with detailed description for each of its six layers. Potential applications of blockchain and cryptocurrencies are also addressed. Our aim here is to provide guidance and reference for future research along this promising and important direction.

关键词： Bitcoin blockchain consensus algorithm cryptocurrency smart contract

来源：评论

学校读者我要写书评

暂无评论

Distributed Finite-Time Optimal Resource Management for Microgrids Based on Multi-Agent Framework

引用

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2018年第8期65卷 6571-6580页

作者： Zhao, Tianqiao Ding, Zhengtao Univ Manchester Sch Elect & Elect Engn Manchester M13 9PL Lancs England

This paper investigates the optimal resource management in a microgrid under various operating conditions. A two-level optimization system is proposed for the distributed optimal resource management based on a multi-agent system framework. The proposed strategy generates a reference of the optimal power output at the top level through local communication. This strategy only requires the information among neighboring participants without a central control coordination, and simultaneously accomplishes resource optimization in a finite time while maintaining the supply-demand balance. The bottom-level control is responsible for the reference tracking of each corresponding participant in a microgrid. The convergent rate of the proposed algorithm is compared with other consensus-based algorithms through simulation studies. Simulation results in the IEEE 14-bus system and an actual islanded system are also presented to demonstrate the overall effectiveness of the proposed strategy.

关键词： consensus algorithm distributed optimization finite-time stability microgrid multi-agent system (MAS) optimal resource management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：