Finite-time consensus and collision avoidance control algorithms for multiple AUVs

In this paper, finite-time position consensus and collision avoidance problems are investigated for multi-AUV (autonomous underwater vehicle) systems. First, based on the homogeneous control method, finite-time position consensus algorithms are proposed for both leaderless and leader–follower multi-AUV systems without considering collisions between the AUVs. Specifically, in the leader–follower case, a novel distributed finite-time observer is developed for the followers to estimate the leader’s velocity. Second, by constructing collision avoidance and connectivity maintenance functions, modified consensus algorithms containing corresponding gradient terms are presented for multi-AUV systems of both cases, which guarantee collision avoidance, connectivity maintenance, velocity matching, and consensus boundedness. Simulations demonstrate the effectiveness of the proposed control algorithms.     

Finite-time formation control for multi-agent systems

In this paper, we develop a new finite-time formation control framework for multi-agent systems with a large population of members. In this framework, we divide the formation information into two independent parts, namely, the global information and the local information. The global formation information decides the geometric pattern of the desired formation. Furthermore, it is assumed that only a small number of agents, which are responsible for the navigation of the whole team, can obtain the global formation information, and the other agents regulate their positions by the local information in a distributed manner. This approach can greatly reduce the data exchange and can easily realize various kinds of complex formations. As a theoretical preparation, we first propose a class of nonlinear consensus protocols, which ensures that the related states of all agents will reach an agreement in a finite time under suitable conditions. And then we apply these consensus protocols to the formation control, including time-invariant formation, time-varying formation and trajectory tracking, respectively. It is shown that all agents will maintain the expected formation in a finite time. Finally, several simulations are worked out to illustrate the effectiveness of our theoretical results.     

Finite-time consensus for multi-agent systems with globally bounded convergence time under directed communication graphs

In this paper, we study the finite-time consensus problems with globally bounded convergence time also known as fixed-time consensus problems for multi-agent systems subject to directed communication graphs. Two new distributed control strategies are proposed such that leaderless and leader-follower consensus are achieved with convergence time independent on the initial conditions of the agents. Fixed-time formation generation and formation tracking problems are also solved as the generalizations. Simulation examples are provided to demonstrate the performance of the new controllers.     

Finite-time and fixed-time leader-following consensus for multi-agent systems with discontinuous inherent dynamics

This paper is concerned with finite-time and fixed-time consensus of multi-agent systems in a leader-following framework. Different from conventional leader-following tracking approaches where inherent dynamics satisfying the Lipschitz continuous condition is required, a more generalised case is investigated: discontinuous inherent dynamics. By nonsmooth techniques, a nonlinear protocol is first proposed to achieve the finite-time leader-following consensus. Then, based on fixed-time stability strategies, the fixed-time leader-following consensus problem is solved. An upper bound of settling time is obtained by using a new protocol, and such a bound is independent of initial states, thereby providing additional options for designers in practical scenarios where initial conditions are unavailable. Finally, numerical simulations are provided to demonstrate the effectiveness of the theoretical results.     

Finite-time consensus for multi-agent networks with unknown inherent nonlinear dynamics

The objective of this paper is to analyze the finite-time convergence of a nonlinear but continuous consensus algorithm for multi-agent networks with unknown inherent nonlinear dynamics. Due to the existence of the unknown inherent nonlinear dynamics, the stability analysis and the finite-time convergence analysis are more challenging than those under the well-studied consensus algorithms for known linear systems. For this purpose, we propose a novel comparison based tool. By using this tool, it is shown that the proposed nonlinear consensus algorithm can guarantee finite-time convergence if the directed switching interaction graph has a directed spanning tree at each time interval. Specifically, the finite-time convergence is shown by comparing the closed-loop system under the proposed consensus algorithm with some well-designed closed-loop system whose stability properties are easier to obtain. Moreover, the stability and the finite-time convergence of the closed-loop system using the proposed consensus algorithm under a (general) directed switching interaction graph can even be guaranteed by the stability and the finite-time convergence of some well-designed nonlinear closed-loop system under some special directed switching interaction graph. This provides a stimulating example for the potential applications of the proposed comparison based tool in the stability analysis of linear/nonlinear closed-loop systems by making use of known results in linear/nonlinear systems.     

Finite-time consensus control for second-order multi-agent systems without velocity measurements

This paper investigates the finite-time consensus problem for second-order multi-agent systems with unknown velocities and disturbances. By introducing the second-order sliding mode observer, two novel distributed finite-time protocols with only relative position measurements are proposed for the both cases with known and unknown boundaries of disturbances. On the basis of Lyapunov stability theorem and homogeneous theory, it is proved that the consensus can be achieved in finite time. Simulation examples are provided to show the effectiveness of the theoretical results.     

Adaptive finite-time consensus in multi-agent networks

This paper is concerned with the finite-time consensus problem of distributed agents having non-identical unknown nonlinear dynamics, to a leader agent that also has unknown nonlinear control input signal. By parameterization of unknown nonlinear dynamics, a Lyapunov technique in conjunction with homogeneity technique is presented for designing a decentralized adaptive finite-time consensus control protocol in undirected networks. Homogeneous Lyapunov functions and homogeneous vector fields are introduced in the stability analysis although the whole system is not homogeneous. Theoretical analysis shows that leader-following consensus can be achieved in finite-time, meanwhile, finite-time parameter convergence can be also guaranteed under the proposed control scheme. An example is given to validate the theoretical results.     

Finite-time consensus for multi-agent systems via nonlinear control protocols

This paper investigates the fnite-time consensus problem of multi-agent systems with single and double integrator dynamics,respectively.Some novel nonlinear protocols are constructed for frst-order and second-order leader-follower multi-agent systems,respectively.Based on the fnite-time control technique,the graph theory and Lyapunov direct method,some theoretical results are proposed to ensure that the states of all the follower agents can converge to its leader agent s state in fnite time.Finally,some simulation results are presented to illustrate the efectiveness of our theoretical results.     

Stochastic consensus of double-integrator leader-following multi-agent systems with measurement noises and time delays

This paper studies a leader-following consensus problem of continuous-time double-integrator multi-agent systems with measurement noises and time-varying communication delays under directed topology. By utilising the neighbour position and velocity information, which are delayed and disturbed by measurement noises whose intensities are considered a function related to the neighbour position and velocity of agents, a distributed consensus protocol is presented, sufficient conditions of the tracking consensus in the sense of mean square are derived. Finally, the effectiveness of the proposed consensus protocol is proved by some simulations.     

Finite-time consensus for stochastic multi-agent systems

In this article, we study the finite-time consensus in probability for stochastic multi-agent systems. First, we give the nonlinear consensus protocol for multi-agent systems with Gaussian white noise, and define the concept of finite-time consensus in probability. Second, we prove that multi-agent systems can achieve the finite-time consensus in probability under five different kinds of communication topologies by using graph theory, stochastic Lyapunov theory and probability theory. Finally, some simulation examples are provided to illustrate the effectiveness of the theoretical results.     

Constrained optimal consensus in multi-agent systems with single- and double-integrator dynamics

ABSTRACT

This paper fully studies distributed optimal consensus problem in undirected dynamical networks. We consider a group of networked agents that are supposed to rendezvous at the optimal point of a collective convex objective function. Each agent has no knowledge about the global objective function and only has access to its own local objective function, which is a portion of the global one, and states information of agents within its neighbourhood set. In this setup, all agents coordinate with their neighbours to seek the consensus point that minimises the network's global objective function. In the current paper, we consider agents with single-integrator and double-integrator dynamics. Further, it is supposed that agents' movements are limited by some convex inequality constraints. In order to find the optimal consensus point under the described scenario, we combine the interior-point optimisation algorithm with a consensus protocol and propose a distributed control law. The associated convergence analysis based on Lyapunov stability analysis is provided.     

Finite-time consensus tracking for multi-agent systems with inherent uncertainties and disturbances

In this paper, finite-time consensus tracking is investigated via time-varying feedback for uncertain nonlinear multi-agent systems (NMASs). The presence of inherent uncertainties and disturbances in the NMASs highlights the main novelty : (1) The inherent uncertainties imply that more serious unknowns and time-variations are allowed in the nonlineartities and the control coefficients of the NMASs. (2) The inherent disturbances mean that the upper bound of the disturbances is unknown. To compensate the inherent uncertainties and disturbances, time-varying protocols are proposed by integrating time-varying technique and sliding mode method. Based on the proposed protocols, the finite-time leader-following consensus and finite-time containment are achieved under directed graph. Finally, the validation of the proposed protocols is verified by two examples.     

Second-order consensus in multi-agent dynamical systems with sampled position data

This paper studies second-order consensus in multi-agent dynamical systems with sampled position data. A distributed linear consensus protocol with second-order dynamics is designed, where both the current and some sampled past position data are utilized. It is found that second-order consensus in such a multi-agent system cannot be reached without any sampled position data under the given protocol while it can be achieved by appropriately choosing the sampling period. A necessary and sufficient condition for reaching consensus of the system in this setting is established, based on which consensus regions are then characterized. It is shown that if all the eigenvalues of the Laplacian matrix are real, then second-order consensus in the multi-agent system can be reached for any sampling period except at some critical points depending on the spectrum of the Laplacian matrix. However, if there exists at least one eigenvalue of the Laplacian matrix with a nonzero imaginary part, second-order consensus cannot be reached for sufficiently small or sufficiently large sampling periods. In such cases, one nevertheless may be able to find some disconnected stable consensus regions determined by choosing appropriate sampling periods. Finally, simulation examples are given to verify and illustrate the theoretical analysis.     

Iterative learning approaches to design finite-time consensus protocols for multi-agent systems

In this paper, the finite-time output consensus problem of multi-agent systems is considered by using the iterative learning control (ILC) approach. Two classes of distributed protocols are constructed from the two-dimensional system point of view (with time step and iteration number as independent variables), and are termed as iterative learning protocols. If learning gains are chosen appropriately, then all agents in a directed graph can be enabled to achieve finite-time consensus with the iterative learning protocols. Moreover, all agents in a directed graph can be guaranteed to reach finite-time consensus at any desired terminal output if the iterative learning protocols are improved by introducing the desired terminal output to some (not necessarily all) of the agents. Simulation results are finally presented to illustrate the performance and effectiveness of our iterative learning protocols.     

Finite-time consensus of time-varying nonlinear multi-agent systems

This paper investigates the problem of leader–follower finite-time consensus for a class of time-varying nonlinear multi-agent systems. The dynamics of each agent is assumed to be represented by a strict feedback nonlinear system, where nonlinearities satisfy Lipschitz growth conditions with time-varying gains. The main design procedure is outlined as follows. First, it is shown that the leader–follower consensus problem is equivalent to a conventional control problem of multi-variable high-dimension systems. Second, by introducing a state transformation, the control problem is converted into the construction problem of two dynamic equations. Third, based on the Lyapunov stability theorem, the global finite-time stability of the closed-loop control system is proved, and the finite-time consensus of the concerned multi-agent systems is thus guaranteed. An example is given to verify the effectiveness of the proposed consensus protocol algorithm.     

Finite-time consensus for controlled dynamical systems in network

The key challenges in networked dynamical systems are the component heterogeneities, nonlinearities, and the high dimension of the formulated vector of state variables. In this paper, the emphasise is put on two classes of systems in network include most controlled driftless systems as well as systems with drift. For each model structure that defines homogeneous and heterogeneous multi-system behaviour, we derive protocols leading to finite-time consensus. For each model evolving in networks forming a homogeneous or heterogeneous multi-system, protocols integrating sufficient conditions are derived leading to finite-time consensus. Likewise, for the networking topology, we make use of fixed directed and undirected graphs. To prove our approaches, finite-time stability theory and Lyapunov methods are considered. As illustrative examples, the homogeneous multi-unicycle kinematics and the homogeneous/heterogeneous multi-second order dynamics in networks are studied.     

Finite-time observers for multi-agent systems without velocity measurements and with input saturations

This paper is devoted to the distributed finite-time observers for multi-agent systems, where the control inputs are required to be bounded and the velocities are assumed to be not available for feedback. An effective framework through defining a class of coordinated saturation functions is introduced, under which both a first-order finite-time observer and a high-order finite-time observer are constructed. By applying the homogeneous theory for stability analysis, it is proven that all the states of the followers can converge to that of the leader in finite time under our proposed observers. With mild modifications of our control strategies, the foregoing results are then extended to the distributed finite-time containment control problem, where the states of the followers converge to the convex hull spanned by the multiple dynamic leaders. Numerical simulations are presented to demonstrate the efficiency of our methods.     

Finite-time consensus for heterogeneous multi-agent systems with mixed-order agents

This paper studies the finite-time consensus for heterogeneous multi-agent systems composed of mixed-order agents over fixed and switching topologies. The control protocol of each agent using local information is designed and the detailed analysis of the finite-time consensus for fixed and switching interaction topologies is presented. The design of the finite-time consensus protocol is based on graph theory, matrix theory, and LaSalle’s invariance principle. Both theoretical studies and simulation results show the effectiveness of the proposed method and the correctness of the obtained theoretical results.     

Finite-time convergent gradient flows with applications to network consensus

This paper introduces the normalized and signed gradient dynamical systems associated with a differentiable function. Extending recent results on nonsmooth stability analysis, we characterize their asymptotic convergence properties and identify conditions that guarantee finite-time convergence. We discuss the application of the results to consensus problems in multi-agent systems and show how the proposed nonsmooth gradient flows achieve consensus in finite time.     

异构多智能体系统有限时间一致性分析

研究二阶智能体速度不可测情况下由一阶和二阶智能体构成的异构多智能体系统有限时间一致性问题。在固定拓扑结构下,给出了异构系统实现一致性的控制协议,通过LaSalle不变集原理和齐次控制方法得到了异构系统有限时间一致性的充分条件;在切换拓扑结构下,给出了异构系统一致性的控制协议,得到了异构系统有限时间一致性的充分条件。仿真结果验证了相关结果的有效性。