检索结果-南通市图书馆

Continuous-Time distributed algorithms for Solving Linear Algebraic Equation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Continuous-Time Distributed Algorithms for Solving Linear Al...

distributed Aggregation algorithms for Mobile Sensor Networks with Group Mobility Model

第36届中国控制会议

作者： Kai Cao Xianlin Zeng Yiguang Hong Key Laboratory of Systems and Control Institute of Systems ScienceChinese Academy of Sciences

ISBN: (纸本)9781538629185

In this paper,a multi-agent distributed continuous-time algorithm is proposed to solve a large-scale linear algebraic equation Ax = *** many existing results assuming each agent knows a few rows of A,the algorithm proposed in this paper assumes each agent knows a few columns of *** solve the linear algebraic equation,the problem is first converted to an optimization problem with a linear ***,a distributed continuous-time algorithm is designed based on the Lagrangian function of the optimization *** algorithm is proved to solve the linear algebraic equation with any initial condition via a Lyapunov *** example is presented to show the efficacy of the proposed algorithm.

关键词： distributed algorithms Multi-agent systems Linear algebraic equation Lagrangian function

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2012年第5期17卷 512-520页

作者： Qianqian Ren Longjiang Guo Jinghua Zhu Meirui Ren Junqing Zhu School of Computer Science and Technology Heilongjiang UniversityHarbin 150080China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080China

In many applications of mobile sensor networks, such as water flow monitoring and disaster rescue, the nodes in the network can move together or separate temporarily. The dynamic network topology makes traditional spanning-tree-based aggregation algorithms invalid in mobile sensor networks. In this paper, we first present a distributed clustering algorithm which divides mobile sensor nodes into several groups, and then propose two distributed aggregation algorithms, Distance-AGG （Aggregation based on Distance）, and Probability-AGG （Aggregation based on Probability）. Both of these two algorithms conduct an aggregation query in three phases： query dissemination, intra-group aggregation, and inter-group aggregation. These two algorithms are efficient especially in mobile networks. We evaluate the performance of the proposed algorithms in terms of aggregation accuracy, energy efficiency, and query delay through ns-2 simulations. The results show that Distance-AGG and Probability-AGG can obtain higher accuracy with lower transmission and query delay than the existing aggregation algorithms.

关键词： mobile sensor networks data aggregation group mobility model distributed algorithms

distributed Optimal Variational GNE Seeking in Merely Monotone Games

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第7期11卷 1621-1630页

作者： Wangli He Yanzhen Wang IEEE the Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of EducationEast China University of Science and TechnologyShanghai 200237China

In this paper, the optimal variational generalized Nash equilibrium(v-GNE) seeking problem in merely monotone games with linearly coupled cost functions is investigated, in which the feasible strategy domain of each agent is coupled through an affine constraint. A distributed algorithm based on the hybrid steepest descent method is first proposed to seek the optimal v-GNE. Then, an accelerated algorithm with relaxation is proposed and analyzed, which has the potential to further improve the convergence speed to the optimal v-GNE. Some sufficient conditions in both algorithms are obtained to ensure the global convergence towards the optimal v-GNE. To illustrate the performance of the algorithms, numerical simulation is conducted based on a networked Nash-Cournot game with bounded market capacities.

关键词： distributed algorithms equilibria selection generalized Nash equilibrium(GNE) merely monotone games

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

Fast and scalable routing protocols for data center networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2023年第6期9卷 1340-1350页

作者： Mihailo Vesovic Aleksandra Smiljanic Dusan Kostic School of Electrical Engineering University of Belgrade11120BelgradeSerbia Amazon Web Services(AWS) ZurichSwitzerland

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link *** are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize *** such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive *** routing protocols were proposed to overcome this problem by focusing on network utilization rather than ***,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing ***,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data *** aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose *** propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

关键词： Routing protocols Data center networks Parallel algorithms distributed algorithms Algorithm design and analysis Shortest-path problem Scalability

distributed three-dimensional cooperative guidance via receding horizon control

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2016年第4期29卷 972-983页

作者： Zhao Jiang Zhou Rui School of Automation Science and Electrical Engineering Beihang University

The paper presents a new three-dimensional (3D) cooperative guidance approach by the receding horizon control (RHC) technique. The objective is to coordinate the impact time of a group of interceptor missiles against the stationary target. The framework of a distributed RHC scheme is developed, in which each interceptor missile is assigned its own finite-horizon optimal control problem (FHOCP) and only shares the information with its neighbors. The solution of the local FHOCP is obtained by the constrained particle swarm optimization (PSO) method that is integrated into the distributed RHC framework with enhanced equality and inequality constraints. The numerical simulations show that the proposed guidance approach is feasible to implement the cooperative engagement with satisfied accuracy of target capture. Finally, the computation efficiency of the distributed RHC scheme is discussed in consideration of the PSO parameters, control update period and prediction horizon. (C) 2016 Chinese Society of Aeronautics and Astronautics. Production and hosting by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license.

关键词： distributed algorithms Impact time Missile guidance Multiple missiles Particle swarm optimization (PSO) Receding horizon control (RHC) Three-dimensional (3D)

Obstacle avoidance for multi-missile network via distributed coordination algorithm

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2016年第2期29卷 441-447页

作者： Zhao Jiang Zhou Rui School of Automation Science and Electrical Engineering Beihang University

A distributed coordination algorithm is proposed to enhance the engagement of the multi-missile network in consideration of obstacle avoidance. To achieve a cooperative interception, the guidance law is developed in a simple form that consists of three individual components for tar- get capture, time coordination and obstacle avoidance. The distributed coordination algorithm enables a group of interceptor missiles to reach the target simultaneously, even if some member in the multi-missile network can only collect the information from nearest neighbors. The simula- tion results show that the guidance strategy provides a feasible tool to implement obstacle avoid- ance for the multi-missile network with satisfactory accuracy of target capture. The effects of the gain parameters are also discussed to evaluate the proposed approach.

关键词： Cooperative guidance distributed algorithms Impact time Missile guidance Multiple missiles Obstacle avoidance Proportional navigation

A nearly optimal distributed algorithm for computing the weighted girth

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第11期64卷 80-94页

作者： Qiang-Sheng HUA Lixiang QIAN Dongxiao YU Xuanhua SHI Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology School of Computer Science and Technology Shandong University

Computing the weighted girth, which is the sum of weights of edges in the minimum weight cycle,is an important problem in network analysis. The problem for distributively computing girth in unweighted graphs has garnered lots of attention, but there are few studies in weighted graphs. In this paper, we propose a distributed randomized algorithm for computing the weighted girth in weighted graphs with integral edge weights in the range [1, nc], where n is the number of vertices and c is a constant. The algorithm is devised under the standard synchronous CON GE S T model, which limits each vertex can only transfer O（log n） bits information along each incident edge in a round. The upper bound of the algorithm is O（n log;n） rounds. We also prove the lower bound for computing the weighted girth is ?（D + n/log n） where D is the hop diameter of the weighted graph. This means our distributed algorithm is optimal within a factor of O（log;n）.

关键词： distributed algorithms weighted girth $\mathcal{CONGEST}$ model communication complexity round complexity

distributed gradient-based sampling algorithm for least-squares in switching multi-agent networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第9期63卷 284-293页

作者： Peng LIN Hongsheng QI Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences

Dear editor,Recent years have witnessed a rapid growth of distributed design in multi-agent networks because of the scalability, robustness and low cost. Compared with the conventional centralized and parallel design, all agents in fully distributed design aim to achieve the global goal only based on the local measurement and information sharing with

关键词： multi-agent systems distributed algorithms least-squares gradient-based sampling time-varying networks