Next Article in Journal
Integrating Vision Transformer and Time–Frequency Analysis for Stock Volatility Prediction
Previous Article in Journal
Image Distillation with the Machine-Learned Gradient of the Loss Function and the K-Means Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Adaptive Consensus Control of Multiple Underactuated Marine Surface Vessels with Input Saturation and Severe Uncertainties

1
School of Artificial Intelligence, Yantai Institute of Technology, Yantai 264005, China
2
School of Mathematics and Information Sciences, Yantai University, Yantai 264005, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(23), 3786; https://doi.org/10.3390/math13233786
Submission received: 28 September 2025 / Revised: 14 November 2025 / Accepted: 17 November 2025 / Published: 25 November 2025
(This article belongs to the Section E2: Control Theory and Mechanics)

Abstract

This paper is devoted to the consensus control of a networked system constituted by multiple underactuated marine surface vessels (MSVs) with input saturation. Compared with the related works on this topic, two remarkable features are involved in the system under investigation: (1) Input saturation of each follower MSV is considered in the paper but ignored in most of the related works. (2) More coarse information is allowed about the network since more severer uncertainties (external disturbance joint with unknown system parameters) are involved in each follower MSV, and moreover, the output of the leader MSV is not necessarily second-order continuously differentiable while its time derivatives are not necessarily available for feedback. The above two aspects lead to the incapability of the traditional control schemes on this topic. To solve the control problem, a novel adaptive control scheme is proposed by adaptive dynamic compensation technique combining with certain methods for the handling of saturation input and under-actuation. Specifically, a smooth function is introduced to approximate the saturation input, by which and a couple of state transformations, a new system is obtained with a skillful injection of an auxiliary input for the handling of under-actuation. Then, an iterative procedure is given to derive an adaptive controller which ensures that all the signals of the closed-loop system are bounded while the output of the follower MSVs practically tracks that of the leader. Finally, simulation results are provided to validate the effectiveness of the proposed theoretical results.

1. Introduction

Cooperative control (such as consensus or formation) of multiple underactuated MSVs has attracted extensive attention due to its notable advantages compared with the control of single MSV on the performing of various marine tasks, such as ocean transportation, exploration and rescue, etc. In this field, considerable results are obtained but constrained on the uncertainties of the followers and the prior knowledge of the leader. For detail, the constraints of the existing results are specified by the following two aspects:
The uncertainties (such as unknown parameters and external disturbance) of system are seriously restricted. Remark that uncertainties are always existing in MSVs due to the presence of modelling error or the influence from the external disturbance. However, the existing results require severe assumptions on the uncertainties. Specifically, in [1,2,3,4], unknown external disturbance is allowed but all the system parameters must be accurately known, for such a case control method based on disturbance observer (DS) is proposed. In [5], partial system parameters are allowed to be unknown but the mass of each follower MSV must be accurately known while free of external disturbance, for such case neural network (NN) control method is used. In [6,7,8,9,10,11,12,13,14,15], external disturbance is allowed but some system parameters, such as the mass of the follower MSVs, required to be known. For such systems, adaptive method is used in [6,9], H method is used in [7], control based on extended state observer (ESO) and NN are respectively used in [8,11,14] and [10,13,15]. In [16,17,18,19,20,21,22], some bounded unmodeled dynamics and external disturbance are allowed but the system parameters must be known. For such case, sliding model control (SMC) and adaptive control are respectively used in [20] and [21], while control based on extended state observer (ESO) and NN are respectively used in [19] and [16,17,18,22]. Once the uncertainties become more severer, for example all the system parameters are unknown while suffered from external disturbance, the control methods in the above literature become ineffective.
The generality and measurability of leader’s output are seriously restricted. Specifically, in [1,2,16,17,18,19], the leader’s output must be at least twice continuously differentiable, which excludes those without so much smoothness (such as those which are only first-order continuously differentiable) and hence restricts the generality of the leader’s output. On the other hand, in [1,2,19,20,21], the second-order derivative of the leader’s output require to be available for feedback. This implies that the acceleration of the leader MSV should be measured but is difficult (or even impossible) to be implemented in practice. Noting that the constraints on the generality and measurability of the leader’s output limit the applicability of the proposed control methods, for some leaders whose prior knowledge is difficult to be obtained (such as those which are not twice continuously differentiable or their time derivatives are not available), the traditional control methods will be inapplicable.
In engineering, input saturation is inevitable due to the physical constraint of actuator. For example, the rudder angle of a ship’s steering gear is usually constrained by a maximum deflection limit and hence satisfies a saturation constraint. On one hand, the presence of the input saturation damages the system performance or even leads to instability. On the other hand, input saturation implies an intermittent control to the controlled system while brings extra nonlinearities and uncertainties, which lead to certain technique obstacles in control design and hence essentially challenge the control problems. In the past decade, input saturation is considered for the tracking control of single MSV [23,24,25,26,27,28,29,30,31,32], but seldom for the cooperative control of multiple MSVs. As some tentative works, refs. [8,9,14,15,16] consider the formation control of multiple underactuated MSVs but constrained by the uncertainties since the mass of the follower MSVs in [8,9,14,15] in known while all the system parameters must be known in [16], just as mentioned before. Recognizing the constraints of the existing results mentioned above, the traditional control methods in the literature would be incapable for the cooperative control of the saturated underactuated MSVs with severe uncertainties (such as all the system parameters are unknown while suffered from the external disturbance) or/and only coarse information about the leader’s output (such as the cases that the time derivative of the leader’s output is not available for feedback). Then, an interesting and nontrivial control problem arises, i.e., for a networked system constituted by multiple saturated underactuated MSVs, how to design a distributed cooperative controller under weak conditions on the uncertainties about followers and the prior knowledge about the leader?
Towards the control problem raised above, this paper devotes the consensus of multiple underactuated MSVs with input saturation and coarse information about the follower and leader MSVs. Remarkably, severe uncertainties are involved in the dynamics of follower MSVs since all the system parameters and the saturation level parameters are unknown while the external disturbances are allowed. Moreover, the leader’s output is only first-order continuously differentiable while its time derivatives is not necessarily available for feedback. The above two aspects reflect coarse information about the follower and leader MSVs which result into the ineffectiveness of the traditional methods on this topic (a detailed comparison with the related literature can be found in Table 1). To solve the control problem, an adaptive control scheme is proposed in this paper. Specifically, a smooth function is firstly introduced to approximate the saturation function and helps the handling of the saturation input. Then, a couple of state transformations are introduced to change the original system into a new one, in which an auxiliary function is injected for the handling of the under-actuation. For the new system, an adaptive distributed controller is designed join with the smart choice of the auxiliary function and the updating law of one pivotal dynamic gain for the compensation of system uncertainties. Finally, a recursive procedure is given to show that all the signals of the closed-loop system are bounded while the output of each follower MSVs practically tracks that of the leader MSVs.
The remainder of the paper is organized as follows. Section 2 presents the problem formulation which includes some preliminary knowledge of the graph theory and the system under investigation. Section 3 gives the procedure of control design. Section 4 brings the performance analysis of the resulting closed-loop system. Section 5 provides the simulation results to validate the effectiveness of the proposed theoretical results. Section 6 gives some concluding remarks.

2. Problem Formulation

2.1. Graph Theory

In this paper, a direct graph G = ( V , E , A ) represents the communication of N followers where V = { n 1 , , n N } is the node set, E = { ( n i , n j ) V × V } is the edge set and A = [ a i j ] N × N is an adjacent matrix with a i j > 0 if the i-th follower can obtain information from the j-th follower and a i j = 0 otherwise. Self-edges are not allowed, i.e., a i i = 0 , i = 1 , , N . B = diag ( b 1 , , b N ) represents the communication weight from the leader to followers, where b i > 0 if the leader can directly send information to the i-th follower while b i = 0 otherwise. L = D A denotes the Laplacian matrix of G with D = diag ( j = 1 N a 1 j , , j = 1 N a N j ) . Let H = L + B .

2.2. System Formulation and Control Objective

A networked system consisted by N MSVs is investigated under a direct graph (an example for the communication topology can be found in Figure 1 below), in which the dynamics of the i-th follower is described by the following equations:
x ˙ i = u i cos ψ i v i sin ψ i , y ˙ i = u i sin ψ i + v i cos ψ i , ψ ˙ i = r i , u ˙ i = f u i ν i + 1 m u i τ u i + ω u i , v ˙ i = f v i ν i + 1 m v i ω v i , r ˙ i = f r i ν i + 1 m r i τ r i + ω r i ,
with
f u i ν i = 1 m u i m v i v i r i d u i u i d u i * u i u i , f v i ν i = 1 m v i m u i u i r i d v i v i d v i * v i v i , f r i ν i = 1 m r i m u i m v i u i v i d r i r i d r i * r i r i ,
where ( x i , y i ) and ψ i respectively denote the position and heading angel of the i-th MSV in the earth-fixed frame, ν i = ( u i , v i , r i ) T denotes the velocity of the i-th MSV’s with u i , v i and r i respectively denoting surge velocity, sway velocity and yaw velocity in the body-fixed frame, ω γ i ( γ i = u i , v i , r i ) is the external disturbance caused by the ocean waves, wind, currents, etc., τ γ i * ( γ i * = u i , r i ) is control input of the i-th MSV which is subject to the following saturation constraint:
τ γ i * = τ γ i , max * , if τ γ i , c * > τ γ i , max * τ γ i , c * , if τ γ i , min * < τ γ i , c * < τ γ i , max * τ γ i , min * , if τ γ i , c * < τ γ i , min *
τ γ i , c * being the control input to be designed, τ γ i , max * and τ γ i , min * being unknown constants, m γ i > 0 , d γ i , d γ i * , γ i = u i , v i , r i are some unknown constants in certain practical sense.
The control objective of the paper is to design a distributed cooperative tracking controller such that all the states of the closed-loop system are bounded while the position p i = ( x i , y i ) T and the heading angel ψ i of the i-th follower enter and then stay at the given neighborhoods of those of the leader’s output, i.e., for any ε > 0 , there exists a finite time T > 0 such that
| p i p d | < ε , | ψ i ψ d | < ε , i = 1 , , N .
with p d = ( x d , y d ) T and ψ d being the position and heading angel of the virtual leader, respectively.
The following gives an important property of the MSV which can be easily verified from the nonlinear terms (2) and will be used in the later control design.
Property 1.
There exists an unknown constant σ such that | f γ i ν i | σ ( 1 + | ν i | 2 ) , γ i = u i , v i , r i .
The following gives three assumptions about disturbance, the output of the leader and the graph for the networked system.
Assumption 1.
There exists an unknown constant ω ¯ such that | ω γ i | < ω ¯ , γ i = u i , v i , r i .
Assumption 2.
There exist unknown constants p ¯ and ψ ¯ such that | p d | + | p ˙ d | < p ¯ , | ψ d | + | ψ ˙ d | < ψ ¯ .
Assumption 3.
The leader is globally reachable in G ¯ .

3. Controller Design

First, in order to handle the saturation constraint of control input, the following smooth function is introduced [25,33,34]:
ρ γ i * τ γ i , c * = Γ erf π τ γ i , c * 2 Γ ,
with Γ = τ γ i , max * + τ γ i , min * 2 + τ γ i , max * τ γ i , min * 2 sign τ γ i , c * and erf ( x ) = 2 π 0 x e t 2 d x being a Gaussian error function. By the above function, the following approximation error is defined:
e γ i * = τ γ i * ρ γ i * τ γ i , c * ,
which is clearly bounded by using the definition given by (3) and (6), i.e., there exists an unknown constant e ¯ γ such that e γ i * e ¯ γ . Then, by using the mean value theorem, ρ γ i * is rewritten as follows:
ρ γ i * τ γ i , c * = ρ γ i * ( 0 ) + W γ i * τ γ i , c * 0 ,
with W γ i * = e π ι γ i , c * 2 Γ 2 , ι ( 0 , 1 ) . Note that, by the definition of W γ i * , there exists an unknown constant W 0 such that W γ i * > W 0 > 0 . Thus, combining (5) with (6) while noting ρ γ i * ( 0 ) = 0 , we obtain that
τ γ i * = W γ i * τ γ i , c * + e γ i * ,
with γ i * = u i , r i , γ i , c * = u i , c , r i , c .
Second, define the following state transformations:
η i = j = 1 N a i j p i p j + b i p i p d , ξ i = j = 1 N a i j ψ i ψ j + b i ψ i ψ d , u e i = u i β 1 i , v e i = v i β 2 i tanh ζ i , r e i = r i β 3 i ,
with β 1 i , β 2 i and β 3 i being virtual controls which will be designed later, tanh ζ i being some additional term for controller whose updating law will be specified later. Then, by (1) and (7), a new system is obtained from (8):
η ˙ i = d i R i U ¯ i j = 1 N a i j R j U ¯ j b i p ˙ d , ξ ˙ i = d i ( r e i + β 3 i ) j = 1 N a i j ( r e j + β 3 j ) b i ψ ˙ d , u ˙ e i = f u i ν i + 1 m u i W u i τ u i , c + e u i + ω u i β ˙ 1 i , v ˙ e i = f v i ν i + 1 m v i ω v i β ˙ 2 i ζ ˙ i cosh 2 ζ i , r ˙ e i = f r i ν i + 1 m r i W r i τ r i , c + e r i + ω r i β ˙ 3 i ,
with d i = j = 1 N a i j + b i and
U ¯ i = u e i + β 1 i v e i + β 2 i + tanh ζ i , R i = cos ψ i sin ψ i sin ψ i cos ψ i .
Now, we are ready for the presentation of the controller for the i-th follower which is given as follows:
τ u i , c = c 3 i u e i c 3 i u e i v e i 2 1 4 κ u e i 1 + ν i 2 2 + 1 + β 1 i ψ i r i 2 + β 1 i p T R U 2 + β 1 i p d 2 + β 1 i κ | η | 2 + | ξ | 2 2 , τ r i , c = c 5 i r e i c 5 i v e i 2 r e i 1 4 κ r e i 1 + ν i 2 2 + 1 + β 3 i ψ T r 2 + β 3 i ψ d 2 + β 1 i κ | η | 2 + | ξ | 2 2 ,
where η = ( η 1 T , , η N T ) T , ξ = ( ξ 1 , , ξ N ) T , p = ( p 1 T , , p N T ) T , ψ = ( ψ 1 , , ψ N ) T , R = diag ( R 1 , , R N ) , U = ( U 1 T , , U N T ) T , U i = ( u i , v i ) T , r = ( r 1 , , r N ) T , κ is tuned by the following updating law:
κ ˙ = | η | 2 + | ξ | 2 ε 2 2 H 1 2 , | η | 2 + | ξ | 2 ε 2 H 1 2 , 0 , | η | 2 + | ξ | 2 < ε 2 H 1 2 ,
with κ ( 0 ) 1 , β 1 i , β 2 i β 3 i and ζ i being chosen as follows:
β 12 = c 1 i R 1 H 1 I 2 η 1 2 κ R 1 H 1 I 2 diag ( d 1 , , d N ) η , β 31 = c 2 i H 1 ξ 1 4 κ H 1 B ξ , ζ i ˙ = cosh 2 ζ i · c 3 i u e i 2 v e i c 5 i v e i r e i 2 + c 4 v e i + 1 4 κ v e i 1 + ν i 2 2 + 1 + β 2 i ψ i r i 2 + β 2 i p T R U 2 + β 2 i p d 2 + β 2 i κ | η | 2 + | ξ | 2 2 ,
β 12 = ( ( β 11 , β 21 ) T , , ( β 1 N , β 2 N ) T ) T , β 3 = ( β 31 , , β 3 N ) T , H = L + B , c k i > 1 2 d i + 1 2 j = 1 N a i j + 1 2 , k = 1 , , 5 .
Remark 1.
Compared with other adaptive consensus methods in related works (such as [5,10,17,18]), the proposed adaptive controller has lower complexity in controller implementation and parameter tuning induced by the iterative adaptive design. Specifically, adaptive laws should be designed for each follower for the estimation of neural network weights in [5,17,18] or the estimation of unknown system parameters in [10], which clearly expand the dimension of the closed-loop system and hence enhance the complexity in controller implementation and parameter tuning. Differently, as shown by (11), all the followers share one dynamic gain for the compensation of system uncertainties. Then, such a feature decreases the complexity in controller implementation and parameter tuning.
Proposition 1.
For the MSVs with Assumptions 1–3 and the followers’ dynamics satisfying (1), the designed controller (10) and (11) guarantees that the Lyapunov function V = i = 1 N V i with
V i = 1 2 η i T η i + 1 2 ξ i 2 + 1 2 m u i W 0 u e i 2 + 1 2 v e i 2 + 1 2 m r i W 0 r e i 2 ,
satisfies that
V ˙ c V + M * κ
with c and M * being some positive constant.
Proof. 
Such proposition is proved by the following recursive steps.
Step 1: Define V i 1 = 1 2 η i T η i + 1 2 ξ i 2 . Then, computing the time derivative of V i 1 along the solutions of system (9) leads to the following:
V ˙ i 1 = η i T d i R i u e i v e i η i T j = 1 N a i j R j u e j v e j + ξ i d i r e i ξ i j = 1 N a i j r e j + η i T d i R i β 1 i β 2 i η i T j = 1 N a i j R j β 1 j β 2 j + ξ i d i β 3 i ξ i j = 1 N a i j β 3 j + η i T d i R i 0 tanh ζ i η i T j = 1 N a i j R j 0 tanh ζ j η i T b i p ˙ d ξ i b i ψ ˙ d .
Some terms on the right-hand side of (14) should be estimated for later control design. First, by using Young’s inequality, the first four items on the right-hand side of (14) are estimated as follows:
η i T d i R i u e i v e i d i 2 η i 2 + d i 2 u e i 2 + v e i 2 , η i T j = 1 N a i j R j u e j v e j 1 2 j = 1 N a i j η i 2 + 1 2 j = 1 N a i j u e j 2 + v e j 2 , ξ i d i r e i d i 2 ξ i 2 + d i 2 r e i 2 , ξ i j = 1 N a i j r e j 1 2 j = 1 N a i j ξ i 2 + 1 2 j = 1 N a i j r e j 2 .
Second, by Assumption 3 and Young’s inequality while noting the fact | tanh ζ i | < 1 , the estimations of the last four terms on the right-hand side of (14) are given as follows:
η i T d i R i 0 tanh ζ i 1 4 d i κ | η i | 2 + 1 κ d i , η i T j = 1 N a i j R j 0 tanh ζ j 1 4 j = 1 N a i j κ | η i | 2 + 1 κ j = 1 N a i j , η i T b i p ˙ d 1 4 b i κ | η i | 2 + 1 κ b i p ¯ 2 , ξ i b i ψ ˙ d 1 4 b i κ ξ i 2 + 1 κ b i ψ ¯ 2 ,
where κ is the dynamic gain whose updating law has been given in (11). Substituting (15) and (16) into (14) gives that
V ˙ i 1 1 2 d i + 1 2 j = 1 N a i j η i T η i + 1 2 d i + 1 2 j = 1 N a i j ξ i 2 + 1 2 d i u e i 2 + 1 2 j = 1 N a i j u e j 2 + 1 2 d i v e i 2 + 1 2 j = 1 N a i j v e j 2 + 1 2 d i r e i 2 + 1 2 j = 1 N a i j r e j 2 + η i T d i R i β 1 i β 2 i η i T j = 1 N a i j R j β 1 j β 2 j + ξ i d i β 3 i ξ i j = 1 N a i j β 3 j + 1 2 d i κ η i T η i + 1 4 b i κ ξ i 2 + M 1 i κ ,
with M 1 i = b i ( p ¯ 2 + ψ ¯ 2 ) + d i + j = 1 N a i j .
Moreover, by the choice of virtual controls β 1 i , β 2 i and β 3 i given by (12), we obtain
d i R i β 1 i β 2 i j = 1 N a i j R j β 1 j β 2 j + 1 2 d i κ η i = c 1 i η i , d i β 3 i j = 1 N a i j β 3 j + 1 4 b i κ ξ i = c 2 i ξ i ,
substituting which into (17) brings
V ˙ i 1 c 1 i 1 2 d i 1 2 j = 1 N a i j η i T η i c 2 i 1 2 d i 1 2 j = 1 N a i j ξ i 2 + M 1 i κ + 1 2 d i u e i 2 + 1 2 j = 1 N a i j u e j 2 + 1 2 d i v e i 2 + 1 2 j = 1 N a i j v e j 2 + 1 2 d i r e i 2 + 1 2 j = 1 N a i j r e j 2 .
Step 2: For the Lyapunov function V i = V i 1 + 1 2 m u i W 0 u e i 2 + 1 2 v e i 2 + 1 2 m r i W 0 r e i 2 , its time derivative along the solutions of system (9) gives
V ˙ i = V ˙ i 1 + u e i W 0 W u i τ u i , c + e u i + m u i f u i + ω u i m u i β ˙ 1 i + v e i ζ ˙ i cosh 2 ζ i + f v i + 1 m v i ω v i β ˙ 2 i + r e i W 0 W r i τ r i , c + e r i + m r i f r i + ω r i m r i β ˙ 3 i .
Some terms on the right-hand side of (19) should be further estimated. First, by using Assumptions 1–3 and Young’s inequality, the following estimations are obtained:
u e i m u i f u i u e i m u i σ 1 + ν i 2 1 4 W 0 κ u e i 2 1 + ν i 2 2 + m u i 2 σ 2 W 0 κ 1 4 W u i κ u e i 2 1 + ν i 2 2 + m u i 2 σ 2 W 0 κ , u e i e u i + ω u i 1 4 W u i κ u e i 2 + e m 2 + ω ¯ 2 W 0 κ , v e i f v i 1 4 κ v e i 2 1 + ν i 2 2 + σ 2 κ , 1 m v i v e i ω v i 1 4 κ v e i 2 + ω ¯ 2 m v i 2 κ , r e i m r i f r i 1 4 W r i κ r e i 2 1 + ν i 2 2 + m r i 2 σ 2 W 0 κ , r e i e r i + ω r i 1 4 W r i κ r e i 2 + e m 2 + ω ¯ 2 W 0 κ .
Second, by (12), β ˙ 1 i , β ˙ 2 i and β ˙ 3 i are given as follows:
β ˙ 1 i = β 1 i ψ i ψ ˙ i + β 1 i p T p ˙ + β 1 i p d T p ˙ d + β 1 i κ κ ˙ , β ˙ 2 i = β 2 i ψ i ψ ˙ i + β 2 i p T p ˙ + β 2 i p d T p ˙ d + β 2 i κ κ ˙ , β ˙ 3 i = β 3 i ψ T ψ ˙ + β 3 i ψ d ψ ˙ d + β 3 i κ κ ˙ ,
Then, by using Young’s inequality, the definition of κ ˙ given by (11) while noting p ˙ = R U , ψ ˙ = r , the following estimations are obtained:
u e i m u i β ˙ 1 i 1 4 W u i κ u e i 2 β 1 i ψ i r i 2 + β 1 i p T R U 2 + β 1 i p d 2 + β 1 i κ | η | 2 + | ξ | 2 2 + m u i 2 3 + p ¯ 2 W 0 κ , v e i β ˙ 2 i 1 4 κ v e i 2 β 2 i ψ i r i 2 + β 2 i p T R U 2 + β 2 i p d 2 + β 2 i κ | η | 2 + | ξ | 2 2 + 3 + p ¯ 2 κ , r e i m r i β ˙ 3 i 1 4 W r i κ r e i 2 β 3 i ψ T r 2 + β 3 i ψ d 2 + β 3 i κ | η | 2 + | ξ | 2 2 + m r i 2 2 + ψ ¯ 2 W 0 κ .
Substituting (20) and (21) into (19) arrives at
V ˙ i V ˙ i 1 + u e i W u i W 0 τ u i , c + 1 4 κ u e i 1 + ν i 2 2 + 1 + β 1 i ψ i r i 2 + β 1 i p T R U 2 + β 1 i p d 2 + β 1 i κ | η | 2 + | ξ | 2 2 + v e i ζ ˙ i cosh 2 ζ i + 1 4 κ v e i 1 + ν i 2 2 + 1 + β 2 i ψ i r i 2 + β 2 i p T R U 2 + β 2 i p d 2 + β 2 i κ | η | 2 + | ξ | 2 2 + r e i W r i W 0 τ r i , c + 1 4 κ r e i 1 + ν i 2 2 + 1 + β 3 i ψ T r 2 + β 3 i ψ d 2 + β 3 i κ | η | 2 + | ξ | 2 2 + M 2 i κ ,
where M 2 i = m u i 2 ( σ 2 + 3 + p ¯ 2 ) + m r i 2 ( σ 2 + 2 + ψ ¯ 2 ) + 2 ( e m 2 + ω ¯ 2 ) + σ 2 + ω ¯ 2 m v i 2 + 3 + p ¯ 2 W 0 W 0 . Thus, the choice of controller τ u i , c , τ r i , c and additional control ζ ˙ i given by (10) and (12) while noting W γ i * > W 0 > 0 , γ i * = u i , r i , gives
V ˙ i V ˙ i 1 c 3 i W u i W 0 u e i 2 c 3 i W u i W 0 1 u e i 2 v e i 2 c 4 v e i 2 c 5 W r i W 0 r e i 2 c 5 i W r i W 0 1 v e i 2 r e i 2 + M 2 i κ c 1 i 1 2 d i 1 2 j = 1 N a i j η i T η i c 2 i 1 2 d i 1 2 j = 1 N a i j ξ i 2 c 3 i u e i 2 1 2 d i u e i 2 1 2 j = 1 N a i j u e j 2 c 4 i v e i 2 1 2 d i v e i 2 1 2 j = 1 N a i j v e j 2 c 5 i r e i 2 1 2 d i r e i 2 1 2 j = 1 N a i j r e j 2 + M 1 i + M 2 i κ .
Step 3: For the Lyapunov function V = i = 1 N V i 2 , its time derivative is given as follows by (23):
V ˙ i = 1 N c 1 i 1 2 d i 1 2 j = 1 N a i j η i T η i i = 1 N c 2 i 1 2 d i 1 2 j = 1 N a i j ξ i 2 i = 1 N c 3 i 1 2 d i 1 2 j = 1 a j i u e i 2 i = 1 N c 4 i 1 2 d i 1 2 j = 1 N a j i v e i 2 i = 1 N c 5 i 1 2 d i 1 2 j = 1 N a j i r e i 2 + M * κ .
Then, by the choice of c k i given above, we arrive at
V ˙ 1 2 η i T η i 1 2 ξ i 2 1 2 u e i 2 1 2 v e i 2 1 2 r e i 2 + M * κ c V + M * κ ,
with M * = i = 1 N M 1 i + M 2 i , c = min 1 i N 1 , W 0 m u i , W 0 m r i , which gives (13). This completes the proof. □

4. Performance Analysis

As preparation of the performance analysis of the resulting closed-loop system, the boundedness of the dynamic gain κ is first given and summarized in the following proposition.
Proposition 2.
The time-varying gain κ updated by (11) is bounded on [ 0 , + ) .
Proof. 
The proposition is proved by contradiction. Suppose that κ is unbounded on [ 0 , + ) . Then, for some positive constant 4 M * H 1 2 ε 2 c , there exists t 1 > 0 such that κ ( t 1 ) > 4 M * H 1 2 ε 2 c . Since κ is monotone increasing by noting that κ ˙ ( t ) > 0 from (11), there holds that κ ( t ) κ ( t 1 ) > 4 M * H 1 2 ε 2 c , t > t 1 .
Integrating both sides of (13) on [ t 1 , t ] while noting κ > 4 M * H 1 2 ε 2 c leads to
V ( t ) V t 1 e c t 1 t + ε 2 4 H 1 2 , t > t 1 .
Since lim t + V t 1 e c t 1 t = 0 , there exists a t 2 > t 1 such that V t 1 e c t 1 t < ε 2 4 H 1 2 , t > t 2 . Then, there holds that
1 2 η T η + 1 2 ξ T ξ V ( t ) < ε 2 2 H 1 2 , t > t 2 ,
which implies that | η | 2 + | ξ | 2 < ε 2 H 1 2 . This leads to that κ ˙ ( t ) 0 by using (11), and hence κ remains a constant after t 2 . Noting that κ is continuous and increasing with κ ( 0 ) 1 , κ is bounded on [ 0 , t 2 ) , and hence κ is bounded on [ 0 , + ) . This contradicts with the induce assumption. □
Now, it is a position to present the main results of the paper which are summarized in the following theorem.
Theorem 1.
For the MSVs with Assumptions 1–3 and the followers’ dynamics satisfying (1), the designed controller given by (10) and (11) guarantees the following properties:
(1) all the signals of the closed-loop system are bounded on [ 0 , + ) .
(2) the position p i and heading angel ψ i of the i-th followers practically track those of the leader, i.e., for any ε > 0 , there exists a finite time T > 0 such that
| p i p d | < ε , | ψ i ψ d | < ε , i = 1 , , N .
Proof. 
We first prove Claim (1). Noting κ ( 0 ) 1 and κ ˙ 0 , (13) gives
V ˙ c V + M * .
Integrating both sides of (26) over [ 0 , t ] , we obtain
V ( t ) V ( 0 ) e c t + M * c 1 e c t < V ( 0 ) + M * c ,
which implies that V ( t ) , and hence ξ i , η i , u e i , v e i and r e i , are bounded. Then, (8) gives the boundedness of p i and ψ i , and hence those of p and ψ . The boundedness of p, p d , ψ , ψ d and κ give that β 1 i , β 2 i and β 3 i are bounded. Moreover, transfomation (8) implies that u i , v i and r i are bounded. Thus, the boundedness of τ u i , c and τ r i , c are obtained by (10).
We next prove Claim (2). First, p ˙ i and ψ ˙ i are bounded by the boundedness of u i , v i and r i . This, together with (9), gives that η ˙ i and ξ ˙ i are bounded. So are η ˙ and ξ ˙ , and hence, | η | 2 and | ξ | 2 are uniformly continuous on [ 0 , + ) . Moreover, the boundedness of κ gives that
0 + κ ˙ ( t ) d t = κ ( + ) κ ( 0 ) < + ,
which implies that κ ˙ ( t ) is integrable. Thus, by Babalat’s lemma, we obtain that lim t + κ ˙ ( t ) = 0 . Therefore, for any ε > 0 , there exists a finite time T > 0 , such that
| κ ˙ ( t ) | < ε 2 2 H 1 2 , t > T .
Then, by (11), we obtain
| η | 2 + | ξ | 2 < ε 2 H 1 2 , t > T .
Noting η = ( η 1 T , , η N T ) T , ξ = ( ξ 1 , , ξ N ) T and the definitions of η i and ξ i in (8), we have Noting the definition of η i and ξ i in (8), we have η = H I 2 p 1 N p d , and ξ = H ψ 1 N ψ d , which brings
p 1 N p d 2 H 1 I 2 2 | η | 2 , ψ 1 N ψ d 2 H 1 2 | ξ | 2 .
Since | η | 2 + | ξ | 2 < ε 2 H 1 2 , we have p 1 N p d < ε and ψ 1 N ψ d < ε , and hence p i p d < ε and ψ i ψ d < ε , t > T . □

5. Simulation Results

In this section, a networked system consisted by one leader and five follower is considered to verify the effectiveness of the proposed theoretical results. The communication topology of the network is shown in Figure 1 with node d denoting the leader while nodes 1–5 denoting the followers. Moreover, seen from Figure 1 that, matrices L and B are defined as follows:
L = 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 1 0 1 , B = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 .
For each MSV (either the leader or the follower), the dynamics are given as (1) with initial conditions being chosen as q 1 ( 0 ) = ( 2.5 , 4 ) T , q 2 ( 0 ) = ( 2.8 , 3.8 ) T , q 3 ( 0 ) = ( 2 , 2.2 ) T , q 4 ( 0 ) = ( 1.8 , 2 ) T , q 5 ( 0 ) = ( 1 , 3.5 ) T , ψ 1 ( 0 ) = 0.15 , ψ 2 ( 0 ) = 0.2 , ψ 3 ( 0 ) = 0.35 , ψ 4 ( 0 ) = 0.4 , ψ 5 ( 0 ) = 0.5 , ν 1 ( 0 ) = ( 0.1 , 0.3 , 0.2 ) T , ν 2 ( 0 ) = ( 0.4 , 0.2 , 0.5 ) T , ν 3 ( 0 ) = ( 0.3 , 0.2 , 0.2 ) T , ν 4 ( 0 ) = ( 0.1 , 0.3 , 0.1 ) T , ν 5 ( 0 ) = ( 0.2 , 0.3 , 0.4 ) T . Suppose that the actual values of the unknown parameters in the system are m u i = 23 , m v i = 34 , m r i = 1.1 , d u i = 1.5 , d v i = 2.8 , d r i = 3.8 , d u i * = 12 , d v i * = 10.5 , d r i * = 1.8 , τ u i , m a x = 85 , τ u i , m i n = 80 , τ v i , m a x = 85 , τ v i , m i n = 75 , the disturbance ω γ i ( γ i = u i , v i , r i ) are supposed to be as follows:
ω u i = 1.2 + 0.8 sin 2 t + 2 cos 1.5 t , ω v i = 1.5 0.2 cos 2 t + 0.8 sin 0.5 t , ω v i = 2.5 0.3 cos 2.2 t + 0.6 sin 0.6 t .
Suppose that the output of the leader is given as
p d = 3 cos 0.02 t + 2 sin 0.01 t , 2.5 sin 0.02 t 3.2 cos 0.01 t T , ψ d = 0.1 sin 0.01 t .
Then, for the tracking accuracy parameter ε = 0.01 , we implement controller (10), (11) with κ ( 0 ) = 1 , c k 1 = 20 , c k 2 = 10 , c k 3 = 20 , c k 4 = 10 , c k 5 = 20 , k = 1 , , 5 . Consequently, four simulation figures are obtained (see Figure 2, Figure 3, Figure 4 and Figure 5 for detail). Specifically, Figure 2 shows that the errors for the position and heading angel between the leader and the follower (i.e., x i x d , y i y d , ψ i ψ d ) enter and then stay at the given neighborhood of the origin after some time. Figure 3 demonstrates that the system states u i , v i , r i of each follower are bounded. Figure 4 shows that the control input τ u i , c , τ v i , c are bounded and satisfy the saturation constraints. Figure 5 shows that the dynamic gain κ ^ is bounded and converges to a constant ultimately.

6. Concluding Remarks

In this paper, consensus control is solved for a multiple underactuated MSV system with input saturation. Mainly due to the two key features, i.e., the consideration of input saturation and the presence of coarse information about the network which is reflected from the severe uncertainties of the followers and the generality of the leader’s output, the traditional control methods in the related literature are inapplicable to the control problem. To achieve the goal of the paper, a novel adaptive control scheme is proposed which is capable of the coarse information about the MSVs which are reflected from the severe uncertainties and the generality as well as the measurability of the output of the leader’s output. Consequently, a distributed adaptive state-feedback controller is explicitly designed which ensures that all the states of the closed-loop system are bounded while the output of the follower MSVs practically track that of the leader MSVs. The simulation results show the effectiveness of the proposed theoretical results for an investigated system. It is worthy pointing out that the proposed method is applicable for the consensus control of other systems, such as the networked system constituting by multiple manipulators.
The future research directions are the following two aspects: ➀ Consensus control via output feedback. Noting that all the states of the system are required to be available for feedback in the paper which is difficult to implement in practice, then one of the interesting research focuses on the consensus control via output feedback for the investigated system. For such control problem, a state observer is required to reconstruct the system states, which is rather difficult due to the presence of uncertainties and hence greatly challenges the control problem. ➁ Consensus control for the networked system with other topologies. In this paper, a networked system with directed graph is considered. However, in some practical cases, a networked system may have other compunction topologies, such as the switching or undirected topology, for which the state transformations used in the paper is inapplicable and hence the proposed control method is incapable. Thus, it is interesting to investigate the consensus control of the investigated system under other topologies.

Author Contributions

Conceptualization, Q.G.; Methodology, Q.G. and J.L.; Software, Q.G.; Writing—original draft, Q.G.; Writing—review & editing, J.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundations of China grant number 62473325.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Do, K.D. Formation control of underactuated ships with elliptical shape approximation and limited communication ranges. Automatica 2012, 48, 1380–1388. [Google Scholar] [CrossRef]
  2. Do, K.D. Practical formation control of multiple underactuated ships with limited sensing ranges. Robot. Auton. Syst. 2011, 59, 457–471. [Google Scholar] [CrossRef]
  3. Yang, Y.; Cheng, S.; Zeng, X.; Liu, K.; Li, T. Finite-time formation control of multi-USV systems with a relative-threshold event-triggered mechanism. Ocean Eng. 2025, 341, 122614. [Google Scholar] [CrossRef]
  4. Hao, P.W.; Feng, G.C.; Li, J.W. Leader-follower formation tracking control and stabilization of underactuated unmanned surface vessels via event-triggered mechanism. IEEE Access 2024, 12, 80359–80372. [Google Scholar] [CrossRef]
  5. He, S.; Dong, C.; Dai, S. Adaptive neural formation control for underactuated unmanned surface vehicles with collision and connectivity constraints. Ocean Eng. 2021, 226, 108834. [Google Scholar] [CrossRef]
  6. Yao, L.Q.; Xu, Q.X.; Wu, Z.J.; Feng, L.K. Adaptive cooperative formation control for underactuated multiple surface vessel systems with random disturbances. Ocean Eng. 2025, 328, 120984. [Google Scholar] [CrossRef]
  7. Liu, H.; Li, Y.; Tian, X.; Mai, Q. Event-triggered predefined-time H formation control for multiple underactuated surface vessels with error constraints and input quantization. Ocean Eng. 2023, 277, 114294. [Google Scholar] [CrossRef]
  8. Lv, C.; Chen, J.; Yu, H.; Chi, J.; Yang, Z. Adaptive NN state error PCH trajectory tracking control for unmanned surface vessel with uncertainties and input saturation. Asian J. Control 2023, 25, 3903–3919. [Google Scholar] [CrossRef]
  9. Xia, G.Q.; Xia, X.M.; Zheng, Z. Formation tracking control for underactuated surface vehicles with actuator magnitude and rate saturations. Ocean Eng. 2022, 260, 111935. [Google Scholar] [CrossRef]
  10. Dai, S.L.; He, S.; Cai, H.; Yang, C.G. Adaptive leader-follower formation control of underactuated surface vehicles with guaranteed performance. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 1997–2008. [Google Scholar] [CrossRef]
  11. Lin, J.F.; Liu, H.T.; Tian, X.H. Neural network-based prescribed performance adaptive finite-time formation control of multiple underactuated surface vessels with collision avoidance. J. Frankl. Inst. 2022, 359, 5174–5205. [Google Scholar] [CrossRef]
  12. Gao, S.N.; Peng, Z.H.; Liu, L.; Wang, H.L.; Wang, D. Coordinated target tracking by multiple unmanned surface vehicles with communication delays based on a distributed event-triggered extended state observer. Ocean Eng. 2021, 227, 108283. [Google Scholar] [CrossRef]
  13. Deng, Y.J.; Zhang, X.K.; Im, N.; Zhang, G.Q.; Zhang, Q. Model-based event-triggered tracking control of underactuated surface vessels with minimum learning parameters. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 4001–4014. [Google Scholar] [CrossRef] [PubMed]
  14. Mu, D.D.; Wang, G.F.; Fan, Y.S. Formation control strategy for underactuated unmanned surface vehicles subject to unknown dynamics and external disturbances with input saturation. Int. J. Control Autom. Syst. 2020, 18, 2742–2752. [Google Scholar] [CrossRef]
  15. Xia, G.Q.; Xia, X.M.; Zhao, B.; Sun, C.; Sun, X.X. A solution to leader following of underactuated surface vessels with actuator magnitude and rate limits. Int. J. Adapt. Control Signal Process. 2021, 35, 1860–1878. [Google Scholar] [CrossRef]
  16. Shojaei, K. Leader-follower formation control of underactuated autonomous marine surface vehicles with limited torque. Ocean Eng. 2015, 105, 196–205. [Google Scholar] [CrossRef]
  17. Wang, H.; Wang, D.; Peng, Z.H.; Wang, W. Adaptive dynamic surface control for cooperative path following of underactuated marine surface vehicles via fast learning. IET Control Theory Appl. 2013, 7, 1888–1898. [Google Scholar]
  18. Wang, H.; Wang, D.; Peng, Z.H. Adaptive neural control for cooperative path following of marine surface vehicles: State and output feedback. Int. J. Syst. Sci. 2015, 47, 1–17. [Google Scholar] [CrossRef]
  19. Song, S.; Zhang, E.H.; Wang, W.K.; Liu, T. Distributed dynamic edge-based event-triggered formation control for multiple underactuated unmanned surface vessels. Ocean Eng. 2022, 264, 112319. [Google Scholar] [CrossRef]
  20. Wang, J.Y.; Du, J.L.; Li, J. Distributed finite-time velocity-free robust formation control of multiple underactuated AUVs under switching directed topologies. Ocean Eng. 2022, 266, 112967. [Google Scholar] [CrossRef]
  21. Li, T.S.; Zhao, R.; Chen, C.L.P.; Fang, L.Y.; Liu, C. Finite-time formation control of under-actuated ships using nonlinear sliding mode control. IEEE Trans. Cybern. 2018, 48, 3243–3253. [Google Scholar] [CrossRef]
  22. Huang, C.F.; Zhang, X.K.; Zhang, G.Q.; Deng, Y.J. Robust practical fixed-time leader-follower formation control for underactuated autonomous surface vessels using event-triggered mechanism. Ocean Eng. 2021, 233, 109026. [Google Scholar] [CrossRef]
  23. Park, B.S. A simple output-feedback control for trajectory tracking of underactuated surface vessels. Ocean Eng. 2017, 143, 133–139. [Google Scholar] [CrossRef]
  24. Zheng, Z.W.; Feroskhan, M. Path following of a surface vessel with prescribed performance in the presence of input saturation and external disturbances. Ocean Eng. 2017, 22, 2564–2575. [Google Scholar] [CrossRef]
  25. Zhu, G.B.; Du, J.L. Global robust adaptive trajectory tracking control for surface ships under input saturation. Ocean Eng. 2020, 45, 442–450. [Google Scholar] [CrossRef]
  26. Zheng, Z.W.; Sun, L. Path following control for marine surface vessel with uncertainties and input saturation. Neurocomputing 2016, 177, 158–167. [Google Scholar] [CrossRef]
  27. Lin, X.G.; Nie, J.; Jiao, Y.Z.; Liang, K.; Li, H. Adaptive fuzzy output feedback stabilization control for the underactuated surface vessel. Appl. Ocean Res. 2018, 74, 40–48. [Google Scholar] [CrossRef]
  28. Liu, H.T.; Chen, G.J. Robust trajectory tracking control of marine surface vessels with uncertain disturbances and input saturations. Nonlinear Dyn. 2020, 100, 3513–3528. [Google Scholar] [CrossRef]
  29. Park, B.S.; Kwon, J.W.; Kim, H. Neural network-based output feedback control for reference tracking of underactuated surface vessels. Automatica 2017, 77, 353–359. [Google Scholar] [CrossRef]
  30. Zheng, Z.W.; Huang, Y.T.; Xie, L.H.; Zhu, B. Adaptive trajectory tracking control of a fully actuated surface vessel with asymmetrically constrained input and output. IEEE Trans. Control Syst. Technol. 2018, 26, 1851–1859. [Google Scholar] [CrossRef]
  31. Zhang, J.L.; Xiang, X.B.; Zhang, Q.; Li, W.J. Neural network-based adaptive trajectory tracking control of underactuated AUVs with unknown asymmetrical actuator saturation and unknown dynamics. Ocean Eng. 2020, 218, 108193. [Google Scholar] [CrossRef]
  32. Zhang, J.L.; Xiang, X.B.; Lapierre, L.; Zhang, Q.; Li, W.J. Approach-angle-based three-dimensional indirect adaptive fuzzy path following of under-actuated AUV with input saturation. Appl. Ocean Res. 2021, 107, 102486. [Google Scholar] [CrossRef]
  33. Ma, J.J.; Ge, S.S.; Zheng, Z.Q.; Hu, D.W. Adaptive NN control of a class of nonlinear systems with asymmetric saturation actuators. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 1532–1538. [Google Scholar] [CrossRef] [PubMed]
  34. Yua, Z.X.; Dong, Y.; Li, S.G.; Li, F.F. Adaptive tracking control for switched strict-feedback nonlinear systems with time-varying delays and asymmetric saturation actuators. Neurocomputing 2017, 238, 245–254. [Google Scholar] [CrossRef]
Figure 1. The communication topology graph.
Figure 1. The communication topology graph.
Mathematics 13 03786 g001
Figure 2. Trajectories of tracking error x i x d , y i y d , ψ i ψ d .
Figure 2. Trajectories of tracking error x i x d , y i y d , ψ i ψ d .
Mathematics 13 03786 g002
Figure 3. Trajectories of states u i , v i , r i .
Figure 3. Trajectories of states u i , v i , r i .
Mathematics 13 03786 g003
Figure 4. Trajectories of control inputs τ u i , c , τ v i , c .
Figure 4. Trajectories of control inputs τ u i , c , τ v i , c .
Mathematics 13 03786 g004
Figure 5. Trajectory of dynamic gain κ ^ .
Figure 5. Trajectory of dynamic gain κ ^ .
Mathematics 13 03786 g005
Table 1. Comparison with the related works for consensus control of underactuated MSVs.
Table 1. Comparison with the related works for consensus control of underactuated MSVs.
Control MethodsUncertainties
(All the Parameters Are
Unknown with Disturbance)
Twice Continuity
of Leader’s Output
Input Saturation
[1,2,3,4]DS××
[5,10,12,13,22]NN×××
[15]NN××
[16]NN×
[17,18]NN××
[6,21]Adaptive××
[9]Adaptive××
[8]ESO×
[14]ESO××
[11,19]ESO××
[7] H ×××
[20]SMC×××
This paperAdaptive×
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Gao, Q.; Li, J. Adaptive Consensus Control of Multiple Underactuated Marine Surface Vessels with Input Saturation and Severe Uncertainties. Mathematics 2025, 13, 3786. https://doi.org/10.3390/math13233786

AMA Style

Gao Q, Li J. Adaptive Consensus Control of Multiple Underactuated Marine Surface Vessels with Input Saturation and Severe Uncertainties. Mathematics. 2025; 13(23):3786. https://doi.org/10.3390/math13233786

Chicago/Turabian Style

Gao, Qian, and Jian Li. 2025. "Adaptive Consensus Control of Multiple Underactuated Marine Surface Vessels with Input Saturation and Severe Uncertainties" Mathematics 13, no. 23: 3786. https://doi.org/10.3390/math13233786

APA Style

Gao, Q., & Li, J. (2025). Adaptive Consensus Control of Multiple Underactuated Marine Surface Vessels with Input Saturation and Severe Uncertainties. Mathematics, 13(23), 3786. https://doi.org/10.3390/math13233786

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop