Stochastic bounded consensus of second-order multi-agent systems in noisy environment

This paper investigates the stochastic bounded consensus of leader-following second-order multi-agent systems in a noisy environment. It is assumed that each agent received the information of its neighbors corrupted by noises and time delays. Based on the graph theory, stochastic tools, and the Lyapunov function method, we derive the sufficient conditions under which the systems would reach stochastic bounded consensus in mean square with the protocol we designed. Finally, a numerical simulation is illustrated to check the effectiveness of the proposed algorithms.

Stochastic bounded consensus tracking of leader-follower multi-agent systems with measurement noises based on sampled data with general sampling delay

In this paper we provide a unified framework for consensus tracking of leader-follower multi-agent systems with measurement noises based on sampled data with a general sampling delay. First, a stochastic bounded consensus tracking protocol based on sampled data with a general sampling delay is presented by employing the delay decomposition technique. Then, necessary and sufficient conditions are derived for guaranteeing leader-follower multi-agent systems with measurement noises and a time-varying reference state to achieve mean square bounded consensus tracking. The obtained results cover no sampling delay, a small sampling delay and a large sampling delay as three special cases. Last, simulations are provided to demonstrate the effectiveness of the theoretical results.

Stochastic bounded consensus tracking of leader-follower multi-agent systems with measurement noises and sampled-data

This paper is concerned with the stochastic bounded consensus tracking problems of leader-follower multi-agent systems, where the control input of an agent can only use the information measured at the sampling instants from its neighbours or the virtual leader with a time-varying reference state, and the measurements are corrupted by random noises. The probability limit theory and the algebra graph theory are employed to derive the necessary and sufficient conditions guaranteeing the mean square bounded consensus tracking. It is shown that the maximum allowable upper boundary of the sampling period simultaneously depends on the constant feedback gains and the network topology. Furthermore, the effects of the sampling period on the tracking performance are analysed. It turns out that from the view point of the sampling period, there is a trade-off between the tracking speed and the static tracking error. Simulations are provided to demonstrate the effectiveness of the theoretical results.

Finite-time Prescribed Performance Time-Varying Formation Control for Second-Order Multi-Agent Systems With Non-Strict Feedback Based on a Neural Network Observer

This paper studies the problem of time-varying formation control with finite-time prescribed performance for nonstrict feedback second-order multi-agent systems with unmeasured states and unknown nonlinearities.To eliminate nonlinearities,neural networks are applied to approximate the inherent dynamics of the system.In addition,due to the limitations of the actual working conditions,each follower agent can only obtain the locally measurable partial state information of the leader agent.To address this problem,a neural network state observer based on the leader state information is designed.Then,a finite-time prescribed performance adaptive output feedback control strategy is proposed by restricting the sliding mode surface to a prescribed region,which ensures that the closed-loop system has practical finite-time stability and that formation errors of the multi-agent systems converge to the prescribed performance bound in finite time.Finally,a numerical simulation is provided to demonstrate the practicality and effectiveness of the developed algorithm.

Mean square consensus of uncertain discrete-time stochastic multi-agent systems with x-dependent noise

In this paper, the mean square consensus control problem is investigated for linear uncertain discrete-time multi-agent systems withx-dependent noise and time-varying delays. Under undirected connected topology, the robust consensus problem of multi-agent systems is converted into the robust stabilisation problem for thediscrete-time stochastic systems. By utilising Lyapunov functionaland the linear matrix inequality method, some new sufficient conditions are derived to guarantee the consensus of uncertain discretetime stochastic multi-agent systems. Based on the state feedbackcontroller protocol with time-varying delays, a new consensus criterion is established for the discrete-time stochastic multi-agent systems with parameter uncertainties. Finally, numerical examples areprovided to illustrate the effectiveness of the proposed results.

Bipartite consensus problems of Lurie multi-agent systems over signed graphs: A contraction approach

This paper examines the bipartite consensus problems for the nonlinear multi-agent systems in Lurie dynamics form with cooperative and competitive communication between different agents. Based on the contraction theory, some new conditions for the nonlinear Lurie multi-agent systems reaching bipartite leaderless consensus and bipartite tracking consensus are presented. Compared with the traditional methods, this approach degrades the dimensions of the conditions, eliminates some restrictions of the system matrix, and extends the range of the nonlinear function. Finally, two numerical examples are provided to illustrate the efficiency of our results.

Designing Proportional-Integral Consensus Protocols for Second-Order Multi-Agent Systems Using Delayed and Memorized State Information

This paper is concerned with consensus of a secondorder linear time-invariant multi-agent system in the situation that there exists a communication delay among the agents in the network.A proportional-integral consensus protocol is designed by using delayed and memorized state information.Under the proportional-integral consensus protocol,the consensus problem of the multi-agent system is transformed into the problem of asymptotic stability of the corresponding linear time-invariant time-delay system.Note that the location of the eigenvalues of the corresponding characteristic function of the linear time-invariant time-delay system not only determines the stability of the system,but also plays a critical role in the dynamic performance of the system.In this paper,based on recent results on the distribution of roots of quasi-polynomials,several necessary conditions for Hurwitz stability for a class of quasi-polynomials are first derived.Then allowable regions of consensus protocol parameters are estimated.Some necessary and sufficient conditions for determining effective protocol parameters are provided.The designed protocol can achieve consensus and improve the dynamic performance of the second-order multi-agent system.Moreover,the effects of delays on consensus of systems of harmonic oscillators/double integrators under proportional-integral consensus protocols are investigated.Furthermore,some results on proportional-integral consensus are derived for a class of high-order linear time-invariant multi-agent systems.

Hyperbolic Tangent Function-Based Protocols for Global/Semi-Global Finite-Time Consensus of Multi-Agent Systems

This paper investigates the problem of global/semi-global finite-time consensus for integrator-type multi-agent sys-tems.New hyperbolic tangent function-based protocols are pro-posed to achieve global and semi-global finite-time consensus for both single-integrator and double-integrator multi-agent systems with leaderless undirected and leader-following directed commu-nication topologies.These new protocols not only provide an explicit upper-bound estimate for the settling time,but also have a user-prescribed bounded control level.In addition,compared to some existing results based on the saturation function,the pro-posed approach considerably simplifies the protocol design and the stability analysis.Illustrative examples and an application demonstrate the effectiveness of the proposed protocols.

Computation Tree Logic Model Checking of Multi-Agent Systems Based on Fuzzy Epistemic Interpreted Systems

Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.

Computing large deviation prefactors of stochastic dynamical systems based on machine learning

We present a large deviation theory that characterizes the exponential estimate for rare events in stochastic dynamical systems in the limit of weak noise.We aim to consider a next-to-leading-order approximation for more accurate calculation of the mean exit time by computing large deviation prefactors with the aid of machine learning.More specifically,we design a neural network framework to compute quasipotential,most probable paths and prefactors based on the orthogonal decomposition of a vector field.We corroborate the higher effectiveness and accuracy of our algorithm with two toy models.Numerical experiments demonstrate its powerful functionality in exploring the internal mechanism of rare events triggered by weak random fluctuations.

Event-triggered robust cooperative output regulation for a class of linear multi-agent systems with an unknown exosystem

This paper investigates the robust cooperative output regulation problem for a class of heterogeneousuncertain linear multi-agent systems with an unknown exosystem via event-triggered control (ETC). By utilizingthe internal model approach and the adaptive control technique, a distributed adaptive internal model isconstructed for each agent. Then, based on this internal model, a fully distributed ETC strategy composed ofa distributed event-triggered adaptive output feedback control law and a distributed dynamic event-triggeringmechanism is proposed, in which each agent updates its control input at its own triggering time instants. It isshown that under the proposed ETC strategy, the robust cooperative output regulation problem can be solvedwithout requiring either the global information associated with the communication topology or the bounds ofthe uncertain or unknown parameters in each agent and the exosystem. A numerical example is provided toillustrate the effectiveness of the proposed control strategy.

Pure State Feedback Switching Control Based on the Online Estimated State for Stochastic Open Quantum Systems

For the n-qubit stochastic open quantum systems,based on the Lyapunov stability theorem and LaSalle’s invariant set principle,a pure state switching control based on on-line estimated state feedback(short for OQST-SFC)is proposed to realize the state transition the pure state of the target state including eigenstate and superposition state.The proposed switching control consists of a constant control and a control law designed based on the Lyapunov method,in which the Lyapunov function is the state distance of the system.The constant control is used to drive the system state from an initial state to the convergence domain only containing the target state,and a Lyapunov-based control is used to make the state enter the convergence domain and then continue to converge to the target state.At the same time,the continuous weak measurement of quantum system and the quantum state tomography method based on the on-line alternating direction multiplier(QST-OADM)are used to obtain the system information and estimate the quantum state which is used as the input of the quantum system controller.Then,the pure state feedback switching control method based on the on-line estimated state feedback is realized in an n-qubit stochastic open quantum system.The complete derivation process of n-qubit QST-OADM algorithm is given;Through strict theoretical proof and analysis,the convergence conditions to ensure any initial state of the quantum system to converge the target pure state are given.The proposed control method is applied to a 2-qubit stochastic open quantum system for numerical simulation experiments.Four possible different position cases between the initial estimated state and that of the controlled system are studied and discussed,and the performances of the state transition under the corresponding cases are analyzed.

Robust adaptive leaderless consensus of unknown non-minimum phase linear multi-agent systems subject to disturbances and/or unmodeled dynamics

This article investigates the problem of robust adaptive leaderless consensus for heterogeneous uncertain nonminimumphase linear multi-agent systems over directed communication graphs. Each agent is assumed tobe of unknown nominal dynamics and also subject to external disturbances and/or unmodeled dynamics. Anovel distributed robust adaptive control strategy is proposed. It is shown that the robust adaptive leaderlessconsensus problem is solved with the proposed control strategy under some sufficient conditions. Two examplesare provided to demonstrate the efficacy of the proposed control strategy.

Distributed Adaptive Predefined-Time Bipartite Containment Algorithm for Nonlinear Multi-Agent Systems with Actuator Faults

Distributed adaptive predefined-time bipartite containment for a class of second-order nonlinear multi-agent systems are studied with actuator faults.The communication topology of multi-agent systems is fixed and directed.To ensure that followers can reach the convex hull spanned by leaders under the conditions of actuator faults,the sliding mode method is introduced.Control protocol for multi-agent systems demonstrates its effectiveness.Finally,simulations are provided to verify the effectiveness of the proposed algorithm.

Iterative Learning Control for Discrete-time Stochastic Systems with Quantized Information

An iterative learning control (ILC) algorithm using quantized error information is given in this paper for both linear and nonlinear discrete-time systems with stochastic noises. A logarithmic quantizer is used to guarantee an adaptive improvement in tracking performance. A decreasing learning gain is introduced into the algorithm to suppress the effects of stochastic noises and quantization errors. The input sequence is proved to converge strictly to the optimal input under the given index. Illustrative simulations are given to verify the theoretical analysis. © 2014 Chinese Association of Automation.

Formation-Containment Control Using Dynamic Event-Triggering Mechanism for Multi-Agent Systems

The paper proposes a novel approach for formationcontainment control based on a dynamic event-triggering mechanism for multi-agent systems.The leader-leader and follower-follower communications are reduced by utilizing the distributed dynamic event-triggered framework.We consider two separate sets of design parameters:one set comprising control and dynamic event-triggering parameters for the leaders and a second set similar to the first one with different values for the followers.The proposed algorithm includes two novel stages of codesign optimization to simultaneously compute the two sets of parameters.The design optimizations are convex and use the weighted sum approach to enable a structured trade-off between the formation-containment convergence rate and associated communications.Simulations based on non-holonomic mobile robot multi-agent systems quantify the effectiveness of the proposed approach.

Secure Impulsive Synchronization in Lipschitz-Type Multi-Agent Systems Subject to Deception Attacks

Cyber attacks pose severe threats on synchronization of multi-agent systems.Deception attack,as a typical type of cyber attack,can bypass the surveillance of the attack detection mechanism silently,resulting in a heavy loss.Therefore,the problem of mean-square bounded synchronization in multi-agent systems subject to deception attacks is investigated in this paper.The control signals can be replaced with false data from controllerto-actuator channels or the controller.The success of the attack is measured through a stochastic variable.A distributed impulsive controller using a pinning strategy is redesigned,which ensures that mean-square bounded synchronization is achieved in the presence of deception attacks.Some sufficient conditions are derived,in which upper bounds of the synchronization error are given.Finally,two numerical simulations with symmetric and asymmetric network topologies are given to illustrate the theoretical results.

Consensus Control of Leader-Following Multi-Agent Systems in Directed Topology With Heterogeneous Disturbances

This paper investigates the consensus problem for linear multi-agent systems with the heterogeneous disturbances generated by the Brown motion.Its main contribution is that a control scheme is designed to achieve the dynamic consensus for the multi-agent systems in directed topology interfered by stochastic noise.In traditional ways,the coupling weights depending on the communication structure are static.A new distributed controller is designed based on Riccati inequalities,while updating the coupling weights associated with the gain matrix by state errors between adjacent agents.By introducing time-varying coupling weights into this novel control law,the state errors between leader and followers asymptotically converge to the minimum value utilizing the local interaction.Through the Lyapunov directed method and It?formula,the stability of the closed-loop system with the proposed control law is analyzed.Two simulation results conducted by the new and traditional schemes are presented to demonstrate the effectiveness and advantage of the developed control method.

Swarming behavior of multi-agent systems

We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite size around the swarm center in a finite time. Moreover, we extend our results to more general attraction/repulsion functions. Numerical simulations demonstrate that all agents will eventually enter into and remain in a bounded region around the swarm center which may exhibit complex spiral motion due to asymmetry of the coupling structure. The model in this paper is more general than isotropic swarms and our results provide further insight into the effect of the interaction pattern on individual motion in a swarm system.

Consensus of high-order dynamic multi-agent systems with switching topology and time-varying delays

This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed consensus protocol is proposed, which only depends on the agent＇s own information and its neighbors＇ partial information. By introducing a decomposition of the state vector and performing a state space transformation, the closed-loop dynamics of the multi-agent system is converted into two decoupled subsystems. Based on the decoupled subsystems, some sufficient conditions for the convergence to consensus are established, which provide the upper bounds on the admissible communication delays. Also, the explicit expression of the consensus state is derived. Moreover, the results on the consensus seeking of the group of high-order agents have been extended to a network of agents with dynamics modeled as a completely controllable linear time-invariant system. It is proved that the convergence to consensus of this network is equivalent to that of the group of high-order agents. Finally, some numerical examples are given to demonstrate the effectiveness of the main results.