Next Article in Journal
MFP-PAINet: Enhancing Underwater Images Through Multi-Dimensional Feature Fusion and Probabilistic Uncertainty Modeling
Previous Article in Journal
Prediction Analysis on the Sediment Erosion and Energy Dissipation Inside a Three-Stage Centrifugal Pump
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed-Time Event-Triggered Fault-Tolerant Formation Control for Autonomous Underwater Vehicle Swarms

1
National Key Laboratory of Autonomous Marine Vehicle Technology, Harbin Engineering University, Harbin 150001, China
2
Qingdao Innovation and Development Base, Harbin Engineering University, Qingdao 266000, China
3
China Ship Research and Development Academy, Beijing 100192, China
*
Author to whom correspondence should be addressed.
J. Mar. Sci. Eng. 2025, 13(12), 2249; https://doi.org/10.3390/jmse13122249
Submission received: 6 November 2025 / Revised: 21 November 2025 / Accepted: 22 November 2025 / Published: 26 November 2025
(This article belongs to the Special Issue Advancements in Autonomous Systems for Complex Maritime Operations)

Abstract

Autonomous Underwater Vehicle (AUV) swarms possess advantages such as efficiency, reliability, flexibility, and extensive coverage in underwater operations. However, their coordinated control is challenged by communication interruptions and actuator failures in complex marine environments. This paper proposes a fixed-time event-triggered fault-tolerant formation control method to address these challenges. First, the Prim algorithm and the Hungarian algorithm are employed to reconstruct the communication topology, mitigating AUV disconnections due to communication failures and ensuring formation stability. Second, a fixed-time extended state observer (ESO) is designed to estimate the lumped disturbance arising from model uncertainties, unknown ocean disturbances, and actuator failures. Finally, a performance function is introduced to reformulate error variables, and a fixed-time event-triggered formation control law is developed based on an auxiliary saturation system and an event-triggering mechanism. In addition, this paper demonstrates the stability of the entire closed-loop system, and no Zeno phenomenon will occur. Simulation experiments demonstrate the effectiveness and superiority of the proposed method in maintaining robust formation control of AUV systems under adverse conditions.

1. Introduction

Autonomous Underwater Vehicles (AUVs) are widely used in underwater operations due to their capabilities in detection, communication, intelligent decision-making, and control. However, AUVs rely on acoustic communication, which suffers from much lower bandwidth, higher latency, and more frequent interruptions due to the aquatic medium compared to terrestrial or aerial systems. In addition, the combined effect of actuator faults and strong, unpredictable ocean currents can rapidly escalate a single failure into a swarm-wide disruption. This critical interplay is a hallmark of the underwater environment. Furthermore, the absence of GPS and the inherent drift of underwater navigation make maintaining swarm cohesion especially challenging during faults [1]. Thus, achieving effective collaborative control of AUV swarms remains challenging due to factors such as communication interruptions, actuator failures, and the complexities of the underwater environment. Fault-tolerant control plays a critical role in enhancing the safety and accuracy of AUV operations, offering robust solutions to mitigate these challenges and ensure reliable swarm performance.
Recently, many studies on multi-vehicle cooperative formation have focused on the issue of communication interruptions under weak communication conditions. Yang et al. investigated the fault-tolerant formation maintenance problem for multi-UAV systems with a focus on minimal connected topology [2]. They proposed a topology design and reconstruction strategy to mitigate communication failures and analyzed system stability using switching system theory. Kamel et al. investigated the fault-tolerant cooperative control problem for multi-wheeled mobile vehicles in the event of severe actuator failures. They generated a new formation reconstruction when a vehicle in the formation experienced serious failure by solving the optimal allocation problem and proposed a hybrid method combining control parameterization, time discretization, and particle swarm optimization to solve the formation reconstruction issue [3]. Zúñiga and Mendoza proposed and demonstrated the effectiveness of Prim algorithm in solving the open vehicle routing problem (OVRP) [4]. In addressing leader failure issues in multi-AUV leader–follower formations, Juan Li et al. implemented minimum-cost formation reconfiguration using the Hungarian algorithm [5]. To address potential communication topology failures, Prim algorithm is commonly employed to efficiently reconstruct and optimize communication links. Meanwhile, the Hungarian algorithm is utilized to reassign target positions during formation reconfiguration following system failures. These methods collectively enhance the robustness and recovery capability of multi-robot systems.
While the aforementioned studies effectively addressed communication disruptions, they did not consider actuator failures in individual AUVs—an essential aspect of fault-tolerant control in AUV swarms. Tian et al. designed an adaptive law to estimate the actuator efficiency factor, enabling their fault-tolerant controller to effectively handle multiplicative actuator failures [6]. Additionally, methods that treat fault terms as unknown disturbance terms are also frequently employed. Li et al. achieved fault-tolerant control by designing an adaptive fixed-time integral sliding mode disturbance observer to estimate lumped disturbances that include fault terms [7,8]. These studies successfully solved fault-tolerant control for AUV actuator failures. However, in practical applications, the transient performance of the controller, particularly convergence rate and overshoot, can influence the overall performance of AUV fault-tolerant control.
Many studies have proposed methods for the transient performance of AUVs to enhance the system’s fault tolerance. Fischer et al. adopted a control strategy based on RISE (Robust Integral of the Sign of the Error) feedback technology to achieve asymptotic trajectory tracking for AUVs [9]. However, this work did not consider the transient performance of tracking errors and required the assumption that the upper bound of external disturbances is completely known, which greatly limits the applicability of the controller. Sun et al. employed preset performance control methods to constrain tracking errors within a given range [10], which effectively improved the transient performance of tracking errors, but only yielded results that ensured the system states are ultimately bounded. Moreover, prolonged peak outputs from AUV actuators can lead to failures, and input saturation is an essential consideration for fault-tolerant control. Yan et al. addressed distributed three-dimensional trajectory tracking for multiple AUVs with input saturation by employing hyperbolic tangent functions to mitigate actuator saturation risks [11]. Stability analysis based on the Lyapunov method demonstrated the convergence of estimation errors. Li et al. studied adaptive fixed-time fuzzy formation control for multi-AUV systems, considering time-varying tracking error constraints and asymmetric actuator saturation, employing smooth saturation functions and a new signal compensation mechanism to solve amplitude and rate-related input saturation issues [12]. Miao et al. explored the path tracking problem for multiple AUVs with uncertainties and input saturation, proposing an auxiliary dynamic system to compensate for input saturation [13]. Additionally, employing an event-triggered mechanism to reduce the communication frequency between controllers and actuators has also enhanced fault tolerance to some extent [14,15]. Chen et al. introduced a distributed event-triggered communication mechanism, allowing each AUV to communicate only when its own state is updated, thereby reducing communication frequency and improving stability [16]. These studies suggest that integrating prescribed performance control with auxiliary dynamic systems can effectively address error constraints and input saturation within a fixed time. Furthermore, incorporating event-triggered mechanisms to minimize resource consumption holds significant research value for improving the robustness and efficiency of AUV swarm control.
This paper proposes a fixed-time fault-tolerant control scheme for AUV formations that systematically addresses trajectory tracking under multiple practical constraints while maintaining computational feasibility. The proposed architecture achieves an optimal balance between performance and complexity through several key features: the integration of Prim and Hungarian algorithms provides effective solutions for topology reconstruction and position reassignment; the fixed-time extended state observer enables efficient disturbance estimation, while the performance function and auxiliary saturation system collectively handle error constraints while preserving stability. Furthermore, the event-triggered mechanism significantly reduces controller update frequency. These carefully integrated components ensure the scheme maintains practical implementability while achieving control objectives under communication interruptions, actuator failures, and system constraints.
(i)
A fault-tolerant control mechanism for multiple AUVs is proposed to address formation task failures caused by communication topology disruptions. The Prim algorithm is employed to reconstruct the communication topology after failures, while the Hungarian algorithm is used to solve the position assignment problem for formation transformation.
(ii)
To account for actuator failures within AUVs, a fixed-time extended state observer (ESO) is designed to accurately estimate velocity and observe lumped disturbances, including model uncertainties, unknown ocean disturbances, and actuator failures. This enhances the robustness against external and internal disturbances.
(iii)
Based on a performance function, the tracking error is reconstructed into error variables, forming a novel terminal sliding mode surface with these error variables. An auxiliary saturation system and event-triggered mechanism are integrated into the control design, leading to a fixed-time event-triggered formation control law and the stability of the closed-loop system is proved. This approach ensures compliance with error constraints, maintains system stability, and reduces the frequency of controller updates, thereby improving computational efficiency.
The specific research object model, along with some lemmas and assumptions, is presented in Section 2. A fixed-time fault-tolerant controller is designed in Section 3. Simulation results on multi-AUV are provided in Section 4. Finally, Section 5 provides the conclusion of this study.

2. Problem Formulation

2.1. Dynamic Models

The research object of this paper is a multi-AUV system consisting of one leader and N followers. The followers can obtain the state information of other AUVs through their own high-precision sensors. Based on this, the paper investigates the formation control problem of multi-AUV systems under the influence of actuator faults and communication topology faults. As shown in Figure 1, the dynamic model of the 6-DOF multi-AUV system is expressed as follows [17]:
η ˙ i = J ( η ) v i M i v ˙ i + C i v i v i + D i v i v i + g i ( η i ) = τ i + τ i F + d i ( t )
where η i = [ x i , y i , z i , φ i , θ i , ψ i ] T denotes the position and attitude information of the AUV relative to the fixed frame, v i ( t ) = [ u i , v i , w i , p i , q i , r i ] T represents the linear and angular velocity in the motion frame, and d i ( t ) denotes the external disturbance.
In addition, J ( η ) denotes the rotation matrix from the fixed frame to the motion frame, and it can be defined as follows:
J ( η ) = R ( η ) 0 3 × 3 0 3 × 3 T ( η )
R ( η ) = cos θ cos ψ sin φ sin θ cos ψ cos φ sin ψ cos φ sin θ cos ψ + sin φ sin ψ cos θ sin ψ sin φ sin θ sin ψ + cos φ cos ψ cos φ sin θ sin ψ sin φ cos ψ sin θ sin φ cos θ cos φ cos θ
T ( η ) = 1 sin φ tan θ cos φ tan θ 0 cos φ sin φ 0 sin φ sec θ cos φ sec θ
where M i is the inertial matrix, C i represents the matrix of centripetal and Coriolis, D i is the damping matrix composed of damping forces and moments and g i is the restoring forces and moments vector.
τ i F denotes the impact caused by actuator faults, and its specific expression is given as follows:
τ i F = B ( t T f ) ( ( E I ) sat ( τ i ) + τ ¯ i ) sat ( τ i ) = sign ( τ i ) τ i max , τ i τ i max τ i , τ i < τ i max ( i = 1 , 2 , 3 , 4 , 5 , 6 )
where τ i = [ τ i 1 , τ i 2 , τ i 3 , τ i 4 , τ i 5 , τ i 6 ] T denotes the control force and torque, and sat ( τ i ) = Δ τ i + τ i is saturation function, where Δ τ i represents the difference between the desired control output and the actual saturated output. τ i max represents the maximum force or torque output capability of each AUV’s actuator. To prevent the controller from sustaining peak output over extended periods and mitigate potential motor damage risks, it is imperative to implement a saturation function that incorporates τ i max . B denotes a constant matrix, T f denotes the time at which the fault occurs, and I denotes the identity diagonal matrix. τ ¯ i = [ τ ¯ i 1 , τ ¯ i 2 , τ ¯ i 3 , τ ¯ i 4 , τ ¯ i 5 , τ ¯ i 6 ] T represents faults. B ( t T f ) = diag ( b 1 ( t T f 1 ) , b 2 ( t T f 2 ) , b 3 ( t T f 3 ) , b 4 ( t T f 4 ) , b 5 ( t T f 5 ) , b 6 ( t T f 6 ) ] denotes the distribution of fault time. E = diag ( e 11 , e 12 , e 13 , e 14 , e 15 , e 16 ) , e i i denotes the health status of actuator, and 0 < e i i < 1 . The fault range distribution is expressed as follows:
b i ( t T f i ) = 0 t < T f i 1 e a f i ( t T f i ) t T f i
where a f i > 0 denotes the fault severity of the actuator.

2.2. Lemma and Assumption

Lemma 1 ([18] Fixed-time Stability).
If there exists a continuous radially unbounded function  V : n + 0 , such that:
(1)
V ( x ) = 0 x = 0 ;
(2)
Any solution  x t  satisfies the inequality:  V ( ˙ x ) r 1 V α ( x ) r 2 V β ( x ) .
Then the system is globally fixed-time stable, and  r 1 r 2 α β  are constant.  0 < α < 1 β > 1 , and  T  satisfies the inequality
T T max : = 1 r 1 ( 1 α ) + 1 r 2 ( β 1 )
(3)
Any solution  x t  satisfies the inequality:  V ( ˙ x ) r 1 V α ( x ) r 2 V β ( x ) + δ
When  δ 0 0 < θ < 1 , the system is practically fixed-time stable, and  T  satisfies the inequality:
T T max : = 1 r 1 θ ( 1 α ) + 1 r 2 θ ( β 1 )
Lemma 2  ([19] Young’s inequality).
For any vectors, the following inequality holds:
a b k a p p + k q / p b q q k a p + k q / p b q
where  a > 0 ,  b > 0 p > 1 ,  q > 1 ,  k > 1  and  1 p + 1 q = 1 .
Specifically, when  p = q = 2 , the above expression can be transformed into the following formula:  a b k 2 a 2 + 1 2 k b 2 .
Assumption 1.
The model fault term  τ i F  and disturbance  d i ( t )  as well as their derivatives  τ ˙ i F  and  d ˙ i ( t )  are all bounded. And  τ ¯ i F ,  τ ¯ d F ,  d ¯ ,  d ¯ d , all satisfy  τ i F τ ¯ i F ,  τ ˙ i F τ ¯ d F ,  d i ( t ) d ¯ ,  d ˙ i ( t ) d ¯ d .
Assumption 2.
The desired reference signal  η d  is sufficiently smooth, and the derivative of  η d  exists and is bounded.
Assumption 3.
There exists at least one directed path from the leader AUV to the follower AUV.
Assumption 4.
G ( x 1 i ) Δ τ i  is bounded and satisfies  G ( x 1 i ) Δ τ i κ , where  κ  is constant.

3. Fault-Tolerant Control of Multiple AUVs for Fixed-Time Formation

This section focuses on the design of a fixed-time fault-tolerant controller, with the overall framework illustrated in Figure 2, consisting of three modules, which will be introduced in three subsections. The first subsection completes the reconstruction of AUV formation under communication topology failures based on the Prim algorithm and the Hungarian algorithm. The second subsection designs a fixed-time ESO to estimate actuator failures, ocean current disturbances, and model uncertainties. The third subsection introduces a performance function and an auxiliary saturation system, reconstructs the error variables, and forms a novel terminal sliding mode surface using the error variables. Finally, this paper incorporates an event-triggered mechanism and proposes a fixed-time formation control law.

3.1. The Formation Reconfiguration Scheme Considering Communication Topology Failure

A fault-tolerant mechanism for multi-AUV systems is proposed to solve communication topology failure. The Prim algorithm is utilized to resolve the communication topology failure issue, while the Hungarian algorithm is employed to handle the position allocation problem during formation transformation after the multi-AUV formation is disrupted.

3.1.1. The Multi-AUV Communication Topology Reconstruction Method Based on the Prim Algorithm

When communication failures occur in an AUV system, the original communication topology can no longer maintain the formation structure. This section solved the problem of multi-AUV topology reconstruction based on the Prim algorithm. The Prim algorithm achieves a global optimal solution by iteratively finding local optimal solutions, calculating the edge subsets of all vertices in the graph, and ultimately generating a minimum spanning tree with the smallest total weight [20]. By utilizing the Prim algorithm, the reconstructed AUV formation minimizes communication costs, which are represented by a communication cost matrix. Algorithm 1 illustrates the fault-tolerant process of multi-AUV topology reconstruction based on the Prim algorithm:
Algorithm 1 The Multi-AUV Topology Reconstruction Process Based on Prim Algorithm
          Input:  G = ( V , E )
           V : the set of AUVs and E: the edges of graph
          w: weight function for the edges of AUV communication distance
          Output: Minimum spanning tree (T).
                   T← ∅ Initialize the minimum spanning tree
                   U{v0} Start from an arbitrary vertex v0
                   while |U| < |V| do
                           Select edge (u, v) ∈ E such that uU, vU and w(u, v) is minimum
                           Add edge (u, v) to T
                           Add vertex v to U
                   end while
           return T
The communication topology reconstruction of a multi-AUV system based on the Prim algorithm involves the following steps:
(1) Select the position of leader AUV as the vertex of the minimum spanning tree.
(2) Use the distances between multiple AUVs as the edge weights, identify all edges connected to the newly added vertex, and find the edge with the minimum weight to add it to the tree.
(3) Repeat step (2) until all AUV vertices are included, thereby constructing the minimum spanning tree.

3.1.2. The Formation Position Allocation Method Based on the Hungarian Algorithm

In the event of a communication topology failure in a multi-AUV system, the original formation can no longer perform its designated tasks. Under such circumstances, a formation transition is required. However, considering the limited energy carried by AUVs, the Hungarian algorithm is employed to achieve the optimal position allocation for the AUVs.
This study focuses on the problem of formation transition for follower AUVs after communication loss, assuming that the trajectory of the leader AUV is known. During the movement of multi-AUV formation, the distance transformation of follower AUVs relative to the leader AUV can be regarded as a transformation of relative distances. Therefore, in this section, the relative distances of follower AUVs before and after the two formation transitions are used to construct the coefficient matrix, and the assignment matrix for the follower formation transition is denoted as E i j . The following diagram illustrates the formation transition position allocation process based on the Hungarian algorithm (Algorithm 2):
Algorithm 2 The Formation Transition Position Allocation Based on Hungarian Algorithm
Input: AUV matrix of size n × m
Output: Optimal assignment matrix E i j
Step 1: Subtract the row minimum from each row
  for i from 1 to n: row_minimums = E min i
      for j from 1 to m: E i j = E min i
    for j from 1 to m: column_minimums = E min j
      for i from 1 to n: E i j = E min j
Step 2: Cover all zeros with a minimum number of lines
    while True://Find a zero in the matrix
      for i from 1 to n:
        for j from 1 to m:
          if cost_matrix[i][j] = 0 and not cover_rows[i] = True and not
          cover_cols[j] = True:
            break
        if zero is found: break
      if all columns are covered: break
Step 3: Create a new zero if necessary and find the smallest uncovered value
      for i from 1 to n:
        for j from 1 to m:
          if not cover_rows[i] and not cover_cols[j]:
            min_uncovered = min(min_uncovered, cost_matrix[i][j])
      //Subtract the smallest uncovered value from all uncovered elements
      for i from 1 to n:
        for j from 1 to m:
          if not cover_rows[i] and not cover_cols[j]: cost_matrix[i][j] −= min_uncovered
          elif cover_rows[i] and cover_cols[j]: cost_matrix[i][j] + = min_uncovered
Step 4: Construct the optimal assignment matrix E i j
    Back to step 2 until the number of circled zeros equals n
    return E i j

3.2. Fixed-Time Extended State Observer

This subsection estimates the lumped disturbance caused by model uncertainties, unknown ocean current, and actuator failures by fixed-time ESO, which is developed by integrating fixed-time control theory with observer theory.
The dynamic model of the AUV is reformulated as follows to facilitate the observer design:
x 1 i = η i x 2 i = η ˙ i
where η i = [ x i , y i , z i , φ i , θ i , ψ i ] T denotes the position and attitude information of the AUV relative to the fixed frame, η ˙ i = J ( η ) v i .
Substituting it into Equation (10), the following form can be obtained:
x ˙ 1 i = x 2 i x ˙ 2 i = F ( x 1 i , x 2 i ) + G ( x 1 i ) sat ( τ i ) + D i
where F ( x 1 i , x 2 i ) = M η i 1 ( C R B η i η ˙ i + C A η i η ˙ i + D η i η ˙ i + g η i ) , D i = M η i 1 ( τ i F + d i ( t ) ) , G ( x 1 i ) = M η i 1 .
Remark 1.
D i  is continuously differentiable and bounded, including fault terms, model uncertainties, and ocean disturbances. According to Assumption 1, there exists a constant  D υ  such that  D i D n < D υ ,  0 < D υ < .
The fixed-time ESO can be designed as follows [21]:
x ^ ˙ 1 i = x 2 i + c 1 T sig α 1 ( x ˜ 1 i ) + c 1 ( 1 T ) sig β 1 ( x ˜ 1 i ) x ^ ˙ 2 i = F ( x 1 i , x 2 i ) + G ( x 1 i ) sat ( τ i ) + D ^ i + c 2 T sig α 2 ( x ˜ 1 i ) + c 2 ( 1 T ) sig β 2 ( x ˜ 1 i ) D ^ ˙ i = c 3 T sig α 3 ( x ˜ 1 i ) + c 3 ( 1 T ) sig β 3 ( x ˜ 1 i ) + D υ sign ( x ˜ 1 i )
where x ^ 1 i is the estimated value of x 1 i , x ˜ 1 i = x 1 i x ^ 1 i , D υ are the observer gains, which satisfy D υ > D n , α 1 ( 1 Ζ , 1 ) , Ζ is a sufficiently small positive constant, and α 2 = 2 α 1 1 , α 3 = 3 α 1 2 . sig ( x ) α = | x | α sign ( x ) , where α > 0, while sign function returns values (−1, 0, or 1) solely based on the sign of the parameter. Similarly, β 1 ( 1 , 1 + Ζ ) , β 2 = 2 β 1 1 , β 3 = 3 β 1 2 . The switching function T : [ 0 , ) { 0 , 1 } satisfies:
T = 0 ,   if   t T u 1 ,   if   t > T u
where T u is the switching time, designed based on the observer gains. c 1 , c 2 , c 3 are constants to be designed. These constants are set to ensure that the coefficient matrix of the ESO is a Hurwitz matrix [21]. The coefficient matrix is as follows:
P = c 1 1 0 c 2 0 1 c 3 0 0
The observer is much more difficult to design in practical applications. However, by employing the observer gains c 1 , c 2 , c 3 and the switching time T u , it is obvious that the proposed fixed time disturbance observer is more convenient for selecting the observer gains. Therefore, compared with the other fixed time observers in [14,15], the proposed extended state observer can estimate the exact state and the disturbances within a fixed time, and achieve a more concise structure and far fewer parameters.
Theorem 1.
Based on Assumption 1, the fixed-time ESO can estimate the state variables  x 1 i  and  x 2 i  within a fixed time  T F . In addition, the estimation error of the lumped disturbance approaches a small vicinity around the origin within  T F .
Proof of Theorem 1 is provided in Appendix A.1.

3.3. Controller Design

3.3.1. Controller Design Based on Prescribed Performance

First, define the following error variable:
z 1 i = j Ν i a i j ( t ) ( x 1 i x 1 j x ij ( t ) ) + a i 0 ( t ) ( x 1 i x d x id ( t ) )
z ^ 2 i = j Ν i a i j ( t ) ( x ^ 2 i x ^ 2 j ) + a i 0 ( t ) ( x ^ 2 i x ˙ d )
where Ν i , a i j ( t ) , and a i 0 ( t ) are elements in the graph theory matrix, x ij ( t ) is the desired distance between the AUV-i and the AUV-j, and x i d ( t ) is the desired distance between the AUV-i and the leader AUV. a i j ( t ) , a i 0 ( t ) , x ij ( t ) and x id ( t ) are time-varying constant vectors, and a i d ( t ) = j N i a i j ( t ) + a i 0 ( t ) . z ^ 2 i is the estimated value of z 2 i , and z 2 i satisfies z 2 i = j Ν i a i j ( t ) ( x 2 i x 2 j ) + a i 0 ( t ) ( x 2 i x ˙ d ) .
Remark 2.
Based on the fixed-time ESO (12), at  t T F , satisfying  z ^ 2 i = z 2 i , (16) can be transformed into:
z ^ 2 i = z 2 i = j Ν i a i j ( t ) ( x 2 i x 2 j ) + a i 0 ( t ) ( x 2 i x ˙ d )
To achieve the purpose of error constraint, a time performance function is introduced, as shown below:
ρ i ( t ) = ( ρ 0 i ρ i ) ( 1 t T i ) μ i + ρ i , 0 t < T i ρ i , t T i
where  0 < ρ i < z 1 i ( 0 ) < ρ 0 i T i > 0  and  μ i > 2  is a constant. The constant  T i  represents the maximum predefined time for  ρ i ( t )  to converge from the largest initial value  ρ 0 i  to the maximum asymptotic value  ρ i and  ρ ˙ i ( t )  is the predefined minimum convergence rate.  ρ 0 i , as the initial value of the prescribed performance function  ρ i ( t ) , strictly defines the permissible initial range of the trajectory tracking error  z 1 i  for the AUV-i. These parameters directly govern transient performance and error constraint enforcement. The expression for  ρ ˙ i ( t )  can be obtained as: 
ρ ˙ i ( t ) = μ i T ( ρ 0 i ρ i ) ( 1 t T i ) μ i 1 , 0 t < T i 0 , t T i
According to (19), there exists  ρ ˙ i ( t ) < 0  at  0 t < T i ρ 0 i > ρ i .
lim t T i ρ i ( t ) = ( ρ 0 i ρ i ) ( 1 t T i ) μ i + ρ i = ρ i = lim t T i + ρ i ( t )
lim t T i ρ ˙ i ( t ) = μ i T i ( ρ 0 i ρ i ) ( 1 t T i ) μ i 1 = 0 = lim t T i + ρ ˙ i ( t )
Thus, ρ i ( t ) is a monotonically decreasing, bounded, smooth, and positive function. Since ρ i ( 0 ) = ρ 0 i and ρ i ( ) = ρ i , we can obtain 0 < ρ i ρ i ( t ) ρ 0 i , and then lim t T i ρ i ( t ) = ρ i .
To achieve the transient and steady-state performance of multi-AUV tracking and improve the operational safety of AUVs, the following prescribed performance is proposed based on the proposed time performance function (18):
c _ i ρ i ( t ) z 1 i c _ i ρ i ( t )
c _ i = ν i , z 1 i ( 0 ) 0 1 , z 1 i ( 0 ) < 0 , c _ i = 1 , z 1 i ( 0 ) 0 ν i , z 1 i ( 0 ) < 0
where 0 < ν i 1 is the overshoot exponential constant, z 1 i ( 0 ) is the initial position and attitude error of z 1 i .
Formula (18) cannot be directly used in controller design. Therefore, an error transformation function ξ ( x ) is defined to establish the relationship between the formation tracking error and the time performance function. The definition of ξ ( x ) is as follows:
ξ ( x ) = c _ i c ¯ i ( exp ( x ) 1 ) c _ i exp ( x ) c ¯ i
Taking the derivative of the above equation:
ξ ˙ ( x ) = c _ i c ¯ i exp ( x ) ( c ¯ i c _ i ) ( c _ i exp ( x ) c ¯ i ) 2
From (23), c _ i < 0 < c ¯ i ; thus it is known that ξ ˙ ( x ) > 0 , and ξ ( x ) is a monotonically increasing function, since ξ ( x ) x = c ¯ i , ξ ( x ) x = c _ i ; then we can obtain ξ ( x ) ( c _ i , c ¯ i ) . The relationship between the transformed error ε 1 i and the formation tracking error z 1 i is defined as:
z 1 i = ρ i ξ ( ε 1 i )
From the above equation, it can be concluded that z 1 i ( c _ i ρ i ( t ) , c ¯ i ρ i ( t ) ) satisfies the prescribed performance of (22). The inverse function of ξ ( x ) is denoted as:
ξ 1 ( x ) = ln ( c ¯ i ( x c _ i ) c _ i ( c ¯ x ) )
ξ 1 ( x ) is a smooth, monotonically increasing bijective function, satisfying lim ε 1 i c ¯ i ξ 1 ( ε 1 i ) = , lim ε 1 i c _ i ξ 1 ( ε 1 i ) = . According to (31):
ε 1 i = ξ 1 ( z 1 i ρ i )
Differentiating the above equation yields:
ε ˙ 1 i = B i ( z ˙ 1 i + A i z 1 i )
where B i , A i are defined as:
B i = ϑ ( z 1 i ρ i ) / ρ i , A i = ρ ˙ i ρ i
ϑ ( x ) is the derivative of ξ 1 ( x ) , denoted as:
ϑ ( x ) = ξ ˙ 1 ( x ) = 1 x c _ i + 1 c ¯ i x
From (29), the error can be expressed as:
ε ˙ 1 i = ε ^ 2 i = B i ( z ˙ 1 i + A i z 1 i )
ε ^ ˙ 2 i = B i ( z ¨ 1 i + A ˙ i z 1 i + A i z ˙ 1 i )
According to reference [22], A i = diag ( α 1 , , α 6 ) is a positive semi-definite diagonal matrix satisfying α k 0 ( k = 1 6 ) , and B i = diag ( b 1 , , b 6 ) is a positive definite diagonal matrix satisfying β k 2 ρ 0 i 1 ( k = 1 6 ) .
Based on the above error definition, a novel nonsingular terminal sliding mode surface is introduced as follows:
s i = sig a 1 ( ε 1 i ) + k 2 a 2 2 a 2 1 sig 2 1 a 2 ( ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) )
where k 1 > 0 , k 2 > 0 , a 2 > 1 , 1 < a 1 < 1 1 a 2 .
Theorem 2.
When  s i = 0 , both  ε 1 i  and  ε 2 i  can converge to zero within a fixed time  T 2 .
Proof of Theorem 2 is provided in Appendix A.2.

3.3.2. Design of Auxiliary Saturation Systems and Event-Triggered Mechanisms

The following auxiliary saturation system is introduced to solve the issue of input saturation [11]:
ς ˙ i = 0 , l 1 sig p ( ς i ) l 2 sig q ( ς i ) h ( ς i , s i , τ i ) + a i d ( t ) G ( x 1 i ) τ i , ς i < ζ i ς i ζ i
h ( ς i , s i , Δ τ i ) = ( s i + ς i ) λ max ( B i ) a i d ( t ) κ + k ς λ max ( Γ i ) s i ς i ς i 2 ς i
where ς i is the state vector of the auxiliary saturation system, ς i ( 0 ) = ς 0 i , ς 0 i is a position vector, l 1 > 0 , l 2 > 0 , p > 1 , 0 < q < 1 , ζ i ( i = 1 , 2 N ) is a small positive constant, and k ζ is a designed constant. When ς i < ζ i , no input saturation occurs, and the auxiliary variable is expressed as ς ˙ i = 0 ; when ς i ζ i , input saturation occurs, and the auxiliary variable is expressed as follows:
ς ˙ i = l 1 sig p ( ς i ) l 2 sig q ( ς i ) h ( ς i , s i , Δ τ i ) + a i d ( t ) G ( x 1 i ) Δ τ i
Considering input saturation, model uncertainties, and unknown ocean disturbances, the control law can be designed as:
u i = u i 1 + u i 2 + u i 3
u i 1 = G 1 ( x 1 i ) ( F ( x 1 i , x ^ 2 i ) ) + G 1 ( x 1 i ) a i d ( t ) [ j Ν i a i j ( t ) x ^ ˙ 2 j + a i d ( t ) x ¨ d A ˙ i z 1 i A z ˙ 1 i   + B 1 ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) δ ( σ 1 ε 1 i + σ 2 ε ^ 2 i ) sign ( s i )   k 1 a 1 diag ( ε 1 i ) a 1 1 ( ε ^ 2 i + Λ i k 1 ) ) ]
u i 2 = G 1 ( x 1 i ) D ^ i
u i 3 = G 1 ( x 1 i ) a i d ( t ) B 1 k ς i ς i
where the expression for Λ i is as follows:
Λ i = 1 k 2 sig 1 a 2 [ ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) ] + k 1 a 1 2 a 2 1 [ ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) ]
where γ 1 > 0 , γ 2 > 0 , p > 1 , 0 < q < 1 , k 1 , k 2 , δ , σ 1 , σ 2 are positive constants.
By introducing an event-triggered mechanism, we first define t 0 , t 1 t k , which represents the time sequence of event triggers, where t k denotes the triggering instants. The measurement error Δ e i ( t ) is defined as follows:
Δ e i ( t ) = u i ( t k ) u i ( t )
Define the actual control input as:
τ i ( t ) = u i ( t k ) , t [ t k , t k + 1 )
The event-triggering condition is defined as:
t k + 1 = inf { t > t k : f i ( t ) 0 ; k Ν } , t 0 = 0
where f i ( t ) is defined as:
f i ( t ) = 0.5 a i d λ max ( G ( x , t ) ) λ max ( B ) ( s i 2 + Δ e i ( t ) 2 ) δ ( σ 1 ε 1 i + σ 2   ε   ^ 2 i ) s i σ 3 e γ t

3.3.3. Stability Analysis and the Exclusion of No Zeno Behavior for Controller

Zeno behavior [6] refers to the phenomenon in event-triggered control where an infinite number of triggering events occur within a finite time period, and the inter-event intervals converge to zero. This behavior can compromise system stability and is directly related to the design of the event-triggering condition. To prevent Zeno behavior, a strictly positive lower bound must be guaranteed for the inter-event intervals.
Theorem 3.
For the system (9) with model uncertainties, unknown ocean disturbances, actuator faults, and communication topology faults, under the fixed-time ESO (12), trajectory error constraints (22), and control law (38), combined with the event-triggered mechanisms (44)–(46), the entire AUV formation can achieve convergence within a fixed time. Moreover, the proposed scheme eliminates Zeno behavior while ensuring that the formation tracking error converges within fixed time, thus achieving fault-tolerant control for the multi-AUV formation system.
The proof of Theorem 3 is provided in Appendix A.3.

4. Simulation Results

In the simulation, one leader (labeled as 0) is selected, which typically represents the control signal issued by the command center in practical applications. Five followers (labeled as 1, 2, 3, 4, and 5) are included. The simulation environment models a multi-AUV system conducting resource exploration. During the process, one AUV suddenly loses communication. To improve the accuracy of resource exploration, a formation reconfiguration is performed, making the AUV formation more compact. The relative distances between AUVs are set as: x 10 = [ 3 , 4 , 0 , 0 , 0 , 0 ] T , x 21 = [ 6 , 0 , 0 , 0 , 0 , 0 ] T , x 32 = [ 0 , 4 , 0 , 0 , 0 , 0 ] T , x 53 = [ 3 , 4 , 0 , 0 , 0 , 0 ] T , x 41 = [ 0 , 4 , 0 , 0 , 0 , 0 ] T , the communication topology is shown as follows (Figure 3):

4.1. Simulation Settings

In this study, the Ocean Bottom Flying Node (OBFN), as a fully actuated AUV, is selected for simulation experiments. The specific model parameters are provided in Table 1 and Table 2, while the initial positions and velocities are listed in Table 3 and Table 4.
In this study, the ocean current is simulated using a first-order Gauss–Markov process [23], as shown below:
V ˙ c + μ V c = ω
In the above equation, V c represents the magnitude of the ocean current velocity in the fixed coordinate system. ω is Gaussian white noise with a mean of 1 and a variance of 1, μ = 3 .
The simulation selects a 30% model uncertainty to solve the model uncertainty of the AUV itself, meaning that the nominal value of the dynamic model in the controller is 70% of the actual value.
The position of the leader is specified as:
η 1 ( t ) = 6 sin ( 0.1 t ) + 5 η 2 ( t ) = 5 cos ( 0.1 t ) + 1 η 3 ( t ) = 0.5144 t η 4 ( t ) = 0.2 η 5 ( t ) = 0 η 6 ( t ) = 0
To verify the effectiveness of the Prim algorithm for topology reconstruction, a simulation experiment is designed. The simulation time is set to 100 s, and at 20 s, Follower AUV-1 loses connection. At this moment, its communication cost matrix is as follows:
C i j = 0 5 73 73 12 5 0 4 52 52 73 4 0 6 5 73 52 6 0 5 12 52 5 5 0
After computation, the topology graph generated by the Prim algorithm is as follows:
To simulate formation reconfiguration following a topology failure, the transformation is triggered at t = 70 s in the simulation. The reconfigured formation is depicted in Figure 4, with the relative distances from the leader AUV defined as follows: x 1 d = [ 3 , 4 , 0 , 0 , 0 , 0 ] T , x 2 d = [ 0 , 4 , 0 , 0 , 0 , 0 ] T , x 3 d = [ 3 , 4 , 0 , 0 , 0 , 0 ] T , x 4 d = [ 0 , 8 , 0 , 0 , 0 , 0 ] T . The relative distance position can be represented as follows (Figure 5):
The communication cost matrix of the Prim algorithm after the transformation is as follows:
C i j = 0 5 4 5 8 5 0 3 6 5 4 3 0 3 4 5 6 3 0 5 8 5 4 5 0
The communication topology graph calculated using the Prim algorithm is as follows (Figure 6) (①, ②, ③, and ④ represent the sequence in the topological diagram and do not refer to a specific AUV):
The Hungarian algorithm is employed for optimal position assignment during formation transformation, with its cost matrix constructed as follows:
E i j = 0 3 6 5 4 5 52 3 52 5 4 3 73 8 73 4
The formation transformation assignment results obtained using the Hungarian algorithm are summarized in Figure 7.
From the assignment results, positions ①, ②, ③, and ④ are assigned to AUV-2,3,4 and 5, respectively. Finally, the communication topology graph is shown in Figure 7.
The parameter selection is rigorously derived from fixed-time stability theory and tuned via numerical simulations to balance convergence speed, robustness, and implementation feasibility. All parameters are validated in both nominal and fault scenarios to ensure consistent performance. The control parameters are as follows, with the fixed-time ESO coefficients being c 1 = 500 , c 2 = 50 , c 3 = 2000 , α 1 = 0.6 , and β 1 = 1.4 . The parameters of the prescribed performance function are ρ 01 = 10 , T 1 = 8   s , ρ 02 = 10 , T 2 = 8   s , ρ 03 = 14 , T 3 = 10   s , ρ 04 = 12 , T 4 = 10   s , ρ 05 = 14 , T 5 = 11   s , μ i = 2.01 ( i = 1 ~ 5 ) , and ρ i = 0.1 ( i = 1 ~ 5 ) ; the parameters of the fixed-time terminal sliding mode surface are a 1 = 1.5 , a 2 = 2 , k 1 = 1.2 , and k 2 = 1.2 ; the parameters of the saturation auxiliary system are l 1 = 1.2 , l 2 = 1.2 , p = 1.1 , q = 0.7 , k ζ = 0.01 , and κ = 1000 ; the initial parameters of ς i are set as ς i ( 0 ) = [ 0.01 , 0.01 , 0.01 , 0.01 , 0.01 , 0.01 ] T , and ζ i = 0.001 ( i = 1 6 ) . The relevant parameters of the remaining controller are set as τ i max = 300   N ( i = 1 3 ) , τ i max = 300   N m ( i = 4 6 ) , γ 1 = 1.2 , γ 2 = 1.2 , δ = 0.01 , σ 1 = 5 , σ 2 = 5 , σ 3 = 1.25 , and γ = 2 .
The fault model of follower AUVs: a f 1 = [ 1 , 1 , 1 , 1 , 1 , 1 ] T , T f 1 = 10   s , τ ¯ 1 = 4 , 4 , 4 , 4 , 4 , 4 T , E 1 = diag ( 0.5 , 0.5 , 0.5 , 0.7 , 0.7 , 0.7 ) , a f 2 = [ 1 , 1 , 1 , 1 , 1 , 1 ] T , T f 2 = 10   s , τ ¯ 2 = 10 , 10 , 10 , 4 , 4 , 4 T , E 2 = diag ( 0.9 , 0.9 , 0.9 , 0.9 , 0.9 , 0.9 ) , a f 4 = [ 1 , 1 , 1 , 1 , 1 , 1 ] T , T f 4 = 50   s , τ ¯ 4 = 4 , 4 , 4 , 4 , 4 , 4 T , E 4 = diag ( 0.7 , 0.7 , 0.7 , 0.7 , 0.7 , 0.7 ) .

4.2. Results

Figure 3 and Figure 5 illustrate the communication topology reconstruction results using the Prim algorithm. Figure 3 shows that after a communication topology failure occurs for follower AUV-1 at 20 s, the Prim algorithm can reconstruct the communication topology with minimal communication cost. Figure 5 demonstrates that during the formation transformation at 70 s, the Prim algorithm calculates the minimal communication cost to reconstruct the multi-AUV communication topology, confirming the effectiveness of the Prim-based multi-AUV topology reconstruction. Figure 6 and Figure 7 present the results of formation transition position allocation using the Hungarian algorithm. The formation transition position allocation cost at this time is 13 m, which is the minimal position allocation cost, validating the effectiveness of the Hungarian algorithm for formation transition position allocation.
Figure 8 shows the trajectories of the multi-AUV formation, illustrating the formation shapes at 10 s, 40 s, and 85 s from bottom to top. During 0–20 s, the entire formation is in a hexagonal shape. At 20 s, follower AUV-1 loses connection, causing a communication topology failure. After reconstructing the topology, the formation changes to a pentagonal shape. Following a formation transformation after 70 s, the formation becomes quadrilateral. As illustrated in Figure 8, the entire AUV formation successfully transitions from a hexagonal configuration to a pentagonal one, and ultimately to a quadrilateral shape. This progression effectively demonstrates the algorithm’s capability in addressing communication topology failures and facilitating formation transformations.
Figure 9 and Figure 10 illustrate the displacement and angle variations of the multi-AUV system. At 20 s, when a topology failure occurs, there are no abrupt changes in the displacement or angle of each AUV, demonstrating the effectiveness of the Prim algorithm in reconstructing the topology and maintaining the formation. At 70 s, during the formation transformation, the displacement and angle of each AUV begin to change. At this point, the Prim algorithm continues to reconstruct the multi-AUV topology, while the Hungarian algorithm assigns positions for the formation transformation. Around 10 s later, the displacement and angle of each AUV stabilize at the new formation positions, completing the formation transformation with stable formation performance.
Taking follower AUV-2 as an example, Figure 11 shows the lumped disturbance force and disturbance torque values estimated by the fixed-time ESO. The red line represents the estimated value of the lumped disturbance by the fixed-time ESO of follower AUV-2, while the blue line represents the actual value. There are slight fluctuations at 20 s during the topology transformation and at 70 s during the formation transition, but these do not affect the subsequent control performance. Figure 12 demonstrates the accurate estimation of velocity states, effectively addressing the issue of measurement inaccuracies caused by rapid velocity changes in practical engineering applications.
We take follower AUV-2 as an example to illustrate the effectiveness of the error constraints discussed in this section. Figure 13 presents the error and its associated constraints for follower AUV-2. Figure 13 illustrates the effect of error constraints, where the blue line represents the boundary of the time performance function, and the green line represents the error of follower AUV-2. It can be observed that throughout the entire formation operation, the error of follower AUV-2 consistently remains within the boundaries of the specified time performance function. This error constraint enhances the control accuracy of the formation, thereby validating the effectiveness of the error constraint algorithm proposed in this section.
Figure 14 shows the control force and control torque diagrams. It can be observed that the force and torque are relatively large in the initial stage, and saturation occurs during the convergence process. Under the effect of the auxiliary saturation system, the control force is limited, and throughout this process, the control force and control torque consistently remain within the set saturation values, validating the effectiveness of the auxiliary saturation system.
Taking follower AUV-2 as an example, Figure 15 and Figure 16 show its triggering moments and triggering intervals from 20 s to 30 s. It can be observed that the triggering instants are non-uniform, and the maximum triggering interval exceeds 1.5 s. Table 5 presents the number of event triggers for multiple AUVs, with the non-triggering ratio reaching over 80%. It is evident that, compared to time-based control methods, the event-triggered approach reduces the number of transmissions between the controller and the actuator, conserving transmission resources and, to some extent, reducing actuator wear. Table 5 shows the number of event-triggered for each AUV.
To verify the superiority of the fixed-time sliding mode control with error constraints proposed in this section, a comparison is made with the fixed-time integral terminal sliding mode control (FTITSMC) presented in reference [24]. It was chosen for comparison because it represents an advanced fixed-time control solution in current literature and addresses a similar control challenge, though in a different application context. The selected fixed-time terminal sliding mode surface is as follows:
s i = z i 2 + 0 t k i 1 G 1 ( z i 1 ( T ) ) + k i 2 G 2 ( z i 2 ( T ) ) d T
The corresponding part of the control law can be transformed into:
u i 1 = G 1 ( x 1 i ) ( F ( x 1 i , x 2 i ) ) + G 1 ( x 1 i ) a i d ( j Ν i a i j x ˙ 2 j + a i d x ¨ d + k 1 G 1 ( z i 1 ( T ) )     + k 2 G 2 ( z i 2 ( T ) ) + γ 1 sig r 1 ( s i ) + γ 2 sign ( s i ) )
where k 1 = k 2 = 1.2 , α 1 = 0.95 , β 1 = 1.05 , γ 1 = γ 2 = 1.2 . The algorithm proposed in this paper is referred to as PPFNFTSMC, while the algorithm in reference [24] is referred to as FTITSMC. The error comparison diagram is shown in Figure 17.
The results show that, under the same parameter conditions, the error convergence speed of the algorithm proposed in this section is faster, and the error consistently remains within the boundary defined by the time performance function. In contrast, the algorithm from reference [24] exhibits a slower error convergence speed and some overshot. The simulations presented above validate the effectiveness of the control algorithm developed in this section.

5. Conclusions

In this research, issues such as communication interruptions, actuator failures, dynamic uncertainties, environmental disturbances, transient performance, and input saturation in fault-tolerant control of multi-AUV cooperative formation are considered. A formation reconstruction mechanism is designed based on the Prim algorithm and the Hungarian algorithm, allowing for the reconstruction of communication topology. In simulations, the AUV swarm is reformulated in response to AUV disconnection, achieving fault-tolerant control under weak communication conditions. A fixed-time ESO is introduced to accurately estimate the lumped disturbances in the system, which consist of model uncertainties, environmental disturbances, and actuator failures. By introducing performance functions and input saturation functions, a novel event-triggered terminal sliding mode controller is constructed, which constrains the error and actuator inputs within predefined limits while reducing the frequency of controller updates. This approach ensures system robustness and avoids potential damage to the actuators. The event-triggered fault-tolerant formation control for AUV swarms in this paper has been verified through theoretical proof and simulation research.

Author Contributions

Z.W.: Resources, Methodology, Funding acquisition, Conceptualization. S.J.: Writing—original draft, Validation, Methodology, Investigation. Y.X.: Writing—review and editing, Investigation, Funding acquisition, Data curation. X.M.: Supervision, Software, Project administration. C.W.: Validation, Data curation. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by The National Natural Science Foundation of China under Grant (No. 52131101) and Shandong Provincial Natural Science Foundation under Grant (No. ZR2023QE027).

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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Abbreviations

The following abbreviations are used in this manuscript:
AUVAutonomous underwater vehicles
ESOExtended state observer
PPFNFTSMC Prescribed performance fixed-time nonsingular fast terminal sliding mode control
FTITSMCFixed-time integral terminal sliding mode control

Appendix A

Appendix A.1

The complete proof of Theorem 1 is presented below.
Proof of Theorem 1.
Define the error as follows:
e ˜ 1 i = x 1 i x ^ 1 i e ˜ 2 i = x 2 i x ^ 2 i e ˜ 3 i = D i D ^ i
Furthermore, by taking the derivative:
e ˜ ˙ 1 i = e ˜ 2 i c 1 T sig α 1 ( e ˜ 1 i ) c 1 ( 1 T ) sig β 1 ( e ˜ 1 i ) e ˜ ˙ 2 i = e ˜ 3 i c 2 T sig α 2 ( e ˜ 1 i ) c 2 ( 1 T ) sig β 2 ( e ˜ 1 i ) e ˜ ˙ 3 i = D ˙ i c 3 T sig α 3 ( e ˜ 1 i ) c 3 ( 1 T ) sig β 3 ( e ˜ 1 i ) D υ sign ( e ˜ 1 i )
The fixed-time ESO designed in this subsection is identical to that in reference [25]. Therefore, the estimation error can converge within T 1 , which satisfies:
T 1 = 2 λ max ( K ) λ min ( Q ) 2 1 α 1 ( β 1 1 4 λ min ( Q ) λ max ( P ) T u ) 1 α 1 1 β 1 + T u
K and Q are nonsingular symmetric positive definite matrix, and K P + P T K = Q . When t > T 1 , there is D ˙ i D υ sign ( e ˜ 1 i ) = 0 .
Reference [21] provides the e 3 i τ , such that e 3 i can reach this neighborhood within T d , satisfying:
T d = e 3 i τ D υ D n
Thus, the upper bound of the convergence time for the fixed-time ESO is T F = T 1 + T d , the proof is complete. □

Appendix A.2

The complete proof of Theorem 2 is presented below.
Proof of Theorem 2.
If s i = 0 , (34) can be rewritten as:
ε 2 i = k 1 sig a 1 ( ε 1 i ) ( 2 a 2 1 k 2 a 2 ) a 2 2 a 2 1 sig a 1 a 2 2 a 2 1 ( ε 1 i )
let: k ¯ 1 = k 1 , a ¯ 1 = a 1 , k ¯ 2 = ( 2 a 2 1 k 2 a 2 ) a 2 2 a 2 1 , a ¯ 2 = a 1 a 2 2 a 2 1 .
At this point, (A5) can be expressed as:
ε ^ 2 i = k ¯ 1 sig a ¯ 1 ( ε 1 i ) k ¯ 2 sig a ¯ 2 ( ε 1 i )
From Lemma 1, it is known that (A6) is fixed-time stable, and the upper bound of the convergence time is as follows:
T 2 1 k ¯ 1 ( a ¯ 1 1 ) + 1 k ¯ 2 ( 1 a ¯ 2 )
The proof is complete. □

Appendix A.3

The complete proof of Theorem 3 is presented below.
Proof of Theorem 3.
When ς i ζ i , the input-saturated system is working, an appropriate Lyapunov function [8] is first selected as follows:
V 2 = i = 1 N 1 2 s i T s i + i = 1 N 1 2 ς i T ς i
Taking the derivative of the above equation yields:
V ˙ 2 = i = 1 N s i T s ˙ i + i = 1 N ς i T ς ˙ i
According to (30),
s ˙ i = a 1 diag ( ε 1 i a 1 1 ) ε ^ 2 i + k 2 [ diag ( ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) 1 1 a 2 )   ( ε ^ ˙ 2 i + k 1 a 1 diag ( ε 1 i a 1 1 ) ε ^ 2 i ]
Expanding the above equation:
s ˙ i = a 1 diag ( ε 1 i a 1 1 ) ε ^ 2 i + k 2 [ diag ( ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) 1 1 a 2 ) ( B i ( a i d ( t ) ( F ( x 1 i , x ^ 2 i )   + G ( x 1 i ) sat ( τ i ) + D i ) j Ν i a i j ( t ) x ^ ˙ 2 j a i 0 ( t ) x ¨ d + A ˙ i z 1 i + A i z ˙ 1 i )   + k 1 a 1 diag ( ε 1 i a 1 1 ) ε ^ 2 i ]
Substituting the control law (38) into (A11),when T > T F ,since D ˜ i is very small, it can be considered that D ˜ i = 0 ,thus:
s ˙ i = a 1 diag ( ε 1 i a 1 1 ) ε ^ 2 i + k 2 [ diag ( ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) 1 1 a 2 )     ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) δ ( σ 1 ε 1 i + σ 2 ε ^ 2 i ) sign ( s i ) a 1 diag ( ε 1 i a 1 1 ) Λ i     + B i a i d ( t ) G ( x 1 i ) Δ e i ( t ) + k ς ς i + B i a i d ( t ) G ( x 1 i ) Δ τ i ]
Substituting (A12) into (A9):
V ˙ 2 = i = 1 N ( s i T ( a 1 diag ( ε 1 i a 1 1 ) ε ^ 2 i + k 2 [ diag ( ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) 1 1 a 2 )     ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) δ ( σ 1 ε 1 i + σ 2 ε ^ 2 i ) sign ( s i ) a 1 diag ( ε 1 i a 1 1 ) Λ i     + B i a i d ( t ) G ( x 1 i ) Δ e i ( t ) + k ς ς i + B i a i d ( t ) G ( x 1 i ) Δ τ i ] ) ) + i = 1 N ς i T ς ˙ i
According to (42):
k 2 diag ( ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) 1 1 a 2 ) Λ i = ε ^ 2 i + k 1 s i
Substituting (A14) into (A13):
V ˙ 2 = i = 1 N ( s i T [ k 1 a 1 diag ( ε 1 i a 1 1 ) s i + k 2 diag ( ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) 1 1 a 2 )     ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) δ ( σ 1 ε 1 i + σ 2 ε ^ 2 i ) sign ( s i ) + B i a i d ( t ) G ( x 1 i ) Δ e i ( t )   + k ς ς i + B i a i d ( t ) G ( x 1 i ) Δ τ i ) ] ) + i = 1 N ς i T ς ˙ i
Because k 1 a 1 s i T diag ( ε 1 i a 1 1 ) s i is negative definite, let Γ i = k 2 diag ( ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) 1 1 a 2 ) ,
V ˙ 2 i = 1 N ( s i T Γ i ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) ) s i T Γ i δ   ( σ 1 ε 1 i + σ 2 ε ^ 2 i ) sign ( s i )   + s i T Γ i B i a i d ( t ) G ( x 1 i ) Δ e i ( t ) + s i T Γ i ( k ς ς i + B i a i d ( t ) G ( x 1 i ) Δ τ i ) ) + i = 1 N ς i T ς ˙ i
According to Theorem 1, it is known that:
  s i T B i a i d ( t ) G ( x 1 i ) Δ e i ( t ) 0.5 a i d ( t ) λ max ( B i ) λ max ( G ( x 1 i ) ) ( s i 2 + Δ e i ( t ) 2 )
V ˙ 2 i = 1 N ( s i T Γ i ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) ) Γ i δ   ( σ 1 ε 1 i + σ 2 ε ^ 2 i ) s i   + 0.5 Γ i a i d ( t ) λ max ( B i ) λ max ( G ( x 1 i ) ) ( s i 2 + Δ e i ( t ) 2 ) ) + s i T Γ i ( k ς ς i   + B i a i d ( t ) G ( x 1 i ) Δ τ i ) ) + i = 1 N ς i T ς ˙ i
According to (46):
V ˙ 2 i = 1 N ( s i T Γ i ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) ) + Γ i ( f i ( t ) + σ 3 e γ t ) + s i T Γ i ( k ς ς i   + B i a i d ( t ) G ( x 1 i ) Δ τ i ) ) + i = 1 N ς i T ς ˙ i i = 1 N ( s i T Γ i ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) ) + s i T Γ i ( k ς ς i + B i a i d ( t ) G ( x 1 i ) Δ τ i ) )   + i = 1 N ς i T ς ˙ i + i = 1 N Γ i σ 3 e γ t
Substituting ς i ζ i into (A19):
V ˙ 2 i = 1 N ( s i T Γ i ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) ) + s i T Γ i ( k ς ς i + B i a i d ( t ) G ( x 1 i ) Δ τ i ) ) + i = 1 N ς i T ( l 1 sig p ( ς i ) l 2 sig q ( ς i ) h ( ς i , s i , Δ τ i ) + B i a i d ( t ) G ( x 1 i ) Δ τ i ) + i = 1 N Γ i σ 3 e γ t
Substituting (36) into (A20):
V ˙ 2 i = 1 N ( s i T Γ i ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) ) + s i T Γ i ( k ς ς i + B i a i d ( t ) G ( x 1 i ) Δ τ i ) )   i = 1 N ( l 1 ς i T sig p ( ς i ) + l 2 ς i T sig q ( ς i ) + ( s i + ς i ) λ max ( Γ i ) λ max ( B i ) a i d ( t ) κ     + k ς λ max ( Γ i ) s i ς i ς i T Γ i B i a i d ( t ) G ( x 1 i ) Δ τ i ) + i = 1 N Γ i σ 3 e γ t i = 1 N s i T Γ i ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) ) i = 1 N ( l 1 ς i T sig p ( ς i ) + l 2 ς i T sig q ( ς i ) )   + i = 1 N Γ i σ 3 e γ t
At this point, the following results can be obtained:
V ˙ 2 H 1 V 2 p + 1 2 H 2 V 2 q + 1 2 + υ 1
where H 1 , H 2 , υ 1 are defined as:
H 1 = min ( 2 ) p + 1 2 γ 1 N 1 p 2 λ min ( Γ i ) , ( 2 ) p + 1 2 l 1 N 1 p 2 H 2 = min ( 2 ) q + 1 2 γ 2 λ min ( Γ i ) , ( 2 ) q + 1 2 l 2 υ 1 = i = 1 N λ max ( Γ i ) σ 3 e γ t
When ς i < ζ i , there is no input saturation in this case, and ς ˙ i = 0 , Δ τ i = 0 , the Lyapunov function is as follows:
V 2 = i = 1 N 1 2 s i T s i
Similarly to the case with input saturation mentioned above, substituting the control input:
V ˙ 2 i = 1 N s i T Γ i ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) ) + i = 1 N ( s i T Γ i k ς ς i + Γ i σ 3 e γ t )
According to Theorem 1, it can be concluded that:
s i T Γ i k ς ς i 0.5 λ max ( Γ i ) k ς ( s i 2 + ς i 2 )
Because s i is bounded, there exists a constant s i 2 k s , then:
V ˙ 2 H 3 V 2 p + 1 2 H 4 V 2 q + 1 2 + υ 2
where H 3 , H 4 , υ 2 are defined as:
H 3 = ( 2 ) p + 1 2 γ 1 N 1 p 2 λ min ( Γ i ) H 4 = ( 2 ) q + 1 2 γ 2 λ min ( Γ i ) υ 2 = i = 1 N 0.5 λ max ( Γ i ) k ς ( k s + ζ i 2 ) + λ max ( Γ i ) σ 3 e γ t
Let ι i = ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) ; thus Γ i = k 2 diag ( ι i 1 1 a 2 ) , if ι i 0 , Γ i > 0 . At this point, the system can be divided into two distinct regions:
Ω 1 = ( ε 1 i n , ε 2 i n ) Γ i n 1 } ( n = 1 6 ) Ω 2 = ( ε 1 i n , ε 2 i n ) Γ i n 1 }
If Γ i n > 1 , ι i ( 1 k 2 ) a 2 / ( a 2 1 ) , and H 1 , H 2 , H 3 , H 4 can be written as:
H 1 = min ( 2 ) p + 1 2 γ 1 N 1 p 2 , ( 2 ) p + 1 2 l 1 N 1 p 2 H 2 = min ( 2 ) q + 1 2 γ 2 , ( 2 ) q + 1 2 l 2 H 3 = ( 2 ) p + 1 2 γ 1 N 1 p 2 H 4 = ( 2 ) q + 1 2 γ 2
Thus, the entire system satisfies:
V ˙ 2 H 5 V 2 p + 1 2 H 6 V 2 q + 1 2 + υ 3
where H 5 , H 6 , υ 3 are defined as:
H 5 = min ( 2 ) p + 1 2 γ 1 N 1 p 2 , ( 2 ) p + 1 2 l 1 N 1 p 2 H 6 = min ( 2 ) q + 1 2 γ 2 , ( 2 ) q + 1 2 l 2 υ 3 = i = 1 N ( 0.5 λ max ( Γ i ) k ς ( k s + ζ i 2 ) + λ max ( Γ i ) σ 3 e γ t )
According to Lyapunov stability theory [8]:
T 3 < T 3 max : = 1 H 5 ο ( p + 1 2 1 ) + 1 H 6 ο ( 1 q + 1 2 )
where 0 < ο < 1 .
If 0 < Γ i n < 1 , according to (A27), s i = 0 is an attraction region. Next, we aim to prove that, apart from the origin ι i = 0 , it is not an attraction region. If ι i = ε ^ 2 i + k 1 sig a 1 ( ε 1 i ) = 0 , we can obtain:
Γ i = 0
Substituting (A34) into (38):
u i = G 1 ( x 1 i ) ( F ( x 1 i , x ^ 2 i ) ) + G 1 ( x 1 i ) a i d ( t ) [ j Ν i a i j ( t ) x ^ ˙ j + a i d ( t ) x ¨ d A ˙ i z 1 i A z ˙ 1 i   + B 1 ( γ 1 sig p ( s i ) γ 2 sig q ( s i ) δ ( σ 1 ε 1 i + σ 2 ε ^ 2 i ) sign ( s i )   k 1 a 1 diag ( ε 1 i ) a 1 1 ε ^ 2 i ] G 1 ( x 1 i ) D ^ + G 1 ( x 1 i ) a i d ( t ) B 1 k ς i ς i
Differentiating ι i , we obtain:
ι ˙ i = ε ^ ˙ 2 i + k 1 a 1 diag ( ε 1 i a 1 1 ) ε ^ 2 i     = B i ( a i d ( t ) ( F ( x 1 i , x ^ 2 i ) + G ( x 1 i ) sat ( τ i ) + D i ) j Ν i a i j ( t ) x ^ ˙ 2 j   a i 0 ( t ) x ¨ d + A ˙ i z 1 i + A i z ˙ 1 i ) + k 1 a 1 diag ( ε 1 i a 1 1 ) ε ^ 2 i
Substituting (A35) into (A36):
ι ˙ i = γ 1 sig p ( s i ) γ 2 sig q ( s i ) δ ( σ 1 ε 1 i + σ 2 ε ^ 2 i ) sign ( s i )
If s i > 0 , then ι ˙ i < 0 ; if s i < 0 , then ι ˙ i > 0 . Therefore, it can be concluded that the system state will monotonically pass through Ω 2 within a finite time. For χ > 0 , there exists a constant γ ( χ ) > 0 to specify the time interval for passing through the region Ω 2 . Thus, the total convergence time T is:
T T F + T 2 + T 3 + γ ( χ ) < 2 λ max ( K ) λ min ( Q ) 2 1 α 1 ( β 1 1 4 λ min ( Q ) λ max ( P ) T u ) 1 α 1 1 β 1 + T u + 1 k ¯ 1 ( a ¯ 1 1 ) + 1 k ¯ 2 ( 1 a ¯ 2 ) + 1 H 5 ο ( p + 1 2 1 ) + 1 H 6 ο ( 1 q + 1 2 ) + γ ( χ )
Combining the above analysis, it can be concluded that when t > T the formation tracking error eventually converges to a bounded region, as shown below:
z 1 i [ ρ i c _ i , ρ i c ¯ i ]
when t < T , the tracking error satisfies Equation (22).
Zeno behavior can be excluded, according to Δ e i ( t ) = u i ( t k ) u i ( t ) , t [ t k , t k + 1 ) :
d d x Δ e i ( t ) = d d x Δ e i ( t ) u ˙ ( t )
In the next section, the Prim algorithm ensures that the communication topology of the entire multi-AUV system forms a minimum spanning tree, i.e., a i d ( t ) 0 . Thus, all signals in the entire system are bounded, so there must exist a constant O , such that u ˙ i ( t ) O , ( t t k ) T . From the initial condition Δ e i ( t k ) = 0 , it can be obtained that lim t t k + 1 e i ( t k ) = ϖ . The controller is not triggered at the event f i ( t ) = 0 :
ϖ Δ e i ( t )
According to (A40) and (A42)
ϖ Δ e i ( t ) T O
In summary, there exists a positive lower bound for the event-triggered time intervals, satisfying T ϖ O , Therefore, Zeno behavior can be excluded. □

References

  1. Chen, Y.; Niu, Q.; Liu, Z.; Huang, B.; Xie, T.; Zhong, L.; Wan, D.; Wang, Z. Failure Modes and Reliability Analysis of Autonomous Underwater Vehicles–A Review. J. Mar. Sci. Appl. 2025, 24, 900–924. [Google Scholar] [CrossRef]
  2. Yang, H.; Jiang, B.; Zhang, Y. Fault-Tolerant Shortest Connection Topology Design for Formation Control. Int. J. Control Autom. Syst. 2014, 12, 29–36. [Google Scholar] [CrossRef]
  3. Kamel, M.A.; Yu, X.; Zhang, Y. Fault-tolerant cooperative control of WMRs under actuator faults based on particle swarm optimization. In Proceedings of the 2016 3rd Conference on Control and Fault-Tolerant Systems, Barcelona, Spain, 7–9 September 2016. [Google Scholar] [CrossRef]
  4. Zúñiga, B.C.; Mendoza, A.M. PST-Prim Heuristic for the Open Vehicle Routing Problem. IEEE Lat. Am. Trans. 2019, 17, 253–259. [Google Scholar] [CrossRef]
  5. Li, J.; Zhang, Y.; Li, W. Formation Control of a Multi-Autonomous Underwater Vehicle Event-Triggered Mechanism Based on the Hungarian Algorithm. Machines 2021, 9, 346. [Google Scholar] [CrossRef]
  6. Tian, W.; Zhang, C.; Lin, X.; Zhang, Y.; Zhang, W.; Zhang, K. Event-triggered-based Fault-tolerant Consensus for AUVs on Heterogeneous Switch Topology. In Proceedings of the OCEANS 2022, Hampton Roads, VA, USA, 17–20 October 2022; pp. 1–6. [Google Scholar] [CrossRef]
  7. Li, X.; Qin, H.; Li, L.; Xue, Y. Fixed-time velocity-free safe formation control of AUVs with actuator saturation and unknown disturbances. Ocean Eng. 2023, 285, 115361. [Google Scholar] [CrossRef]
  8. Li, X.J.; Qin, H.D.; Li, L.Y. Fixed-time formation control for AUVs with unknown actuator faults based on lumped disturbance observer. Ocean Eng. 2023, 269, 113495. [Google Scholar] [CrossRef]
  9. Fischer, N.; Hughes, D.; Walters, P.; Schwartz, E.M.; Dixon, W.E. Nonlinear RISE-Based Control of an Autonomous Underwater Vehicle. IEEE Trans. Robot. 2014, 30, 845–852. [Google Scholar] [CrossRef]
  10. Sun, Y.; Zhang, Y.; Qin, H.; Ouyang, L.; Jing, R. Predefined-time prescribed performance control for AUV with improved performance function and error transformation. Ocean Eng. 2023, 281, 114817. [Google Scholar] [CrossRef]
  11. Yan, Z.; Zhang, M.; Zhang, C.; Zeng, J. Decentralized formation trajectory tracking control of multi-AUV system with actuator saturation. Ocean Eng. 2022, 255, 111423. [Google Scholar] [CrossRef]
  12. Li, X.; Qin, H.; Li, L.; Xue, Y. Adaptive fixed-time fuzzy formation control for multiple AUV systems considering time-varying tracking error constraints and asymmetric actuator saturation. Ocean Eng. 2024, 297, 116936. [Google Scholar] [CrossRef]
  13. Miao, J.; Sun, X.; Chen, Q.; Zhang, H.; Liu, W.; Wang, Y. Robust Path-Following Control for AUV under Multiple Uncertainties and Input Saturation. Drones 2023, 7, 665. [Google Scholar] [CrossRef]
  14. Su, B.; Wang, H.; Wang, Y.; Gao, J. Fixed-time Formation of AUVs with Disturbance via Event-triggered Control. Int. J. Control Autom. Syst. 2021, 19, 1505–1518. [Google Scholar] [CrossRef]
  15. Wang, Z.; Zhang, A.; Qin, H.; Jiang, S. Fixed-Time Average Consensus of a Dynamic Event-Triggered Mechanism in a System of Multiple Underactuated Autonomous Underwater Vehicles Based on a Body Frame Spherical Coordinate System. J. Mar. Sci. Eng. 2023, 11, 385. [Google Scholar] [CrossRef]
  16. Chen, K.; Luo, G.; Zhou, H.; Zhao, D. Research on Formation Control Method of Heterogeneous AUV Group under Event-Triggered Mechanism. Mathematics 2022, 10, 1373. [Google Scholar] [CrossRef]
  17. Galdran, A.; Pardo, D.; Picón, A.; Alvarez-Gila, A. Automatic red-channel underwater image restoration. J. Vis. Commun. Image Represent. 2015, 26, 132–145. [Google Scholar] [CrossRef]
  18. Zhang, J.; Yu, S.; Yan, Y. Fixed-time velocity-free sliding mode tracking control for marine surface vessels with uncertainties and unknown actuator faults. Ocean Eng. 2020, 201, 107107. [Google Scholar] [CrossRef]
  19. Cui, G.Z.; Zhuang, G.M.; Lu, J.W. Neural-network-based distributed adaptive synchronization for nonlinear multi-agent systems in pure-feedback form. Neurocomputing 2016, 218, 234–241. [Google Scholar] [CrossRef]
  20. Ramadhan, Z.; Siahaan, A.P.U.; Mesran, M. Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem. In Proceedings of the Joint Workshop KO2PI and the 1st International Conference on Advance & Scientific Innovation, Medan, Indonesia, 23–24 April 2018; ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering): Brussels, Belgium, 2018; pp. 47–58. [Google Scholar] [CrossRef][Green Version]
  21. Zhang, L.; Wei, C.; Wu, R.; Cui, N. Fixed-time extended state observer based non-singular fast terminal sliding mode control for a VTVL reusable launch vehicle. Aerosp. Sci. Technol. 2018, 82–83, 70–79. [Google Scholar] [CrossRef]
  22. Sai, H.; Xu, Z.; Xia, C.; Sun, X. Approximate continuous fixed-time terminal sliding mode control with prescribed performance for uncertain robotic manipulators. Nonlinear Dyn. 2022, 110, 431–448. [Google Scholar] [CrossRef]
  23. Qin, H.; Chen, H.; Sun, Y.; Chen, L. Distributed finite-time fault-tolerant containment control for multiple ocean Bottom Flying node systems with error constraints. Ocean Eng. 2019, 189, 106341. [Google Scholar] [CrossRef]
  24. Cui, L.; Jin, N.; Chang, S.; Zuo, Z.; Zhao, Z. Fixed-time ESO based fixed-time integral terminal sliding mode controller design for a missile. ISA Trans. 2022, 125, 237–251. [Google Scholar] [CrossRef]
  25. Huang, Y.; Jia, Y.M. Fixed-time consensus tracking control for second-order multi-agent systems with bounded input uncertainties via NFFTSM. IET Control Theory Appl. 2017, 11, 2900–2909. [Google Scholar] [CrossRef]
Figure 1. Inertial and body-fixed coordinate frames.
Figure 1. Inertial and body-fixed coordinate frames.
Jmse 13 02249 g001
Figure 2. The diagram of fixed-time event-triggered fault-tolerant formation control for Autonomous Underwater Vehicle Swarms.
Figure 2. The diagram of fixed-time event-triggered fault-tolerant formation control for Autonomous Underwater Vehicle Swarms.
Jmse 13 02249 g002
Figure 3. The communication topology between the leader AUV and the follower AUVs.
Figure 3. The communication topology between the leader AUV and the follower AUVs.
Jmse 13 02249 g003
Figure 4. The communication topology graph after Follower AUV-1 loses connection at 20 s.
Figure 4. The communication topology graph after Follower AUV-1 loses connection at 20 s.
Jmse 13 02249 g004
Figure 5. The formation after the transformation.
Figure 5. The formation after the transformation.
Jmse 13 02249 g005
Figure 6. The communication topology graph of the formation after the transformation.
Figure 6. The communication topology graph of the formation after the transformation.
Jmse 13 02249 g006
Figure 7. Communication Topology Graph After Formation Transformation.
Figure 7. Communication Topology Graph After Formation Transformation.
Jmse 13 02249 g007
Figure 8. Three-dimensional trajectory of multi-AUV.
Figure 8. Three-dimensional trajectory of multi-AUV.
Jmse 13 02249 g008
Figure 9. Displacement curve plot of multi-AUV.
Figure 9. Displacement curve plot of multi-AUV.
Jmse 13 02249 g009
Figure 10. Angular variation of multi-AUV.
Figure 10. Angular variation of multi-AUV.
Jmse 13 02249 g010
Figure 11. Lumped disturbance force and torque of follower AUV-2 and estimated value.
Figure 11. Lumped disturbance force and torque of follower AUV-2 and estimated value.
Jmse 13 02249 g011aJmse 13 02249 g011b
Figure 12. Angular velocity and angular velocity of follower AUV-2 and estimated value.
Figure 12. Angular velocity and angular velocity of follower AUV-2 and estimated value.
Jmse 13 02249 g012
Figure 13. Error constrains plot of follower AUV-2.
Figure 13. Error constrains plot of follower AUV-2.
Jmse 13 02249 g013
Figure 14. Control force and torque of follower AUV-2.
Figure 14. Control force and torque of follower AUV-2.
Jmse 13 02249 g014aJmse 13 02249 g014b
Figure 15. Triggering moments plot of follower AUV-2.
Figure 15. Triggering moments plot of follower AUV-2.
Jmse 13 02249 g015
Figure 16. Triggering interval plot of follower AUV-2 ( τ 1 ~ τ 6 ).
Figure 16. Triggering interval plot of follower AUV-2 ( τ 1 ~ τ 6 ).
Jmse 13 02249 g016
Figure 17. Comparison of the effects of the two algorithms.
Figure 17. Comparison of the effects of the two algorithms.
Jmse 13 02249 g017
Table 1. AUV Inertia Parameters [23].
Table 1. AUV Inertia Parameters [23].
Mess
(kg)
I x
(Nm·s2)
I y
(Nm·s2)
I z
(Nm·s2)
I x y
(Nm·s2)
I y z
(Nm·s2)
I x z
(Nm·s2)
92498479000
Table 2. Hydrodynamic coefficients of AUVs [23].
Table 2. Hydrodynamic coefficients of AUVs [23].
CoefficientsLinear.Drag/kg·s−1Quad.Drag/kg·m−1Added Mass/kg
Surge21.924.540.6
Sway47.434.782.3
Heave53.540.2114.6
Heel71.942.155.7
Trim97.348.376.5
Yaw86.939.359.1
Table 3. Initial positions (angles) of follower AUVs.
Table 3. Initial positions (angles) of follower AUVs.
η i j ( 0 ) i = 1 i = 2 i = 3 i = 4 i = 5
j = 1 ( m ) 101016
j = 2 ( m ) 85212
j = 3 ( m ) 75255
j = 4 ( rad ) 0.100.0050.010.005
j = 5 ( rad ) 0.100.0050.010.005
j = 6 ( rad ) 0.100.0050.010.005
Table 4. Initial velocities (angle velocities) of follower AUVs.
Table 4. Initial velocities (angle velocities) of follower AUVs.
v i j ( 0 ) i = 1 i = 2 i = 3 i = 4 i = 5
j = 1 ( m / s ) 0.10.20.10.20.2
j = 2 ( m / s ) 0.10.30.30.10.1
j = 3 ( m / s ) 0.100.20.20.2
j = 4 ( rad / s ) 0.10.100.10.1
j = 5 ( rad / s ) 0.10.100.10.1
j = 6 ( rad / s ) 0.10.100.10.1
Table 5. Event trigger counts of follower AUVs.
Table 5. Event trigger counts of follower AUVs.
AUVFollower
AUV-2
Follower
AUV-3
Follower
AUV-4
Follower
AUV-5
Trigger Counts
τ 1 5092548441582269
τ 2 3436491828943862
τ 3 3510539017624093
τ 4 3263396840994229
τ 5 2473381252872758
τ 6 4077505147974670
No event triggered10,00010,00010,00010,000
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

Wang, Z.; Jiang, S.; Xue, Y.; Mu, X.; Wang, C. Fixed-Time Event-Triggered Fault-Tolerant Formation Control for Autonomous Underwater Vehicle Swarms. J. Mar. Sci. Eng. 2025, 13, 2249. https://doi.org/10.3390/jmse13122249

AMA Style

Wang Z, Jiang S, Xue Y, Mu X, Wang C. Fixed-Time Event-Triggered Fault-Tolerant Formation Control for Autonomous Underwater Vehicle Swarms. Journal of Marine Science and Engineering. 2025; 13(12):2249. https://doi.org/10.3390/jmse13122249

Chicago/Turabian Style

Wang, Zhuo, Shukai Jiang, Yifan Xue, Xiaokai Mu, and Chong Wang. 2025. "Fixed-Time Event-Triggered Fault-Tolerant Formation Control for Autonomous Underwater Vehicle Swarms" Journal of Marine Science and Engineering 13, no. 12: 2249. https://doi.org/10.3390/jmse13122249

APA Style

Wang, Z., Jiang, S., Xue, Y., Mu, X., & Wang, C. (2025). Fixed-Time Event-Triggered Fault-Tolerant Formation Control for Autonomous Underwater Vehicle Swarms. Journal of Marine Science and Engineering, 13(12), 2249. https://doi.org/10.3390/jmse13122249

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