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

Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games

Autonomous Intelligent Systems 2022年第1期2卷 71-78页

作者： Shu Liang Peng Yi Yiguang Hong Kaixiang Peng Department of Control Science&Engineering Tongji UniversityShanghai200092China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210China School of Automation and Electrical Engineering University of Science and Technology BeijingBeijing100083China

distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is *** algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dynamics,and is applicable to games with constrained strategy sets and weight-balanced communication *** key feature of our method is that the proposed projected dynamics achieves exponential convergence,whereas such convergence results are only obtained for non-projected dynamics in existing works on distributed optimization and equilibrium *** examples illustrate the effectiveness of our methods.

关键词： distributed algorithms Aggregative games Projected gradient play Weight-balanced graph Exponential convergence

来源：评论

学校读者我要写书评

暂无评论

Game Theoretical Approaches for Optimizing Multi-Carrier Half-Duplex Successive Relaying Based Cooperative NOMA

IEEE OPEN JOURNAL OF VEHICULAR TECHNOLOGY

引用

IEEE OPEN JOURNAL OF VEHICULAR TECHNOLOGY 2024年 5卷 1663-1679页

作者： Horler, H. Rastegari, B. Ng, S. X. Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ England

In this work, a novel power auctioneers network is proposed to allow the sharing of resources from Edge Users in exchange for performance gains using either the Cooperative Non-Orthogonal Multiple Access (C-NOMA) or Half-Duplex Successive Relaying based C-NOMA protocol. The latter is presented as a novel method of using two relays in C-NOMA through successive relaying to overcome the multiplexing loss in traditional C-NOMA of the far user. This system exploits two matching-based algorithms based on game theory, namely Conventional distributed Algorithm (CDA) and Pragmatic distributed Algorithm (PDA), to handle the challenge of user pairing and power allocation in multi-carrier networks. These approaches use distributed methods to perform tasks on user devices to remove the strain on the base station's resources. Monte Carlo simulations demonstrate that the addition of these games to a wireless network provides a significant performance gain compared to traditional orthogonal multiple access methods, unoptimised C-NOMA, and the distributed Matching Algorithm. Specifically, the cooperative game of PDA is shown to perform better in several scenarios, including when the subcarrier assignment was fixed and when EUs could occupy multiple subcarriers to enhance their throughput.

关键词： NOMA Resource management Games Relays Multiplexing Game theory distributed algorithms Quality of service Protocols Half-duplex system Auction cooperative game theory matching theory multi-carrier

来源：评论

学校读者我要写书评

暂无评论

The canonical amoebot model: algorithms and concurrency control

引用

distributed COMPUTING 2023年第2期36卷 159-192页

作者： Daymude, Joshua J. Richa, Andrea W. Scheideler, Christian Arizona State Univ Sch Comp & Augmented Intelligence Tempe AZ 85281 USA Arizona State Univ Biodesign Ctr Biocomp Secur & Soc Tempe AZ 85281 USA Paderborn Univ Dept Comp Sci Paderborn Germany

The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks of coordination and movement. Since its introduction at SPAA 2014, a growing body of literature has adapted its assumptions for a variety of problems;however, without a standardized hierarchy of assumptions, precise systematic comparison of results under the amoebot model is difficult. We propose the canonical amoebot model, an updated formalization that distinguishes between core model features and families of assumption variants. A key improvement addressed by the canonical amoebot model is concurrency. Much of the existing literature implicitly assumes amoebot actions are isolated and reliable, reducing analysis to the sequential setting where at most one amoebot is active at a time. However, real programmable matter systems are concurrent. The canonical amoebot model formalizes all amoebot communication as message passing, leveraging adversarial activation models of concurrent executions. Under this granular treatment of time, we take two complementary approaches to concurrent algorithm design. We first establish a set of sufficient conditions for algorithm correctness under any concurrent execution, embedding concurrency control directly in algorithm design. We then present a concurrency control framework that uses locks to convert amoebot algorithms that terminate in the sequential setting and satisfy certain conventions into algorithms that exhibit equivalent behavior in the concurrent setting. As a case study, we demonstrate both approaches using a simple algorithm for hexagon formation. Together, the canonical amoebot model and these complementary approaches to concurrent algorithm design open new directions for distributed computing research on programmable matter.

关键词： Programmable matter Self-organization distributed algorithms Concurrency

来源：评论

学校读者我要写书评

暂无评论

A fast distributed algorithm for (Δ+1)-edge-coloring

引用

JOURNAL OF COMBINATORIAL THEORY SERIES B 2022年 152卷 319-352页

作者： Bernshteyn, Anton Carnegie Mellon Univ Dept Math Sci Pittsburgh PA 15213 USA Georgia Inst Technol Sch Math Atlanta GA 30332 USA

We present a deterministic distributed algorithm in the LOCAL model that finds a proper (Delta + 1)-edge-coloring of an n-vertex graph of maximum degree Delta in poly(Delta, log n) rounds. This is the first nontrivial distributed edge-coloring algorithm that uses only Delta + 1 colors (matching the bound given by Vizing's theorem). Our approach is inspired by the recent proof of the measurable version of Vizing's theorem due to Grebik and Pikhurko. (c) 2021 Elsevier Inc. All rights reserved.

关键词： Edge-coloring Vizing's theorem distributed algorithms LOCAL model

来源：评论

学校读者我要写书评

暂无评论

Game-Based Formation Control of High-Order Multi-Agent Systems

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2023年第1期10卷 140-151页

作者： Deng, Zhenhua Cent South Univ Sch Automat Changsha 410075 Hunan Peoples R China

This paper studies the formation control of high-order multi-agent systems, where the dynamics of agents are $n$-order integrators. Different from existing results, this paper investigates the problem from the viewpoint of aggregative games. An interesting discovery is that the Nash equilibrium of a quadratic aggregative game constitutes the desired formation. Moreover, a distributed algorithm is designed for these high-order agents to form the desired formation by seeking the Nash equilibrium, where every agent estimates the aggregate of the game. Furthermore, the convergence of the algorithm is analyzed via Lyapunov stability theory. In contrast with existing formation protocols, the high-order agents with the proposed algorithm exponentially converge to the desired formation without using the (relative) positions and velocities of formation neighbors. Finally, two examples illustrate the algorithm.

关键词： Games Nash equilibrium Multi-agent systems Heuristic algorithms Formation control Aggregates distributed algorithms Aggregative games formation control high-order systems multi-agent systems nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

A Dominating Tree Based Leader Election Algorithm for Smart Cities IoT Infrastructure

引用

MOBILE NETWORKS & APPLICATIONS 2023年第2期28卷 718-731页

作者： Kadjouh, Nabil Bounceur, Ahcene Bezoui, Madani Khanouche, Mohamed Essaid Euler, Reinhardt Hammoudeh, Mohammad Lagadec, Loic Jabbar, Sohail Al-Turjman, Fadi Univ Bejaia LIMED Lab Bejaia 06000 Algeria CNRS Lab STICC UMR 6285 Brest France Univ Bretagne Occidentale Brest France Univ Boumerdes Dept Math Boumerdes Algeria Manchester Metropolitan Univ Manchester Lancs England ENSTA Bretagne Brest France Antalya Bilim Univ Antalya Turkey

In wireless sensor and IoT networks dedicated to smart-cities, a leader node performs critical tasks such as generating encryption/decryption keys. In this paper, the leader is the node situated at the extreme left of the network. It is the node which starts the algorithm of searching the boundary nodes. These nodes will be used to monitor any sensitive, dangerous or inaccessible site. For this type of application, the used algorithm must be robust and fault-tolerant because it is difficult or even impossible to intervene in the presence of node failures. If this node is the leader, such a situation can be catastrophic. In this article, we present a new algorithm called DoTRo, which is based on a tree routing protocol. It starts with local leaders which will launch the flooding process to determine a spanning tree. During this process, their values will be forwarded. If two spanning trees meet, the tree that routes the best value continues its process while the other tree stops. The remaining tree root will be the leader. This algorithm is low energy consuming with reduction rates that can exceed 85%with respect to the classical minium finding algorithm. It is efficient and fault-tolerant since it works even in the presence of node failures and communication disconnectivity. Additionally, the energy consumption is well balanced between nodes. Finally, the complexity and the proof of convergence of the proposed algorithm is presented.

关键词： Wireless sensor network IoT Leader election distributed algorithms Dominating tree and smart-cities

来源：评论

学校读者我要写书评

暂无评论

Self-adjusting grid networks

引用

INFORMATION AND COMPUTATION 2023年第1期292卷

作者： Avin, Chen van Duijn, Ingo Pacut, Maciej Schmid, Stefan Ben Gurion Univ Negev Sch Elect & Comp Engn Beer Sheva Israel Aalborg Univ Aalborg Denmark Tech Univ Berlin Berlin Germany

Emerging networked systems become increasingly flexible, reconfigurable, and "self-*". This introduces an opportunity to adjust networked systems in a demand-aware manner, leveraging spatial and temporal locality in the workload for online optimizations. However, it also introduces a tradeoff: while more frequent adjustments can improve performance, they also entail higher reconfiguration costs. This paper studies self-adjusting grid networks in which frequently communicating nodes (e.g., virtual machines) are moved topologically closer in an online and demand-aware manner, striking a balance between the benefits and costs of reconfigurations. The paper presents a general S2(logn) lower bound for this problem, even in scenarios where the demand graph is constant once learned. To demonstrate the challenge of adapting a network to pair-wise communication requests, we also design an O(log n)-competitive algorithm for 1-dimensional grids. (c) 2023 Elsevier Inc. All rights reserved.

关键词： Self- Self-adjusting data structures Self-adjusting networks Competitive analysis distributed algorithms Communication networks

来源：评论

学校读者我要写书评

暂无评论

Voltage regulation in distribution grids: A survey

引用

ANNUAL REVIEWS IN CONTROL 2023年第1期55卷 165-181页

作者： Srivastava, Priyank Haider, Rabab Nair, Vineet J. Venkataramanan, Venkatesh Annaswamy, Anuradha M. Srivastava, Anurag K. MIT Dept Mech Engn Cambridge MA 02139 USA Natl Renewable Energy Lab Golden CO USA West Virginia Univ Lane Dept Comp Sci & Elect Engn Morgantown WV USA

Environmental and sustainability concerns have caused a recent surge in the penetration of distributed energy resources into the power grid. This may lead to voltage violations in the distribution systems making voltage regulation more relevant than ever. Owing to this and rapid advancements in sensing, communication, and computation technologies, the literature on voltage control techniques is growing at a rapid pace in distribution networks. In particular, there is a paradigm shift from traditional offline centralized approaches to distributed ones leveraging increased and varied types of actuators, real-time sensing, fast and efficient computations, and an overall distributed situational awareness. This paper reviews state-of-the-art voltage control algorithms, summarizes the underlying methods, and classifies their coordination mechanisms into local, centralized, distributed, and decentralized. The underlying solution methodologies are further classified into two categories, open-loop and feedback-based. Two specific example workflows are provided to illustrate these solutions for voltage regulation.

关键词： Voltage regulation Feedback-based optimization distributed algorithms Power flow distributed energy resources

来源：评论

学校读者我要写书评

暂无评论

Resilient and distributed Discrete Optimal Transport With Deceptive Adversary: A Game-Theoretic Approach

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 1166-1171页

作者： Hughes, Jason Chen, Juntao Fordham Univ Dept Comp & Informat Sci New York NY 10023 USA

Optimal transport (OT) is a framework that can be used to guide the optimal allocation of a limited amount of resources. The classical OT paradigm does not consider malicious attacks in its formulation and thus the designed transport plan lacks resiliency to an adversary. To address this concern, we establish an OT framework that explicitly accounts for the adversarial and stealthy manipulation of participating nodes in the network during the transport strategy design. Specifically, we propose a game-theoretic approach to capture the strategic interactions between the transport planner and the deceptive attacker. We analyze the properties of the established two-person zero-sum game thoroughly. We further develop a fully distributed algorithm to compute the optimal resilient transport strategies, and show the convergence of the algorithm to a saddle-point equilibrium. Finally, we demonstrate the effectiveness of the designed algorithm using case studies.

关键词： distributed algorithms Resource management Receivers Games Uncertainty Transportation Resilience Discrete optimal transport distributed algorithm adversarial attack resilience resource matching

来源：评论

学校读者我要写书评

暂无评论

Finite-Time distributed Economic Dispatch Over Network Systems With Coupled Local Costs

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 7卷 325-330页

作者： Firouzbahrami, Majid Nobakhti, Amin Sharif Univ Technol Dept Elect Engn Tehran 113659363 Iran

This letter addresses the problem of economic dispatch for network systems where the local cost functions are coupled through their decision variables. Using Lyapunov based techniques, a continuous-time algorithm is developed which guarantees finite-time convergence to the optimal solution. This makes it possible to predetermine the system convergence time based on the initial conditions. Unlike many previous studies, the local cost functions in this letter can be nonconvex and coupled through their decision variables. It is only required that their sum is strongly convex. To verify the effectiveness of the proposed results, an illustrative example is studied.

关键词： Costs Cost function Convergence distributed algorithms Generators Topology Network systems distributed economic dispatch coupled local costs finite-time convergence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：