Robust consensus tracking control for multiagent systems with initial state shifts, disturbances, and switching topologies

Dynamic consensus of linear multi-agent system using self-triggered distributed model predictive control

This article discusses self-triggering algorithm using distributed model predictive control (DMPC) to achieve dynamic consensus in linear multi-agent systems (MASs). The iterative computations and communications required at each time step in traditional consensus algorithms cause escalation of the energy consumption and shorten the life span of the MAS. An attempt to solve this problem is made by proposing a sequential self-triggering consensus algorithm, where each agent computes its own triggering instants. A Laguerre based DMPC design is adopted that notably reduces the computational complexity of conventional DMPC. The proposed self-triggered DMPC algorithm optimizes the control input and triggering interval while guaranteeing the dynamic consensus of the agents. By virtue of the Laguerre function based control architecture, the additional computations owing to the self-triggered algorithm do not impose stress on the controller; yet reduce the load on communication resources. The equality constraint on the terminal state of the agents is utilized along with Lyapunov criteria to establish the closed loop stability of the MAS. The proposed scheme achieves a considerable drop in controller design computations as well as data transmissions among agents, and the same is established by comparing these traits of existing schemes while achieving comparable performance. The proposed algorithm is verified through simulation of platoon configuration of vehicles, each of which is modeled as a linear multi-input multi-output (MIMO) system.

Iterative learning approach for consensus tracking of partial difference multi-agent systems with control delay under switching topology

In this paper, the consensus tracking problem for the linear and nonlinear partial difference multi-agent systems with switching communication topology and control delay is investigated. Based on relative local measurements of neighboring followers, while considering spatio-temporal discretization and initial state deviation, a discrete distributed consensus protocol with initial value learning is designed for each agent via D-type iterative learning approach. Through rigorous mathematical theoretical analysis, the necessary and sufficient conditions are obtained. Under the switching of the communication topology, these conditions ensure that the consensus tracking control of the MASs can be solved. After applying the designed protocol, in the sense of the L² norm and along the positive direction of the iteration axis, the consensus tracking error between any two agents can converge to zero. Finally, some simulation examples are used to demonstrate the validity of the protocol and theoretical results.

Model-Free Adaptive Iterative Learning Bipartite Containment Control for Multi-Agent Systems

This paper studies the bipartite containment tracking problem for a class of nonlinear multi-agent systems (MASs), where the interactions among agents can be both cooperative or antagonistic. Firstly, by the dynamic linearization method, we propose a novel model-free adaptive iterative learning control (MFAILC) to solve the bipartite containment problem of MASs. The designed controller only relies on the input and output data of the agent without requiring the model information of MASs. Secondly, we give the convergence condition that the containment error asymptotically converges to zero. The result shows that the output states of all followers will converge to the convex hull formed by the output states of leaders and the symmetric output states of leaders. Finally, the simulation verifies the effectiveness of the proposed method.

Data-Driven Adaptive Consensus Learning From Network Topologies

The problem of consensus learning from network topologies is studied for strongly connected nonlinear nonaffine multiagent systems (MASs). A linear spatial dynamic relationship (LSDR) is built at first to formulate the dynamic I/O relationship between an agent and all the other agents that are communicated through the networked topology. The LSDR consists of a linear parametric uncertain term and a residual nonlinear uncertain term. Utilizing the LSDR, a data-driven adaptive learning consensus protocol (DDALCP) is proposed to learn from both time dynamics of agent itself and spatial dynamics of the whole MAS. The parametric uncertainty and nonlinear uncertainty are estimated through an estimator and an observer respectively to improve robustness. The proposed DDALCP has a strong learning ability to improve the consensus performance because time dynamics and network topology information are both considered. The proposed consensus learning method is data-driven and has no dependence on the system model. The theoretical results are demonstrated by simulations.

Consensus Control for Heterogeneous Multivehicle Systems: An Iterative Learning Approach

This article investigates the consensus tracking problem of the heterogeneous multivehicle systems (MVSs) under a repeatable control environment. First, a unified iterative learning control (ILC) algorithm is presented for all autonomous vehicles, each of which is governed by both discrete- and continuous-time nonlinear dynamics. Then, several consensus criteria for MVSs with switching topology and external disturbances are established based on our proposed distributed ILC protocols. For discrete-time systems, all vehicles can perfectly track to the common reference trajectory over a specified finite time interval, and the corresponding digraphs may not have spanning trees. Existing approaches dealing with the continuous-time systems generally require that all vehicles have strictly identical initial conditions, being too ideal in practice. We relax this unpractical assumption and propose an extra distributed initial state learning protocol such that vehicles can take different initial states, leading to the fact that the finite time tracking is achieved ultimately regardless of the initial errors. Finally, a numerical example demonstrates the effectiveness of our theoretical results.

Convergence Analysis of Robust Iterative Learning Control Against Nonrepetitive Uncertainties: System Equivalence Transformation

This article is concerned with the robust convergence analysis of iterative learning control (ILC) against nonrepetitive uncertainties, where the contradiction between convergence conditions for the output tracking error and the input signal (or error) is addressed. A system equivalence transformation (SET) is proposed for robust ILC such that given any desired reference trajectories, the output tracking problems for general nonsquare multi-input, multi-output (MIMO) systems can be equivalently transformed into those for the specific class of square MIMO systems with the same input and output numbers. As a benefit of SET, a unified condition is only needed to guarantee both the uniform boundedness of all system signals and the robust convergence of the output tracking error, which avoids causing the condition contradiction problem in implementing the double-dynamics analysis approach to ILC. Simulation examples are included to demonstrate the validity of our established robust ILC results.

Data-Driven Terminal Iterative Learning Consensus for Nonlinear Multiagent Systems With Output Saturation

This article considers the problem of finite-time consensus for nonlinear multiagent systems (MASs), where the nonlinear dynamics are completely unknown and the output saturation exists. First, the mapping relationship between the output of each agent at the terminal time and the control input is established along the iteration domain. By using the terminal iterative learning control method, two novel distributed data-driven consensus protocols are proposed depending on the input and output saturated data of agents and its neighbors. Then, the convergence conditions independent of agents' dynamics are developed for the MASs with fixed communication topology. It is shown that the proposed data-driven protocol can guarantee the system to achieve two different finite-time consensus objectives. Meanwhile, the design is also extended to the case of switching topologies. Finally, the effectiveness of the data-driven protocol is validated by a simulation example.

Stability Analysis of Multi-Agent Tracking Systems with Quasi-Cyclic Switching Topologies

In this paper, the stability problem of a class of multi-agent tracking systems with quasi-cyclic switching topologies is investigated. The existing results of systems with switching topologies are usually achieved based on the assumption that the piecewise constant communication topologies are connected and the switchings are cyclic. The communication topologies are possible to be unconnected and it is difficult to guarantee the topologies switch circularly. The piecewise unconnected topology makes the interactive multi-agent tracking system to be an unstable subsystem over this time interval. In order to relax the assumption constraint, a quasi-cyclic method is proposed, which allows the topologies of multi-agent systems to switch in a less conservative way. Moreover, the stability of the tracking system with the existence of unstable subsystems is analyzed based on switched control theory. It is obtained that the convergence rate is affected by the maximum dwell time of unstable subsystems. Finally, a numerical example is provided to demonstrate the effectiveness of the theoretical results.

RBFNN-Based Data-Driven Predictive Iterative Learning Control for Nonaffine Nonlinear Systems

In this paper, a novel data-driven predictive iterative learning control (DDPILC) scheme based on a radial basis function neural network (RBFNN) is proposed for a class of repeatable nonaffine nonlinear discrete-time systems subjected to nonrepetitive external disturbances. First, by utilizing the dynamic linearization technique (DLT) with a newly introduced and unknown system parameter pseudopartial derivative (PPD) and designing a new RBFNN estimation algorithm along the iterative learning axis for addressing the unknown PPD and the unknown nonrepetitive external disturbances, a data-driven prediction model is established. It is theoretically shown that by constructing a composite energy function (CEF) with respect to the modeling error for the first time, the convergence of the modeling error via the proposed DLT-based RBFNN modeling method can be guaranteed, and the convergence speed is tunable. Then, a DDPILC with a disturbance compensation term is designed, and the convergence of the tracking control error is analyzed. Finally, simulations of a train operation system reveal that even if the train suffers from randomly varying load disturbances and nonlinear running resistance, the proposed scheme can make both the modeling error and the tracking control error decrease successively with increasing operation number.

A class of cooperative relay analysis of multi-agent systems with tracking number switching and time delays

This paper investigates a complicated class of cooperative tracking problems with time-varying number of tracking agents and communication time delays. During the entire tracking process, tracking agents are dynamically changing and the number is not fixed. This results in jumping of tracking errors and dynamic dimensions of the corresponding Laplacian matrices. Consequently, the stability analysis turns to be difficult especially when the effect of communication time delays is taken into consideration. In order to solve this issue, a new type of average Lyapunov function is constructed to compensate the unmatched dimensions of communication topologies over different time intervals. Generalized reciprocally convex Lemma and a more relaxed switched technique are employed to achieve a less conservative switched stability condition for the multi-agent system with variable tracking number and time delays. Finally, through a series of numerical simulations, the effectiveness and feasibility of derived results are verified. The relationship between maximum allowable communication time delays and various control parameters is obtained in a quantitative way.

Convergence Conditions for Solving Robust Iterative Learning Control Problems Under Nonrepetitive Model Uncertainties

Learning from saved measurement and control data to refine the performance of output tracking is the core feature of iterative learning control (ILC). Even though this implementation process of ILC does not need any model knowledge, ILC typically requires the strict repetitiveness of the control systems, especially on the plant models of them. The questions of interest in this paper are: 1) whether and how can robust ILC problems be solved with respect to the nonrepetitive (or iteration-dependent) model uncertainties and 2) can convergence conditions be developed with the effective contraction mapping (CM)-based approach to ILC? The answers to these questions are affirmative, and the CM-based approach is applicable to robust ILC that accommodates certain nonrepetitive uncertainties, especially in the plant models. In particular, an H_∞ -norm condition is proposed to ensure the robust ILC convergence, which can be solved to determine learning gain matrices. Simulation tests are performed to illustrate the validity of our presented H_∞ -based analysis results.

Adaptive Sliding Mode Consensus Tracking for Second-Order Nonlinear Multiagent Systems With Actuator Faults

This paper investigates the consensus tracking problem of second-order nonlinear multiagent systems (MAS) with disturbance and actuator fault by the sliding mode control method. The communication topology of the MAS is directed and only part of the followers have access to the leader's information. First, a discontinuous sliding mode tracking protocol is studied for consensus tracking of the MAS. Second, to address the shortcoming of chattering and difficulty of setting the control gain in the discontinuous protocol, a continuous sliding mode tracking protocol with an adaptive mechanism is developed. The adaptive mechanism will adjust the gain of the control automatically and enable the tracking protocol to work well without prior knowledge of the MAS. Third, the performance of the adaptive sliding mode protocol for consensus tracking of the MAS in the presence of actuator faults of biased fault and partial loss of effectiveness fault is further investigated. Finally, numerical simulations are performed to illustrate the efficiency of the theoretical results.

Practical Time-Varying Formation Tracking for Second-Order Nonlinear Multiagent Systems With Multiple Leaders Using Adaptive Neural Networks

Practical time-varying formation tracking problems for second-order nonlinear multiagent systems with multiple leaders are investigated using adaptive neural networks (NNs), where the time-varying formation tracking error caused by time-varying external disturbances can be arbitrarily small. Different from the previous work, there exists a predefined time-varying formation formed by the states of the followers and the formation tracks the convex combination of the states of the leaders with unknown control inputs. Besides, the dynamics of each agent has both matched/mismatched heterogeneous nonlinearities and disturbances simultaneously. First, a practical time-varying formation tracking protocol using adaptive NNs is proposed, which is constructed using only local neighboring information. The proposed control protocol can process not only the matched/mismatched heterogeneous nonlinearities and disturbances, but also the unknown control inputs of the leaders. Second, an algorithm with three steps is introduced to design the practical formation tracking protocol, where the parameters of the protocol are determined, and the practical time-varying formation tracking feasibility condition is given. Third, the stability of the closed-loop multiagent system is proven by using the Lyapunov theory. Finally, a simulation example is showed to illustrate the effectiveness of the obtained theoretical results.

Computationally Efficient Data-Driven Higher Order Optimal Iterative Learning Control

Based on a nonlifted iterative dynamic linearization formulation, a novel data-driven higher order optimal iterative learning control (DDHOILC) is proposed for a class of nonlinear repetitive discrete-time systems. By using the historical data, additional tracking errors and control inputs in previous iterations are used to enhance the online control performance. From the online data, additional control inputs of previous time instants within the current iteration are utilized to improve transient response. The data-driven property of the proposed method implies that no model information except for the I/O data is utilized. The computational complexity is reduced by avoiding matrix inverse operation in the proposed DDHOILC approach due to the nonlifted linear formulation of the original model. The asymptotic convergence is proved rigorously. Furthermore, the convergence property is analyzed and evaluated via three performance indexes. By elaborately selecting the higher order factors, the higher order learning control law outperforms the lower order one in terms of convergence performance. Simulation results verify the effectiveness of the proposed approach.

Deterministic Convergence for Learning Control Systems Over Iteration-Dependent Tracking Intervals

This brief addresses the iterative learning control (ILC) problems for discrete-time systems subject to iteration-dependent tracking time intervals. A modified class of P-type ILC algorithms is proposed by properly defining an available modified output, for which robust convergence analysis is performed with an inductive approach. It is shown that if a persistent full-learning property is ensured, then a necessary and sufficient convergence condition of ILC can be derived to reach the perfect output tracking objective though the tracking time interval is iteration-dependent. That is, the tracking of ILC for iteration-dependent time intervals can be guaranteed in the same deterministic (not stochastic) convergence way as that of traditional ILC over a fixed time interval. Furthermore, the developed tracking results can be extended to admit iteration-dependent uncertainties in initial state and external disturbances. Simulation tests are also included to demonstrate the effectiveness of the modified P-type ILC.

Data-Driven Learning Control for Stochastic Nonlinear Systems: Multiple Communication Constraints and Limited Storage

This paper proposes a data-driven learning control method for stochastic nonlinear systems under random communication conditions, including data dropouts, communication delays, and packet transmission disordering. A renewal mechanism is added to the buffer to regulate the arrived packets, and a recognition mechanism is introduced to the controller for the selection of suitable update packets. Both intermittent and successive update schemes are proposed based on the conventional P-type iterative learning control algorithm, and are shown to converge to the desired input with probability one. The convergence and effectiveness of the proposed algorithms are verified by means of illustrative simulations.

Data-Driven Multiagent Systems Consensus Tracking Using Model Free Adaptive Control

This paper investigates the data-driven consensus tracking problem for multiagent systems with both fixed communication topology and switching topology by utilizing a distributed model free adaptive control (MFAC) method. Here, agent's dynamics are described by unknown nonlinear systems and only a subset of followers can access the desired trajectory. The dynamical linearization technique is applied to each agent based on the pseudo partial derivative, and then, a distributed MFAC algorithm is proposed to ensure that all agents can track the desired trajectory. It is shown that the consensus error can be reduced for both time invariable and time varying desired trajectories. The main feature of this design is that consensus tracking can be achieved using only input-output data of each agent. The effectiveness of the proposed design is verified by simulation examples.

Adaptive Boundary Iterative Learning Control for an Euler-Bernoulli Beam System With Input Constraint

This paper addresses the vibration control and the input constraint for an Euler-Bernoulli beam system under aperiodic distributed disturbance and aperiodic boundary disturbance. Hyperbolic tangent functions and saturation functions are adopted to tackle the input constraint. A restrained adaptive boundary iterative learning control (ABILC) law is proposed based on a time-weighted Lyapunov-Krasovskii-like composite energy function. In order to deal with the uncertainty of a system parameter and reject the external disturbances, three adaptive laws are designed and learned in the iteration domain. All the system states of the closed-loop system are proved to be bounded in each iteration. Along the iteration axis, the displacements asymptotically converge toward zero. Simulation results are provided to illustrate the effectiveness of the proposed ABILC scheme.

Adaptive Iterative Learning Control for Linear Systems With Binary-Valued Observations

This brief presents a novel adaptive iterative learning control (ILC) algorithm for a class of single parameter systems with binary-valued observations. Using the certainty equivalence principle, the adaptive ILC algorithm is designed by employing a projection identification algorithm along the iteration axis. It is shown that, even though the available system information is very limited and the desired trajectory is iteration-varying, the proposed adaptive ILC algorithm can guarantee the convergence of parameter estimation over a finite-time interval along the iterative axis; meanwhile, the tracking error is pointwise convergence asymptotically. Two examples are given to validate the effectiveness of the algorithm.

Quantized Iterative Learning Consensus Tracking of Digital Networks With Limited Information Communication

This brief investigates the quantized iterative learning problem for digital networks with time-varying topologies. The information is first encoded as symbolic data and then transmitted. After the data are received, a decoder is used by the receiver to get an estimate of the sender's state. Iterative learning quantized communication is considered in the process of encoding and decoding. A sufficient condition is then presented to achieve the consensus tracking problem in a finite interval using the quantized iterative learning controllers. Finally, simulation results are given to illustrate the usefulness of the developed criterion.

Finite-Time Consensus of Multiagent Systems With a Switching Protocol

In this paper, we study the problem of finite-time consensus of multiagent systems on a fixed directed interaction graph with a new protocol. Existing finite-time consensus protocols can be divided into two types: 1) continuous and 2) discontinuous, which were studied separately in the past. In this paper, we deal with both continuous and discontinuous protocols simultaneously, and design a centralized switching consensus protocol such that the finite-time consensus can be realized in a fast speed. The switching protocol depends on the range of the initial disagreement of the agents, for which we derive an exact bound to indicate at what time a continuous or a discontinuous protocol should be selected to use. Finally, we provide two numerical examples to illustrate the superiority of the proposed protocol and design method.