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

distributed Nash Equilibrium Seeking for Multicluster Game Under Switching Communication Topologies

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2022年第7期52卷 4105-4116页

作者： Nian, Xiaohong Niu, Fuxi Yang, Zhuo Cent South Univ Sch Automat Key Lab Inst Cluster Unmanned Syst Changsha 410075 Peoples R China

In this article, we investigate the distributed Nash equilibrium (NE) seeking problem for the multi-cluster game under switching communication topologies. Specifically, the communication topology switches between a group of jointly connected digraphs. First, a new distributed NE seeking algorithm for the multi-cluster games is designed by the consensus protocol and gradient play rule under the switching communication topologies. Furthermore, in order to make the algorithm still applicable when the agent only knows part of the decision information, the leader-following consensus protocol is used to generate the estimates for all agents action in the cluster under the assumption that the switching topology between clusters is directed and strongly connected. A more general NE seeking algorithm for the multi-cluster games is designed. For these two algorithms, the results of local convergence and non-local convergence are given, respectively. Two examples verify the validity of the theoretical results.

关键词： Games Topology Switches Network topology Clustering algorithms Cost function Convergence distributed algorithm multi-cluster game Nash equilibrium (NE) seeking switching topology

来源：评论

学校读者我要写书评

暂无评论

Energy Constrained Depth First Search

引用

algorithmICA 2024年第12期86卷 3759-3782页

作者： Das, Shantanu Dereniowski, Dariusz Uznanski, Przemyslaw Univ Toulon & Var Aix Marseille Univ CNRS LIS Marseille France Gdansk Univ Technol Gdansk Poland Univ Wroclaw Inst Comp Sci Wroclaw Poland

Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such a route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due to limited energy resources of the searcher). The objective is to cover all the edges of a tree T using the minimum number of routes, each starting and ending at the root and each being of length at most B. To this end, we analyze the following natural greedy tree traversal process that is based on decomposing a depth first search traversal into a sequence of limited length routes. Given any arbitrary depth first search traversal R of the tree T, we cover R with routes R1,& mldr;,Rl\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_1,\ldots ,R_l$$\end{document}, each of length at most B such that: Ri\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_i$$\end{document} starts at the root, reaches directly the farthest point of R visited by Ri-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_{i-1}$$\end{document}, then Ri\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\o

关键词： DFS traversal distributed algorithm Graph exploration Piecemeal exploration Online exploration

来源：评论

学校读者我要写书评

暂无评论

A Behavior-Based and Fast Convergence Energy Sharing Mechanism for Prosumers Community

引用

IEEE TRANSACTIONS ON SMART GRID 2024年第4期15卷 4023-4037页

作者： Wu, Yufeng Yu, Tao Pan, Zhenning South China Univ Technol Sch Elect Engn Guangzhou 510640 Peoples R China Guangdong Prov Key Lab Intelligent Measurement & A Guangzhou 510640 Peoples R China

Community energy sharing is an important way to encourage prosumers energy exchanges and exploit distributed resource flexibility. Previous researches suffer from low generalization, privacy leaking, heavy communication and computational burden. In this paper, a behavior-based and fast convergence energy sharing mechanism based on prosumers' response information is proposed to fill these gaps. Specifically, a continuous description of prosumers' behavior (CDPB) is applied to characterize their optimal response in a small price range. And the distributed algorithm based on response constraints (DBRC) is applied to achieve energy sharing with convergence and optimality, where only price and CDPB information are exchanged. Then, DBRC with accelerated convergence (DBRC-A) is proposed to reduce the time complexity and realize fast convergence. The efficiency, scalability, practicality of DBRC-based energy sharing mechanism are verified by numerical simulations on communities with different prosumers.

关键词： Privacy Convergence Behavioral sciences Linear matrix inequalities Games Costs Stability analysis Prosumers community market energy sharing optimal behavior description distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs 23

Brief Announcement: Distributed Construction of Near-Optimal...

引用

42nd ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Dou, Jinfeng Goette, Thorsten Hillebrandt, Henning Scheideler, Christian Werthmann, Julian Paderborn Univ Paderborn Germany

ISBN: (纸本)9798400701214

We consider the problem of computing a compact routing scheme for a weighted undirected planar graph G := (V,E,w) in several models. For a given parameter is an element of > 0, we compute a routing scheme with stretch 1 + is an element of and labels and routing tables of size (O) over tilde (is an element of -1). In CONGEST, the construction takes (O) over tilde(is an element of-3 center dot HD) time, where HD denotes the network's hop-diameter. Further, it takes (O) over tilde(is an element of-3) time in a PRAM with O(n) processors and the novel HYBRID model. Thus, our algorithms are almost optimal in all relevant parameters. To achieve these results, we extend the divide-and-conquer framework of Li and Parter [STOC '19] and combine it with state-of-the-art distributed distance approximation algorithms [STOC '22].

关键词： Compact Routing Planar Graph distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel distributed algorithm to Solve Self-organizing Network of Multicast Routing 10

A Novel Distributed Algorithm to Solve Self-organizing Netwo...

引用

10th International Conference on Natural Computation (ICNC)

作者： Li, Hongye Wang, Lei Yang, Dongdong Fei, Rong Zou, Feng Jiang, Qiaoyong Xian Univ Technol Sch Comp Sci & Engn Xian Peoples R China

ISBN: (纸本)9781479951512

Multicast routing is a very important research issue in self-organizing networks and distributed systems. It is also a challenging and hard problem for high-performance networks of the next generation. Due to it is NP-completeness, many heuristic methods have been employed to solve the problem. This paper proposes distributed algorithm for optimized self-organizing network of multicast routing (DOSMR). Because self-organizing networks have a dynamic nature, the algorithm of solving this problem is required to meet the dynamic characteristics. The proposed algorithm node information is stored in the routing table to calculate the hops of multicast tree routing. The simulation results show the proposed algorithm superiority to the methods based on DCMPH.

关键词： Multicast routing self-organizing networks distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Aggregative Optimization Over Multi-Agent Networks

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2022年第6期67卷 3165-3171页

作者： Li, Xiuxian Xie, Lihua Hong, Yiguang Inst Adv Study Dept Control Sci & Engn Coll Elect & Informat Engn Shanghai 201804 Peoples R China Tongji Univ Shanghai Res Inst Intelligent Autonomous Syst Shanghai 201804 Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Tongji Univ Coll Elect & Informat Engn Dept Control Sci & Engn Shanghai 201804 Peoples R China

This article proposes a new framework for distributed optimization, called distributed aggregative optimization, which allows local objective functions to be dependent not only on their own decision variables, but also on the sum of functions of decision variables of all the agents. To handle this problem, a distributed algorithm, called distributed aggregative gradient tracking, is proposed and analyzed, where the global objective function is strongly convex, and the communication graph is balanced and strongly connected. It is shown that the algorithm can converge to the optimal variable at a linear rate. A numerical example is provided to corroborate the theoretical result.

关键词： Optimization Linear programming Games Target tracking Standards Nash equilibrium Sensors Aggregative optimization distributed algorithm linear convergence rate multi-agent networks strongly convex function

来源：评论

学校读者我要写书评

暂无评论

Joint Service Caching, Resource Allocation and Task Offloading for MEC-Based Networks: A Multi-Layer Optimization Approach

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2024年第4期23卷 2958-2975页

作者： Chu, Weibo Jia, Xinming Yu, Zhiwen Lui, John C. S. Lin, Yi Northwestern Polytech Univ Xian 710071 Shaanxi Peoples R China Chinese Univ Hong Kong Cent Ave Hong Kong Peoples R China

To provide reliable and elastic Multi-access edge computing services, one feasible solution is to federate geographically proximate edge servers to form a logically centralized resource pool. Optimization of such systems, however, becomes challenging. In this paper, we study the problem of maximizing users' QoE in a MEC-based network, through jointly optimizing service caching, resource allocation and task offloading decisions. We formulate a mixed-integer nonlinear programming (MINLP) problem for the task and establish its NP-hardness. To tackle it efficiently, we propose a novel two-stage algorithmic solution based on approximation and decomposition theory. The proposed algorithm achieves high system performance while at the same time, ensures all constraints from different layers are satisfied. Meanwhile, the structure of the algorithm also fits the multi-layer optimizing feature, making it suitable to be implemented at different layers. In addition, we propose a distributed and online version of our mechanism with very limited information exchange between MEC servers, and further demonstrate how the cost of service switches from real MEC systems can be incorporated into our framework. We evaluate our mechanisms through simulations with both synthetic and real-world traces, and results indicate they are effective as compared to representative baseline algorithms.

关键词： distributed algorithm MEC-based network resource allocation service caching task offloading

来源：评论

学校读者我要写书评

暂无评论

On the Reconstruction of a Quality Virtual Backbone in a Wireless Sensor Network With Faulty Links

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第1期11卷 1277-1292页

作者： Liang, Jiarong He, Feng Wang, Dajin Li, Qingnian Guangxi Univ Sch Comp Elect & Informat Guangxi Key Lab Multimedia Commun & Network Techno Nanning 530004 Peoples R China Nanning Univ Nanning 530200 Guangxi Peoples R China Guangxi Univ Sch Comp Elect & Informat Nanning 530004 Peoples R China Montclair State Univ Dept Comp Sci Montclair NJ 07043 USA Nanning Univ Coll Informat Engn Nanning 530200 Guangxi Peoples R China

The work of routing and topological control for a wireless sensor network (WSN) is often undertaken by means of its virtual backbone (VB). Usually, a WSN and its VB can be modeled as a unit disk graph (UDG) and a corresponding connected dominating set (CDS), respectively. A smaller CDS in a UDG is preferred because it will lead to less overhead. In practical applications, sensor nodes or their links in a WSN may fail due to obstacles or accidental damage. Thus, it is desirable to either construct a robust VB or be able to reconstruct a new VB. In this article, the problem of reconstructing CDSs for UDGs with faulty links is considered. First, we propose a centralized approximation algorithm for the problem. We theoretically show that for a given UDG, the size of the CDS constructed by our algorithm does not exceed xi & sdot;opt+gamma+2m , where xi & sdot;opt+gamma is the upper bound on the original CDS size, opt is the minimum CDS size in the UDG, xi and gamma are two positive constants, and m is the number of faulty links. Next, we design a distributed approximation algorithm on the basis of our centralized approximation algorithm and analyze its time and message complexity. Related simulation experiments are presented to compare our algorithm with other state-of-the-art algorithms for solving this problem, and the results show that our algorithm outperforms its competitors.

关键词： Wireless sensor networks Approximation algorithms Routing Storms Fault tolerant systems Fault tolerance Task analysis Wireless sensor network approximation algorithm reconstruction faulty links distributed algorithm connected dominating set

来源：评论

学校读者我要写书评

暂无评论

distributed computations for large-scale networked systems using belief propagation

引用

Journal of Automation and Intelligence 2023年第2期2卷 61-69页

作者： Qianqian Cai Zhaorong Zhang Minyue Fu School of Automation Guangdong University of TechnologyGuangzhou 510006China Department of Applied Mathematics Hong Kong Polytechnic UniversityHong Kong Special Administrative Region of China School of System Design and Intelligent Manufacturing Southern University of Science and TechnologyShenzhen 518055China

This paper introduces several related distributed algorithms,generalised from the celebrated belief propagation algorithm for statistical *** algorithms are suitable for a class of computational problems in largescale networked systems,ranging from average consensus,sensor fusion,distributed estimation,distributed optimisation,distributed control,and distributed *** expressing the underlying computational problem as a sparse linear system,each algorithm operates at each node of the network graph and computes iteratively the desired *** behaviours of these algorithms are discussed in terms of the network graph topology and parameters of the corresponding computational problem.A number of examples are presented to illustrate their *** introduced is a message-passing algorithm for distributed convex optimisation.

关键词： distributed estimation distributed optimisation Sensor fusion distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Optimization Design of Iterative Refinement Technique for Algebraic Riccati Equations

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2022年第5期52卷 2833-2847页

作者： Zeng, Xianlin Chen, Jie Hong, Yiguang Beijing Inst Technol Sch Automat Key Lab Intelligent Control & Decis Complex Syst Beijing 100081 Peoples R China Tongji Univ Dept Control Sci & Engn Shanghai 200092 Peoples R China Tongji Univ Shanghai Res Inst Intelligent Autonomous Syst Shanghai 200092 Peoples R China Beijing Inst Technol Minist Educ Beijing Adv Innovat Ctr Intelligent Beijing 100081 Peoples R China

This article focuses on the problem of a distributed computation of continuous-time algebraic Riccati equations (CARE), where information of matrices is split and known by multiple agents. This article proposes a distributed optimization design of the iterative refinement technique (IRM), a well-established centralized method for CARE. By assuming that each agent only knows partial information of CARE, we reformulate IRM for CARE as three classes of distributed optimization subproblems with different formulations and constraints. Then, we propose distributed algorithms for obtained distributed optimization subproblems and prove convergence properties of proposed algorithms. Numerical results show the efficacy of the proposed distributed IRM.

关键词： Optimization Riccati equations distributed algorithms Cost function Convergence Optimal control Linear matrix inequalities Continuous-time algebraic Riccati equation (CARE) distributed algorithm distributed optimization iterative refinement method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：