检索结果-南通市图书馆

Sufficient conditions and limitations of equivalent partition in multiagent controllability

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第3期65卷 152-166页

作者： Junhao GUO zhijian ji Yungang LIU Shandong Key Laboratory of Industrial Control Technology Institute of Complexity ScienceCollege of Automation Qingdao University School of Control Science and Engineering Shandong University

The emergence of the graphical characterization of multiagent controllability has raised several issues concerning how to directly establish controllability from topology structures. Arguably, one of the most serious challenges to this research field is the means through which equivalent partition, which plays an important role in graphical characterization, obtains sufficient controllability conditions; hence, how equivalent partition influences controllability has garnered considerable attention. This article specifically focuses on the sufficient conditions and limitations of equivalent partition in multiagent controllability. We provide two sufficient conditions:(i) the absence of the system matrix’s eigenvectors that make the equation formed by the eigenvalues and eigenvectors hold and(ii) the addition of leaders by reducing the same number of followers. The first condition particularly exhibits a relation between two apparently unrelated parts: Tao’s equation and controllability. We further propose a necessary and sufficient condition for controllability under n-node graphs(n 5) by taking advantage of iso-neighbor nodes, and analyze the resulting difficulties when n is greater than 5. Immediate corollaries of our results are obtained. Finally, we reveal the limitation of equivalent partition in controllability analysis. Several constructive examples demonstrate our results.

关键词： multiagent system controllability equivalent partition Tao’s equation graph theory

同方期刊数据库

Graph partitions and the controllability of directed signed networks

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第4期62卷 100-110页

作者： Xianzhu LIU zhijian ji Ting HOU Institute of Complexity Science College of Automation and Electrical Engineering Qingdao University School of Mathematics and Statistics Qingdao University College of Mathematics and Systems Science Shandong University of Science and Technology

This paper studies the controllability problem of signed networks which is presented by weighted and directed signed graphs. Graph partitions such as structural balance and almost equitable partitions(AEPs) are studied. We generalize the definition of AEPs to any graphs, directed or undirected, signed or unsigned, with or without edge weights. Based on AEP theory, a graph-theoretic necessary condition is proposed for the controllability of directed signed networks and an algorithm is given for the computation of the coarsest partition. Besides, the upper bound on the controllable subspace is derived when the system is uncontrollable.

关键词： controllability signed networks graph partition almost equitable partitions structural balance

Controllability of General Linear Discrete Multi-Agent Systems with Directed and Weighted Signed Network

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2022年第6期35卷 2107-2130页

作者： ZHAO Lanhao ji zhijian LIU Yungang LIN Chong Institute of Complexity Science College of AutomationQingdao UniversityQingdao 266071China Shandong Key Laboratory of Industrial Control Technology Qingdao UniversityQingdao 266071China School of Control Science and Engineering Shandong UniversityJinan 250061China Institute of Complecity Science College of AutomationQingdao UniversityQingdao 266071China

This paper investigates the controllability of general linear discrete-time multi-agent systems with directed and weighted signed networks by using graphic and algebraic *** nondelay and delay cases are considered *** the case of no time delay,the upper bound condition of the controllable subspace is given by using the equitable partition method,and the influence of coefficient matrix selection of individual dynamics is *** the case of single delay and multiple delays,the equitable partition method is extended to deal with time-delay systems,and some conclusions are *** particular,some simplified algebraic criteria for controllability of systems with time delay are obtained by using augmented system method and traditional algebraic controllability criteria.

关键词： Controllability equitable partition multi-agent system signed network time-delays

维普期刊数据库

Strong Structural Controllability Based on Leader-Follower Framework

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2023年第4期36卷 1498-1518页

作者： QI Wei ji zhijian LIU Yungang LIN Chong Insitute of Complexity Science College of AutomationQingdao UniversityQingdao 266071China Shandong Key Laboratory of Industrial Control Technology Qingdao UniversityQingdao 266071China School of Control Science and Engineering Shandong UniversityJinan 250061China

In this paper,the strong structural controllability of the leader-follower framework is ***,the authors analyze different edge augmentation methods to preserve the strong structural controllability of the path-bud *** following four cases are considered:Adding edges from the path to the bud;adding edges from the bud to the path;adding the reverse or forward edges to the path or bud;and adding both the reverse and forward edges to the path or *** sufficient conditions are derived for the strong structural controllability of the new topologies which are generated by adding different *** addition,it is proved that rank[A B]=n is a necessary condition for the strong structural ***,three examples are given to verify the effectiveness of the main results.

关键词： Edge augmentation leader-follower framework path-bud topology strong structural controllability

维普期刊数据库

Bipartite consensus of edge dynamics on coopetition multi-agent systems

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第12期62卷 257-268页

作者： Lei TIAN zhijian ji Ting HOU Haisheng YU Institute of Complexity Science College of Automation and Electrical Engineering Qingdao University School of Mathematics and Statistics Qingdao University College of Mathematics and Systems Science Shandong University of Science and Technology

Dear editor,The cooperative control of multi-agent systems has attracted wide attention from scholars in various fields because of its wide applications. The controllability and consensus problem of multi-agent system... 详细信息

关键词： Bipartite consensus of edge dynamics on coopetition multi-agent systems agent

Periodic event-triggered consensus of time-delayed multi-agent systems under switching topologies 36

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Periodic event-triggered consensus of time-delayed multi-age...

Formation Control of Multiple Robot Fishes Based on Artificial Potential Field and Leader-follower Framework

第36届中国控制会议

作者： Kaien Liu zhijian ji School of Mathematics and Statistics Qingdao University College of Automation and Electrical Engineering Qingdao University

ISBN: (纸本)9781538629185

The consensus problem of time-delayed multi-agent systems under switching topologies is *** consensus algorithms are proposed to reduce times of both network communication and control ***,the judgements of events are based on periodic sampling data,which guarantees that the Zeno behavior which is often a challenge in event-triggered consensus investigation is automatically ruled *** is shown that with appropriate choices of event-triggering parameters,sampling period,and time-delay,all the agents eventually reach the average of their initial sates if the system switches among a number of strongly connected and balanced topologies or connected ones.

关键词： Consensus Multi-agent Systems Time-delay Periodic Sampling Event-triggering

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Formation Control of Multiple Robot Fishes Based on Artifici...

Controllability of multi-agent systems based on agreement protocols

第25届中国控制与决策会议

作者： Haichuan Zhai zhijian ji Junwei Gao School of Automation engineering Qingdao University

ISBN: (纸本)9781467355339

Based on the artificial potential field, an approach is proposed for the formation control of multiple robot fishes, which overcomes the disadvantage that the collision avoidance is not satisfactorily solved in the leader-follower framework. In accessible areas, the formation of multiple robot fishes is maintained in the moving to target point by controlling the distance and angle between follower and leader. Under obstacle environment, robotic fish established expectations point to create artificial potential field by the order of priority. The simulation verifies the effectiveness of the method.

关键词： Leader-follower Artificial potential Multiple robot fishes Formation control

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Science in China(Series F) 2009年第11期52卷 2074-2088页

作者： WANG Long jiANG FangCui XIE GuangMing ji zhijian Center for Systems and Control College of Engineering and Key Laboratory of Machine Perception (Ministry of Education) Peking University Beijing 100871 China College of Automation Engineering Qingdao University Qingdao 266071 China

This paper investigates the controllability of multi-agent systems based on agreement protocols. First, for a group of single-integrator agents, the controllability is studied in a unified framework for both networks with leader-following structure and networks with undirected graph. Some new necessary/sufficient conditions for the controllability of networks of single-integrator agents are established. Second, we prove that, under the same topology and same prescribed leaders, a network of high-order dynamic agents is completely controllable if and only if so is a network of single-integrator agents. Third, how the selection of leaders and the coupling weights of graphs affect the controllability is analyzed. Finally, some numerical simulations are presented to demonstrate the effectiveness of the theoretical results.

关键词： multi-agent systems controllability structural controllability agreement protocols high-order dynamic agents graphs

维普期刊数据库

Minimum Driver Nodes Selection in Complex Networks 36

在线全文

学校读者我要写书评

暂无评论

Minimum Driver Nodes Selection in Complex Networks