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

Predefined-time distributed event-triggered algorithms for resource allocation

IET CYBER-PHYSICAL SYSTEMS: THEORY & APPLICATIONS 2022年第4期7卷 183-196页

作者： Shi, Xiasheng Xu, Lei Yang, Tao Dalian Univ Technol Key Lab Intelligent Control & Optimizat Ind Equip Minist Educ Dalian Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110819 Liaoning Peoples R China

The resource allocation problem in a distributed multi-agent system is considered in this study. First, the authors develop a predefined-time distributed algorithm and analyse its convergence analysis using the Lyapunov stability theory, in which the local constraint is ensured by a differential projection operator. Thus, a predefined time is obtained by a time-varying time-based generator. Second, to reduce the communication consumption between agents, the authors develop a static as well as a dynamic-based event-triggered control scheme, where the information broadcast only occurs at some discrete time instants. Moreover, the three proposed algorithms converge precisely to the global optimal solution. Besides, the Zeno behaviour is excluded in the above static and dynamic event-triggered mechanisms. Finally, the authors test the proposed algorithms' efficiency based on the provided numerical examples.

关键词： Lyapunov stability theory time-varying systems distributed multiagent system predefined-time distributed event-triggered algorithms multi-agent systems distributed algorithms predefined-time distributed algorithm convergence analysis stability differential projection operator distributed control resource allocation problem static event-triggered mechanisms convergence resource allocation Lyapunov methods dynamic-based event-triggered control scheme time-varying time-based generator

来源：评论

学校读者我要写书评

暂无评论

A Multi-Agent System Framework for Managing distributed Energy Resources (DERs)

A Multi-Agent System Framework for Managing Distributed Ener...

引用

IEEE Electrical Energy Storage Application and Technologies Conference (EESAT)

作者： Omid Ziaee Beth Crouchet Chris DeBenedicts Budderfly Inc. Shelton CT USA

ISBN: (数字)9798331524852

ISBN: (纸本)9798331536411

In this paper, we propose a multi-tiered framework for controlling distributed energy resources (DERs) such as elastic and non-elastic loads, electric vehicles (EV s), and Battery Energy Storage Systems (BESS). These resources are organized into clusters. By distributing the control algorithm across these tiers, DERs optimize local operations and enhance system resilience. Local agents (LIAs) at the lowest tier optimize individual units. Cluster agents (CI As) at the second-tier aggregate cluster loads. The orchestrator agent (01 A) at the highest tier communicates with utilities or ISO/TSOs. Each LI A periodically solves a stochastic mixed-integer linear programming (MILP) problem to minimize costs and flatten the load profile. LI A results are aggregated by CI As to calculate flexible capacities. The 01 A aggregates this data to identify operational violations with the network operator, distributing necessary corrections among clusters.

关键词： Fault tolerance Costs Uncertainty Electric vehicles Scheduling distributed power generation Mixed integer linear programming distributed algorithms Multi-agent systems Meteorology

来源：评论

学校读者我要写书评

暂无评论

Gossip algorithms for distributed Signal Processing

引用

PROCEEDINGS OF THE IEEE 2010年第11期98卷 1847-1864页

作者： Dimakis, Alexandros G. Kar, Soummya Moura, Jose M. F. Rabbat, Michael G. Scaglione, Anna Univ So Calif Dept Elect & Comp Engn Los Angeles CA 90089 USA Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 2A7 Canada Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This paper presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.

关键词： Consensus protocols distributed algorithms distributed processing gossip protocols graph theory information networks distributed averaging network topology peer to peer computing protocols random topologies topology design wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

distributed ORTHOGONAL FACTORIZATION - GIVENS AND HOUSEHOLDER algorithms

引用

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING 1989年第6期10卷 1113-1134页

作者： POTHEN, A RAGHAVAN, P

Several algorithms for orthogonal factorization on distributed memory multiprocessors are designed and implemented. Two of the algorithms employ Householder transformations, a third is based on Givens rotations, and a... 详细信息

关键词： 65F20 65F25 Givens rotations Householder transformations distributed algorithms hypercube multi-processors least squares problems orthogonal factorization parallel computations

来源：评论

学校读者我要写书评

暂无评论

Robust distributed Diffusion Recursive Least Squares algorithms With Side Information for Adaptive Networks

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2019年第6期67卷 1566-1581页

作者： Yu, Yi Zhao, Haiquan de Lamare, Rodrigo C. Zakharov, Yuriy Lu, Lu Southwest Univ Sci & Technol Sch Informat Engn Mianyang 621010 Peoples R China Southwest Jiaotong Univ Sch Elect Engn Chengdu 610031 Sichuan Peoples R China Pontificia Univ Catolica Rio de Janeiro CETUC BR-22451900 Rio de Janeiro Brazil Univ York Dept Elect Engn York YO10 5DD N Yorkshire England Sichuan Univ Sch Elect & Informat Engn Chengdu 610017 Sichuan Peoples R China

This work develops robust diffusion recursive least-squares algorithms to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. The first algorithm minimizes an exponentially weighted least-squares cost function subject to a time-dependent constraint on the squared norm of the intermediate update at each node. A recursive strategy for computing the constraint is proposed using side information from the neighboring nodes to further improve the robustness. We also analyze the mean-square convergence behavior of the proposed algorithm. The second proposed algorithm is a modification of the first one based on the dichotomous coordinate descent iterations. It has a performance similar to that of the former, however, its complexity is significantly lower especially when input regressors of agents have a shift structure and it is well suited to practical implementation. Simulations show the superiority of the proposed algorithms over previously reported techniques in various impulsive noise scenarios.

关键词： distributed algorithms diffusion cooperation dichotomous coordinate-descent impulsive noises recursive least squares algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed rendez-vous algorithms for a class of cyberphysical systems

Distributed rendez-vous algorithms for a class of cyberphysi...

引用

European Control Conference (ECC)

作者： De Persis, Claudio Postoyan, Romain Univ Groningen Fac Math & Nat Sci NL-9700 AB Groningen Netherlands Univ Lorraine CRAN UMR 7039 Nancy France CNRS CRAN UMR 7039 F-75700 Paris France

ISBN: (纸本)9783952426937

The objective is to design distributed coordination strategies for a network of agents in a cyber-physical environment. In particular, we concentrate on the rendez-vous of agents having double-integrator dynamics with the addition of a damping term in the velocity dynamics. We start with distributed controllers that solve the problem in continuous-time, and we then explain how to implement these using eventbased sampling. The idea is to define a triggering rule per edge using a clock variable which only depends on the local variables. The triggering laws are designed to compensate for the perturbative term introduced by the sampling, a technique that reminds of Lyapunov-based control redesign. We first present an event-triggered solution which requires continuous measurement of the relative position and we then explain how to convert it to a self-triggered policy. The latter only requires the measurements of the relative position and velocity at the last transmission instants, which is useful to reduce both the communication and the computation costs. The strategies guarantee the existence of a uniform minimum amount of times between any two edge events. The analysis is carried out using an invariance principle for hybrid systems.

关键词： Lyapunov methods compensation continuous time systems control system synthesis damping distributed algorithms distributed control invariance position measurement sampling methods velocity measurement Lyapunov-based control redesign clock variable communication costs computation costs continuous relative position measurement continuous-time problem cyberphysical systems damping term distributed controllers distributed coordination strategy design distributed rendezvous algorithms double-integrator dynamics edge events event-based sampling event-triggered solution hybrid systems invariance principle local variables perturbative term compensation relative velocity measurement self-triggered policy triggering law design triggering rule uniform minimum times velocity dynamics Algorithm design and analysis Clocks Damping Nickel Position measurement

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms for distributed Boosting 55

Improved Algorithms for Distributed Boosting

引用

55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Cooper, Jeff Reyzin, Lev Google Inc Mountain View CA 94043 USA Univ Illinois Dept Math Stat & Comp Sci Chicago IL 60607 USA

ISBN: (纸本)9781538632666

We introduce two distributed boosting algorithms. Our first algorithm uses the entire dataset to train a classifier and requires a significant amount of communication among the distributed sites. Our second algorithm requires very little communication but uses a subsample of the dataset to train the final classifier. Both of our algorithms improve upon existing practical distributed boosting algorithms. Further, both are competitive with AdaBoost when it is run with the entire dataset.

关键词： Boosting Training data Machine learning algorithms Training Partitioning algorithms distributed algorithms Standards

来源：评论

学校读者我要写书评

暂无评论

distributed Best Response algorithms for Potential Games 16

Distributed Best Response Algorithms for Potential Games

引用

17th Annual European Control Conference (ECC)

作者： Durand, Stephane Garin, Federica Gaujal, Bruno Univ Grenoble Alpes INRIA CNRS Grenoble INPLIGGIPSA Lab F-38000 Grenoble France

ISBN: (纸本)9783952426982

In this paper we design and analyze distributed algorithms to compute a Nash equilibrium in potential games. Our algorithms are based on best-response dynamics, with suitable revision sequences (orders of play). We compute the average complexity over all potential games of best response dynamics under a random i. i. d. revision sequence, since it can be implemented in a distributed way using Poisson clocks. We obtain a distributed algorithm whose execution time is within a constant factor of the optimal centralized one. We then show how to take advantage of the structure of the interactions between players in a network game: non-interacting players can play simultaneously. This improves best response algorithm, both in the centralized and in the distributed case.

关键词： Games Nash equilibrium Clocks Round robin Heuristic algorithms distributed algorithms Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Synchronization of distributed simulation using broadcast algorithms

引用

Computer Networks (1976) 1980年第1期4卷 3-10页

作者： Kent Peacock, J Manning, Eric Wong, J.W Computer Communication Networks Group Department of Computer Science University of Waterloo Waterloo Ont. N2L 3G1 Canada

Simulation, particularly of networks of queues, is an application with a high degree of inherent parallelism, and is of considerable practical interest. We continue the analysis of synchronization methods for distributed simulation, defined by the taxonomy in our previous paper. Specifically, we develop algorithms for time-driven simulation using a network of processors. For most of the synchronization methods considered, each node k of an n-node network simulation cannot proceed directly with its part of a simulation. Rather, it must compute some function B_k(ν₁, ν₂, ..., ν_n), where ν_i is some value which must be obtained from node i. The value of ν_i at each node changes as the simulation progresses, and must be broadcast to every other node for the recomputation of the B-functions. In some cases, it is advantageous to compute the B-function in a distributed manner. Broadcast algorithms for such distributed computation are presented. Since the performance of a broadcast algorithm depends on the properties of the inter-process communication facility, we characterize some particular cases and give algorithms for each of them. © 1980.

关键词： broadcast distributed algorithms distributed processing simulation synchronization

来源：评论

学校读者我要写书评

暂无评论

Synchronous distributed Greedy Weighted Graph Matching algorithms For Wireless Sensor Networks 4

Synchronous Distributed Greedy Weighted Graph Matching Algor...

引用

4th International Conference on Computer Science and Engineering (UBMK)

作者： Ersin, Ismail Ileri, Can Umut Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

ISBN: (纸本)9781728139647

Wireless Sensor Networks (WSN) consist of devices that can communicate with each other without using any fixed infrastructure. These devices can gather necessary information from the environment via their sensors and share collected data with each others. WSNs can be modelled with graphs (G (V, E)) where V is the set of vertices (nodes) and E is the set of edges. Graph theoretical structures such as graph matching can be used to solve various problems such as backup assignment in WSNs. With this aim, we first design a synchronous distributed weighted graph matching algorithm based on Hoepman's algorithm. After this the synchronous algorithm is improved by using overhearing method to design ICO algorithm. Proposed ICO algorithm aims to decrease the transmitted message count for graph matching operation by applying in-network processing. These algorithms are tested on various settings having different node counts and degrees in TOSSIM simulator by comparing with each other. The results of these extensive tests reveal us that ICO is more effective in terms of energy consumption and transmitted bytes.

关键词： Matching algorithms Hoepman Wireless Sensor Networks distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：