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

28th International Conference on Principles of distributed Systems, OPODIS 2024

作者： Bramas, Quentin Masuzawa, Toshimitsu Tixeuil, Sébastien University of Strasbourg ICUBE CNRS France Graduate School of Information Science and Technology Osaka University Japan Sorbonne University CNRS LIP6 Institut Universitaire de France Paris France

ISBN: (纸本)9783959773607

We consider the problem of graph exploration by energy sharing mobile agents that are subject to crash faults. More precisely, we consider a team of two agents where at most one of them may fail unpredictably, and the considered topology is that of connected acyclic graphs (i.e. trees). We consider both the asynchronous and the synchronous settings, and we provide necessary and sufficient conditions about the energy. © Quentin Bramas, Toshimitsu Masuzawa, and Sébastien Tixeuil.

关键词： distributed algorithms Energy sharing Mobile Agents

来源：评论

学校读者我要写书评

暂无评论

Research on Market Power Platform for Power Generation Based on Spark distributed Framework Computing

Research on Market Power Platform for Power Generation Based...

引用

Cybersecurity, Internet of Things and Soft Computing (CITSC), Asia-Europe Conference on

作者： Wenjie Fan Mingzhen Jia Zhitong Liu State Grid Liaoning Marketing Service Center Shenyang China

ISBN: (数字)9798331504205

ISBN: (纸本)9798331504212

The Spark distributed algorithm is a distributed computing implementation based on the map reduce algorithm, which has the advantages of Hadoop MapReduce. However, unlike MapReduce, the intermediate output and results of jobs can be saved in memory, eliminating the need to read and write HDFS. Therefore, Spark is better suited for iterative map reduce algorithms such as data mining and machine learning. Spark distributed algorithm has been widely used in the Internet, advertising, finance and other industries, but less in the power industry. At present, the research on market power risk of power generators has been very in-depth, but there is little research on simulation platform algorithms for identifying market power risk. This article proposes a market power identification platform for power generation enterprises based on the Spark distributed framework, which can effectively accelerate the calculation speed of market power indicators. Furthermore, using a certain regional power grid as a simulation example, the monopoly situation of various power generation enterprises and the entire wholesale market is analyzed, proving the effectiveness of the Spark distributed framework algorithm. As the number of grid nodes increases, the advantages of the distributed algorithm will become more prominent.

关键词： Machine learning algorithms Machine learning Power grids Power industry Iterative algorithms Monopoly Sparks Internet of Things distributed algorithms Power generation

来源：评论

学校读者我要写书评

暂无评论

distributed Policy Evaluation with Local Updates over Time-Varying Communication Network

Distributed Policy Evaluation with Local Updates over Time-V...

引用

Annual Conference on Information Sciences and Systems (CISS)

作者： Matthew Crespo Chinwendu Enyioha Electrical and Computer Engineering University of Central Florida Orlando United States of America

ISBN: (数字)9798331513269

ISBN: (纸本)9798331513276

This paper studies a consensus-based policy evaluation algorithm in a cooperative team of heterogeneous learners. To improve each agent’s approximation of their value function, they each update their weight parameters, then perform consensus updates with neighboring agents over a dynamic communication network. We present the analysis of an efficient fully distributed algorithm for cooperatively evaluating and optimizing their value functions over a time-varying communication network in the average-reward setting. Our main result shows that, using this algorithm, the agents can approximate the true value function, with the approximation error dependent on the number of communication rounds and number of time steps it takes for the communication network to be connected. To validate the theoretical results, we present accompanying numerical experiments that show the theoretical error bounds are not only tight, but get tighter as the time steps required to guarantee network connectivity reduces.

关键词： Heuristic algorithms Approximation algorithms Approximation error Communication networks distributed algorithms Time-varying systems

来源：评论

学校读者我要写书评

暂无评论

distributed STORE-AND-FORWARD DEADLOCK DETECTION AND RESOLUTION algorithms

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1987年第11期35卷 1139-1145页

作者： CIDON, I JAFFE, JM SIDI, M TECHNION ISRAEL INST TECHNOL DEPT ELECT ENGNHAIFAISRAEL

distributed algorithms for the detection and resolution of deadlocks in store-and-forward computer communication networks are presented and validated. The algorithms use a fixed amount of storage at each node (that is independent of the size of the network). The detection algorithm is simple but requires network-wide coordination. The resolution algorithm is based on earlier approaches, but uses the network-wide coordination to address certain synchronization problems. When the detection and resolution algorithms are merged, it is guaranteed that packets will arrive at their destinations in finite time.

关键词： System recovery Detection algorithms Routing Buffer storage Computer networks Communication networks Degradation distributed algorithms Communications Society

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：