检索结果-南通市图书馆

Second-order consensus in networks of dynamic agents with communication time-delays

Journal of Systems Engineering and Electronics 2010年第1期21卷 88-94页

作者： Bo Yang1,2, Huajing Fang3, and Hua Wang4 1. School of Navigation, Wuhan University of Technology, Wuhan 430063, P. R. China 2. Wuhan Second Ship Design and Research Institute, Wuhan 430064, P. R. China 3. Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, P. R. China 4. Department of Aerospace and Mechanical Engineering, Boston University, Boston MA02215, USA School of Navigation Wuhan University of Technology Wuhan 430063 P. R. China Wuhan Second Ship Design and Research Institute Wuhan 430064 P. R. China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 P. R. China Department of Aerospace and Mechanical Engineering Boston University Boston MA02215 USA

This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.

关键词： second-order consensus protocols dynamic networks algebraic graph theory frequency domain analysis com-munication constraints.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An evolutionary autoencoder for dynamic community detection

引用

Science China(Information Sciences) 2020年第11期63卷 219-234页

作者： Zhen WANG Chunyu WANG Chao GAO Xuelong LI Xianghua LI School of Mechanical Engineering and The Center for OPTIMAL Northwestern Polytechnical University College of Computer and Information Science Southwest University School of Computer Science and The Center for OPTIMAL Northwestern Polytechnical University

dynamic community detection is significant for controlling and capturing the temporal features of networks. The evolutionary clustering framework provides a temporal smoothness constraint for simultaneously maximizing the clustering quality at the current time step and minimizing the clustering deviation between two successive time steps. Based on this framework, some existing methods, such as the evolutionary spectral clustering and evolutionary nonnegative matrix factorization, aim to look for the low-dimensional representation by mapping reconstruction. However, such reconstruction does not address the nonlinear characteristics of networks. In this paper, we propose a semi-supervised algorithm(sE-Autoencoder) to overcome the effects of nonlinear property on the low-dimensional representation. Our proposed method extends the typical nonlinear reconstruction model to the dynamic network by constructing a temporal matrix. More specifically, the potential community characteristics and the previous clustering, as the prior information,are incorporated into the loss function as a regularization term. Experimental results on synthetic and realworld datasets demonstrate that the proposed method is effective and superior to other methods for dynamic community detection.

关键词： dynamic networks community detection autoencoder graph embedding

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Second-Order Consensus in networks of Agents with Delayed dynamics

引用

Wuhan University Journal of Natural Sciences 2009年第2期14卷 158-162页

作者： YANG Bo FANG Huajing Wuhan Second Ship Design and Research Institute Wuhan 430064 Hubei China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China

This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.

关键词： second-order consensus protocols dynamic networks time-delays frequency domain analysis

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Backward Dijkstra Algorithms for Finding the Departure Time Based on the Specified Arrival Time for Real-Life Time-Dependent networks

引用

Journal of Applied Mathematics and Physics 2016年第1期4卷 1-7页

作者： Gelareh Bakhtyar Vi Nguyen Mecit Cetin Duc Nguyen Department of Civil and Environmental Engineering Old Dominion University Norfolk USA Department of Mechanical and Aerospace Engineering Old Dominion University Norfolk VA USA Department of Modeling Simulation and Visualization Engineering Old Dominion University Norfolk VA USA

A practical transportation problem for finding the “departure” time at “all source nodes” in order to arrive at “some destination nodes” at specified time for both FIFO (i.e., First In First Out) and Non-FIFO “dynamic ” networks is considered in this study. Although shortest path (SP) for dynamic networks have been studied/documented by various researchers, contributions from this present work consists of a sparse matrix storage scheme for efficiently storing large scale sparse network’s connectivity, a concept of Time Delay Factor (TDF) combining with a “general piece- wise linear function” to describe the link cost as a function of time for Non-FIFO links’ costs, and Backward Dijkstra SP Algorithm with simple heuristic rules for rejecting unwanted solutions during the backward search algorithm. Both small-scale (academic) networks as well as large- scale (real-life) networks are investigated in this work to explain and validate the proposed dynamic algorithms. Numerical results obtained from this research work have indicated that the newly proposed dynamic algorithm is reliable, and efficient. Based on the numerical results, the calculated departure time at the source node(s), for a given/specified arrival time at the destination node(s), can be non-unique, for some Non-FIFO networks’ connectivity.

关键词： Backward Dijkstra dynamic networks Piece-Wise Linear Function Specified Arrival Time

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Distributed Connectivity Control in A dynamic Network

Distributed Connectivity Control in A Dynamic Network

引用

2011 Chinese Control and Decision Conference（CCDC）

作者： Shigeru Yamamoto Faculty of Electrical and Computer Engineering Kanazawa University

In this paper,we propose a distributed algorithm to control connectivity of mobile agents in a constrained dynamic *** connectivity property of the multi-agent system is quantified by the second smallest eigenvalue of the state dependent Laplacian of the proximity graph of *** by k-regular graph characteristics,we consider a discrete-time model for autonomous *** explore an approach based on tentative overlay as a condition mapping from interrelation and interaction between each agent,which equipped with local sensing and wireless communication *** thereby shows that load balancing can be controlled with network’s connectivity,while other than nearest neighbor information,our approach assumes no knowledge of global network ***,a new collision avoidance method motivated by vertex coloring is presented for our distributed *** addition,simulations are provided that demonstrate the effectiveness of our theoretical results,for which we show a distributed dynamic programming of multiagent system.

关键词： Distributed control dynamic networks Multiagent systems

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：