检索结果-南通市图书馆

Designing novel adaptive dynamic event-triggered protocols for uncertain multi-agent systems

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第1期67卷 310-311页

作者： Bin CHENG Bin HE College of Electronics and Information Engineering Tongji University Frontiers Science Center for Intelligent Autonomous Systems

Multi-agent systems (MASs) have garnered widespread attention and have been investigated by numerous researchers in recent years, primarily due to their broad applications in industry, transportation, agriculture, and astronomy. While studying the cooperative control of MASs, numerous researchers place emphasis on reducing the frequency of communication among neighboring agents.

关键词： directed graphs

Is fully distributed adaptive protocol applicable to graphs containing a directed spanning tree?

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第8期65卷 289-290页

作者： Yuezu LV Zhongkui LI Department of Systems Science School of MathematicsSoutheast University Department of Mechanics and Engineering Science College of EngineeringPeking University

Dear editor,As is mentioned in [1], most of the existing protocols for cooperative control of multiagent systems under directed graphs require global connectivity information of the entire communication graph, which m... 详细信息

关键词： directed graphs

Average Convergence for directed&Undirected graphs in Distributed Systems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2021年第6期37卷 399-413页

作者： Ali Mustafa M Najam ul Islam Salman Ahmed Bahria University Islamabad44000Pakistan Comsats University Islamabad Attock campus43600Pakistan University of Engineering&Technology Peshawar25000Pakistan

Consensus control of multi-agent systems is an innovative paradigm for the development of intelligent distributed systems.This has fascinated numerous scientific groups for their promising applications as they have the freedom to achieve their local and global goals and make their own decisions.Network communication topologies based on graph and matrix theory are widely used in a various real-time applications ranging from software agents to robotics.Therefore,while sustaining the significance of both directed and undirected graphs,this research emphases on the demonstration of a distributed average consensus algorithm.It uses the harmonic mean in the domain of multi-agent systems with directed and undirected graphs under static topologies based on a control input scheme.The proposed agreement protocol focuses on achieving a constant consensus on directional and undirected graphs using the exchange of information between neighbors to update their status values and to be able to calculate the total number of agents that contribute to the communication network at the same time.The proposed method is implemented for the identical networks that are considered under the directional and non-directional communication links.Two different scenarios are simulated and it is concluded that the undirected approach has an advantage over directed graph communication in terms of processing time and the total number of iterations required to achieve convergence.The same network parameters are introduced for both orientations of the communication graphs.In addition,the results of the simulation and the calculation of various matrices are provided at the end to validate the effectiveness of the proposed algorithm to achieve consensus.

关键词： Multi-agent systems average consensus distributed estimation directed graphs undirected graphs agent counting

A new multi-level algorithm for balanced partition problem on large scale directed graphs

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Advances in Aerodynamics 2021年第1期3卷 398-412页

作者： Xianyue Li Yufei Pang Chenxia Zhao Yang Liu Qingzhen Dong School of Mathematics and Statistics Lanzhou UniversityLanzhouGansu730000China State Key Laboratory of Aerodynamics MianyangSichuan621000China Computational Aerodynamics Institute China Aerodynamics Research and Development CenterMianyangSichuan621000China.

Graph partition is a classical combinatorial optimization and graph theory problem,and it has a lot of applications,such as scientific computing,VLSI design and clustering etc.In this paper,we study the partition problem on large scale directed graphs under a new objective function,a new instance of graph partition problem.We firstly propose the modeling of this problem,then design an algorithm based on multi-level strategy and recursive partition method,and finally do a lot of simulation experiments.The experimental results verify the stability of our algorithm and show that our algorithm has the same good performance as METIS.In addition,our algorithm is better than METIS on unbalanced ratio.

关键词： Graph partition problem Large scale graphs directed graphs Multi-level strategy

Distributed Adaptive Resource Allocation:An Uncertain Saddle-Point Dynamics Viewpoint

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2023年第12期10卷 2209-2221页

作者： Dongdong Yue Simone Baldi Jinde Cao Qi Li Bart De Schutter the School of Mathematics Southeast UniversityNanjing 210096China IEEE the Yonsei Frontier Laboratory Yonsei UniversitySeoul 03722South Korea the School of Automation Southeast UniversityNanjing 210096China the Delft Center for Systems and Control Delft University of TechnologyDelft 2628 CDThe Netherlands

This paper addresses distributed adaptive optimal resource allocation problems over weight-balanced digraphs.By leveraging state-of-the-art adaptive coupling designs for multiagent systems,two adaptive algorithms are proposed,namely a directed-spanning-tree-based algorithm and a node-based algorithm.The benefits of these algorithms are that they require neither sufficiently small or unitary step sizes,nor global knowledge of Laplacian eigenvalues,which are widely required in the literature.It is shown that both algorithms belong to a class of uncertain saddle-point dynamics,which can be tackled by repeatedly adopting the Peter-Paul inequality in the framework of Lyapunov theory.Thanks to this new viewpoint,global asymptotic convergence of both algorithms can be proven in a unified way.The effectiveness of the proposed algorithms is validated through numerical simulations and case studies in IEEE 30-bus and 118-bus power systems.

关键词： Adaptive systems directed graphs resource alloca-tion saddle-point dynamics

Distributed Quantized Control with Dynamic Event-Based Communication Under directed graphs

在线全文

学校读者我要写书评

暂无评论

Distributed Quantized Control with Dynamic Event-Based Commu...

Distributed tracking control of unmanned aerial vehicles under wind disturbance and model uncertainty

第40届中国控制会议

作者： Tao Xu Yuezu Lv Xiaoxu Lv Zhisheng Duan Department of Mechanics and Engineering Science Peking University School of mathematics Southeast University

This paper studies the consensus problem for general linear networked systems subject to uniform quantization effect on directed topologies. A control framework consisting of a distributed control protocol and a dynamic event-triggering rule is developed to guarantee that the consensus error can exponentially converge to a bounded and adjustable set without bringing about Zeno phenomenon. Compared with traditional consensus problem requiring the continuous-time communication, the information transfer between adjacent agents in this paper only occurs at certain discrete instants at which specific events are triggered. Under the proposed dynamic event-based communication mechanism, the costs on the communication and computation can be further saved. Another distinct feature of this paper lies in that the designed control framework is applicable to directed strongly connected networks, which is more practical than existing results that are only suitable for undirected connected graphs.Finally, numerical simulation results are presented to confirm the validity of the theoretical results.

关键词： Distributed consensus dynamic event-triggering rule uniform quantization directed graphs

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2016年第6期27卷 1262-1271页

作者： Kun Zhang Xiaoguang Gao School of Electronics and Information Northwestern Polytechnical University

A distributed robust method is developed for cooperative tracking control of unmanned aerial vehicles under unknown wind disturbance and model uncertainty. The communication network among vehicles is a directed graph with switching topology. Each vehicle can only share its states with its neighbors. Dynamics of the vehicles are nonlinear and affected by the wind disturbance and model uncertainty. Feedback linearization is adopted to transform the dynamics of vehicles into linear systems. To account for the wind disturbance and model uncertainty, a robust controller is designed for each vehicle such that all vehicles ultimately synchronize to the virtual leader in the three-dimensional path. It is theoretically shown that the position states of the vehicles will converge to that of the virtual leader if the communication network has a directed spanning tree rooted at the virtual leader. Furthermore, the robust controller is extended to address the formation control problem. Simulation examples are also given to illustrate the effectiveness of the proposed method. ? 2016 Beijing Institute of Aerospace Information.

关键词： Aircraft control Controllers directed graphs Feedback linearization Linear systems Mathematical transformations Navigation Topology Uncertainty analysis Unmanned aerial vehicles (UAV) Vehicles

Reference model based consensus control of second-order multi-agent systems

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2011年第2期20卷 170-176页

作者：李建祯 School of Automation Nanjing University of Science and Technology

This paper deals with the consensus problem of multi-agent systems with second-order dynamics. The objective is to design algorithms such that all agents will have same positions and velocities. First, a reference model based consensus algorithm is proposed. It is proved that the consensus can be achieved if the communication graph has a spanning tree. Different from most of the consensus algorithms proposed in the literature, the parameters of the control laws are different among agents. Therefore, each agent can design its control law independently. Secondly, it gives a consensus algorithm for the case that the velocities of the agents are not available. Thirdly, the effectiveness of the input delay and the communication delay is considered. It shows that consensus can be achieved if the input delay of every agent is smaller than a bound related to parameters in its control law. Finally, some numerical examples are given to illustrate the proposed results.

关键词： consensus problems multi-agent systems directed graphs second-order dynamics

A Framework for Web Services Composition Modeling Process

在线全文

学校读者我要写书评

暂无评论

A Framework for Web Services Composition Modeling Process

作者： Ayman EI-Refey（艾门）大连海事大学

学位级别：硕士

The modeling business processes still remains the responsibility of IT personnel.This has produced a gap between business process modeling technology and business users,who are the actual authors of business processes.Bridging this gap has become a major concern in utilizing the full potential of information technology in businesses and it can swing control of processes from IT departments to business departments,which in turn,leads to in-time deployment of competitive business processes.In this thesis,we present a framework is proposed for modeling Web services based business processes that span across multiple organizations.The approach provides abstraction from the low level XML details of the modeling language and facilitates business users,who are not so technology proficient,in modeling their own executable business processes.An ECA-based control-rule formalism is introduced to modularize the monolithic BPEL4WS process structure.Automatic generation of code for BPEL4WS and corresponding description file is provided.Transformation algorithms are devised for this purpose that are embedded in a prototype tool.As part of the framework,A relational model has been devised to store the information which is complete in all aspects and provides direct mapping to the execution language.The model acts as an intermediary platform to manipulate and infer compositional data.As abstraction from underlying syntax of the language is the main concern of this research,the modeler does not have to provide each and every detail of the XML contructs used in the composition.Algorithms have been presented that extract data and automatically infer further information from the relational model.The algorithms also provide assistance to the modeler at runtime.Various interaction patterns between the process and its partner services have been identified that provide the basis for abstraction from the roles played by each side.Using such an approach,business users not only can model executable cross-organizational business process

关键词： web services web services composition business process modeling BPEL4WS composition language abstraction control rules directed graphs