Fully distributed consensus for high-order strict-feedback nonlinear multiagent systems with switched topologies

summary:This paper studies the distributed consensus problem of high-order strict-feedback nonlinear multiagent systems. By employing the adaptive backstepping technique and switched system theory, a novel protocol is proposed for MASs with switched topologies. Global information such as the number of agents and communication topology is not used. In addition, the communication topology between agents can be switched between possible topologies at any time. Based on the Lyapunov function method, the proposed adaptive protocol guarantees the complete consensus of multiagent systems without restricting the dwell time of the switched signal. Finally, two numerical examples are provided to illustrate the effectiveness and advantages of the given protocol

Iterative learning control for multi-agent systems with impulsive consensus tracking

In this paper, we adopt D-type and PD-type learning laws with the initial state of iteration to achieve uniform tracking problem of multi-agent systems subjected to impulsive input. For the multi-agent system with impulse, we show that all agents are driven to achieve a given asymptotical consensus as the iteration number increases via the proposed learning laws if the virtual leader has a path to any follower agent. Finally, an example is illustrated to verify the effectiveness by tracking a continuous or piecewise continuous desired trajectory

Consensus tracking problem for linear fractional multi-agent systems with initial state error

In this paper, we discuss the consensus tracking problem by introducing two iterative learning control (ILC) protocols (namely, Dα-type and PDα-type) with initial state error for fractional-order homogenous and heterogenous multi-agent systems (MASs), respectively. The initial state of each agent is fixed at the same position away from the desired one for iterations. For both homogenous and heterogenous MASs, the Dα-type ILC rule is first designed and analyzed, and the asymptotical convergence property is carefully derived. Then, an additional P-type component is added to formulate a PDα-type ILC rule, which also guarantees the asymptotical consensus performance. Moreover, it turns out that the PDα-type ILC rule can further adjust the final performance. Two numerical examples are provided to verify the theoretical results

Data Driven Distributed Bipartite Consensus Tracking for Nonlinear Multiagent Systems via Iterative Learning Control

This article explores a data-driven distributed bipartite consensus tracking (DBCT) problem for discrete-time multi-agent systems (MASs) with coopetition networks under repeatable operations. To solve this problem, a time-varying linearization model along the iteration axis is first established by using the measurement input and output (I/O) data of agents. Then a data-driven distributed bipartite consensus iterative learning control (DBCILC) algorithm is proposed considering both fixed and switching topologies. Compared with existing bipartite consensus, the main characteristic is to construct the proposed control protocol without requiring any explicit or implicit information of MASs’ mathematical model. The difference from existing iterative learning control (ILC) approaches is that both the cooperative interactions and antagonistic interactions, and time-varying switching topologies are considered. Furthermore, through rigorous theoretical analysis, the proposed DBCILC approach can guarantee the bipartite consensus reducing tracking errors in the limited iteration steps. Moreover, although not all agents can receive information from the virtual leader directly, the proposed distributed scheme can maintain the performance and reduce the costs of communication. The results of three examples further illustrate the correctness, effectiveness, and applicability of the proposed algorithm

An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination

This article reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, task assignment, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations

Distributed filtering of networked dynamic systems with non-gaussian noises over sensor networks: A survey

summary:Sensor networks are regarded as a promising technology in the field of information perception and processing owing to the ease of deployment, cost-effectiveness, flexibility, as well as reliability. The information exchange among sensors inevitably suffers from various network-induced phenomena caused by the limited resource utilization and complex application scenarios, and thus is required to be governed by suitable resource-saving communication mechanisms. It is also noteworthy that noises in system dynamics and sensor measurements are ubiquitous and in general unknown but can be bounded, rather than follow specific Gaussian distributions as assumed in Kalman-type filtering. Particular attention of this paper is paid to a survey of recent advances in distributed filtering of networked dynamic systems with non-Gaussian noises over sensor networks. First, two types of widely employed structures of distributed filters are reviewed, the corresponding analysis is systematically addressed, and some interesting results are provided. The inherent purpose of adding consensus terms into the distributed filters is profoundly disclosed. Then, some representative models characterizing various network-induced phenomena are reviewed and their corresponding analytical strategies are exhibited in detail. Furthermore, recent results on distributed filtering with non-Gaussian noises are sorted out in accordance with different network-induced phenomena and system models. Another emphasis is laid on recent developments of distributed filtering with various communication scheduling, which are summarized based on the inherent characteristics of their dynamic behavior associated with mathematical models. Finally, the state-of-the-art of distributed filtering and challenging issues, ranging from scalability, security to applications, are raised to guide possible future research

A Relational Triple Extraction Method Based on Feature Reasoning for Technological Patents

The relation triples extraction method based on table filling can address the issues of relation overlap and bias propagation. However, most of them only establish separate table features for each relationship, which ignores the implicit relationship between different entity pairs and different relationship features. Therefore, a feature reasoning relational triple extraction method based on table filling for technological patents is proposed to explore the integration of entity recognition and entity relationship, and to extract entity relationship triples from multi-source scientific and technological patents data. Compared with the previous methods, the method we proposed for relational triple extraction has the following advantages: 1) The table filling method that saves more running space enhances the speed and efficiency of the model. 2) Based on the features of existing token pairs and table relations, reasoning the implicit relationship features, and improve the accuracy of triple extraction. On five benchmark datasets, we evaluated the model we suggested. The result suggest that our model is advanced and effective, and it performed well on most of these datasets

Unsupervised Semantic Representation Learning of Scientific Literature Based on Graph Attention Mechanism and Maximum Mutual Information

Since most scientific literature data are unlabeled, this makes unsupervised graph-based semantic representation learning crucial. Therefore, an unsupervised semantic representation learning method of scientific literature based on graph attention mechanism and maximum mutual information (GAMMI) is proposed. By introducing a graph attention mechanism, the weighted summation of nearby node features make the weights of adjacent node features entirely depend on the node features. Depending on the features of the nearby nodes, different weights can be applied to each node in the graph. Therefore, the correlations between vertex features can be better integrated into the model. In addition, an unsupervised graph contrastive learning strategy is proposed to solve the problem of being unlabeled and scalable on large-scale graphs. By comparing the mutual information between the positive and negative local node representations on the latent space and the global graph representation, the graph neural network can capture both local and global information. Experimental results demonstrate competitive performance on various node classification benchmarks, achieving good results and sometimes even surpassing the performance of supervised learning