云南高校图书馆联盟文献共享服务平台- CONNECTIVITY

CONNECTIVITY: 作品数：804被引量：884H指数：10; 导出分析报告; 相关领域：自动化与计算机技术更多>>; 相关作者：陈永光王桂平杨光丛日杰单祥茹更多>>; 相关机构：东南大学《汽车制造业》编辑部上海交通大学东北林业大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划中国博士后科学基金国家教育部博士点基金更多>>

Distributed Fault-Tolerant Control of Uncertain Multi-Agent Systems with Connectivity Maintenance: 《Journal of Systems Science & Complexity》2024年第1期40-62,共23页XING Xueyan HU Guoqiang; supported by the RIE2020 Industry Alignment Fund Industry Collaboration Projects (IAFICP) Funding Initiative;cash and in-kind contribution from the industry partner(s); In this paper,a distributed cooperative control protocol is presented to deal with actuator failures of multi-agent systems in the presence of connectivity preservation.With the developed strategy,each agent can track...; 关键词：Actuator failure connectivity maintenance coordination control UNCERTAINTIES

Cooperative Target Fencing of Multiple Vehicles for a General Target with Connectivity Preservation and Collision Avoidance: 《Journal of Systems Science & Complexity》2024年第1期136-151,共16页PAN Zini CHEN Ben M; supported in part by the Research Grants Council of Hong Kong SAR under Grant Nos.14206821 and 14217922;in part by the Hong Kong Centre For Logistics Robotics (HKCLR); In this paper,the authors study the cooperative target-fencing problem for n-dimensional systems and a target with a general trajectory.Without using the velocity of the vehicles,a position feedback control law is pro...; 关键词：Multi-agent systems networked systems target fencing

Dynamically Optimized Sensor Deployment Based on Game Theory被引量：4: 《Journal of Systems Science & Complexity》2018年第1期276-286,共11页ZHANG Fan ZHENG Zhi JIAO Lei; supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China under Grant No.61321002;the Program for Changjiang Scholars and Innovative Research Team in University under Grant No.IRT1208;the Changjiang Scholars Program;the Beijing Outstanding Ph.D. Program Mentor under Grant No.20131000704; Sensor network deployment is the key for sensors to play an important performance. Based on game theory, first, the authors propose a multi-type sensor target allocation method for the autonomous deployment of sensors...; 关键词：Connectivity dynamic deployment game theory target allocation

TESTING k-EDGE-CONNECTIVITY OF DIGRAPHS被引量：1: 《Journal of Systems Science & Complexity》2010年第1期91-101,共11页Yuichi YOSHIDA.HiroI TO; This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or E-far from k-edge-connectivity. This is the first testing algorithm for k-edge- connectivity of digraphs whose ...; 关键词：DIGRAPH GRAPH k-edge-connectivity property testing.

FLOCKING OF MULTI-AGENT DYNAMIC SYSTEMS WITH GUARANTEED GROUP CONNECTIVITY被引量：1: 《Journal of Systems Science & Complexity》2008年第3期337-346,共10页Xiaoli LI Yugeng XI; the National Natural Science Foundation of China under Grant No.60504026 and No.60674041;the National High Technology Project under Grant No.2006AA04Z173; This paper investigates distributed flocking problem where the information exchange among agents is modeled by the communication topology changing with time. Previous research on this problem establishes group stabili...; 关键词：CONNECTIVITY distributed control FLOCKING multi-agent system

CONVERGENCE OF A CLASS OF MULTI-AGENT SYSTEMS IN PROBABILISTIC FRAMEWORK被引量：9: 《Journal of Systems Science & Complexity》2007年第2期173-197,共25页Gongguo TANG Lei GUO; The research is supported by National Natural Science Foundation of China under the Grants No. 60221301 and No. 60334040.Acknowledgement The authors would like to thank Prof. Feng TIAN and Dr. Mei LU for providing the proof of Lemma 6 in Appendix B. We would also like to thank Ms. Zhixin Liu for valuable discussions.; Multi-agent systems arise from diverse fields in natural and artificial systems, and a basic problem is to understand how locally interacting agents lead to collective behaviors （e.g., synchronization） of the overal...; 关键词：CONNECTIVITY large deviation local interaction rules multi-agent systems random geometric graph spectral graph theory SYNCHRONIZATION Vicsek model

A NEW FAMILY OF TRIVALENT CAYLEY NETWORKS ON WREATH PRODUCT Z_m■S_n: 《Journal of Systems Science & Complexity》2006年第4期577-585,共9页Shuming ZHOU Key Laboratory of Network Security and Cryptology(Fujian Normal University),Fujian Province University,Fuzhou,350007 College of Mathematics and Computer Science,Fajian Normal University,Fuzhou,350007,China.; This work was partly supported by the Natural Science Foundation of Fujian Education Ministry under Grant No.JB05333; We propose a new family of interconnection networks （WGn^m） with regular degree three. When the generator set is chosen properly, they are isomorphic to Cayley graphs on the wreath product Zm ～ Sn. In the case of m...; 关键词：Cayley graph CONNECTIVITY DIAMETER interconnection network ROUTING

MINIMALLY (n, λ)-CONNECTED GRAPHS OF LOW ORDER AND MAXIMAL SIZE: 《Journal of Systems Science & Complexity》2005年第4期564-569,共6页XU Liqiong GUO Xiaofeng; This research is supported by the National Natural Science Foundation of China.; A. Kaneko and K. Ota proved that for a minimally （n, λ）-connected graph G, if ｜G｜ = p ≥ 3n - 1, then e（G） ≤ nλ（｜G｜ - n）; and if e（G） = nλ（｜G｜ - n）, then G is isomorphic to the graph Kn^λ,p-n whic...; 关键词：（n λ ）-connectivity minimally （n λ ）-connected graph minimally k-connected graph.

THE CONNECTIVITY OF MAXIMUM MATCHING GRAPHS被引量：1: 《Journal of Systems Science & Complexity》2004年第1期33-38,共6页LIUYan WANGShiying; This research is suppouted by the National Natural Science Foundation of China(10201019); The maximum matching graph of a graph has a vertex for each maximummatching and an edge for each pair of maximum matchings which differ by exactly oneedge. In this paper, we prove that the connectivity of maximum matc...; 关键词：maximum matching graph CONNECTIVITY

HAJOS' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS被引量：1: 《Journal of Systems Science & Complexity》2002年第3期295-298,共4页XU Baogang (School of Mathematics and Computer Science, Nanjing Normal University, Nanjing 210097, China); This research is partially supported by the National Postdoctoral Fund of China and Natural Science Foundation of China(No. 10001035); This work was finished while the author was working for Academy of Mathematics and Systems Science, Chinese of Academy; Hajos' conjecture asserts that a simple eulerian graph on n vertices can be decomposed into at most n-1/2 circuits. In this paper, we propose a new conjecture which is equivalent to Hajos' conjecture, and show that to...; 关键词：Circuit decomposition CONNECTIVITY eulerian graph.

CONNECTIVITY