1. Introduction
The increasing popularity of rotor craft has resulted in our growing utilization in both civilian and military field [
1], including search, rescue operations, agricultural irrigation, cargo transportation and manned flights [
2]. The propulsion system is a pivotal component of the drone system. The failure of the propulsion system directly leads to the crash of the drone, posing a huge threat to the safety of ground personnel and property. Therefore, it is necessary to analyze the propulsion system of the drone [
3]. Its normal operation must be based on the operation of the power system and communication lines, so that the propulsion system is in a FDEP state with multiple systems [
4].
Multi-rotor drones are equipped with multiple propulsion units, constituting a redundant system, regarded as a k-out-of-n system. Consequently, determining the propulsion system’s reliability necessitates prior analysis of its reliability objectives—specifically, solving for the optimal k-value.
Table 1 compiles methodologies from existing literature, contrasting diverse k-value selection criteria and their corresponding reliability targets.
The existing literature on DRONE reliability objectives neglects critical flight attitudes such as roll, pitch, and yaw during normal operation. Reliability targets derived solely from moment differences, symmetry constraints, and center of gravity balance may inadequately represent the full flight envelope. To address this gap, we develop a dynamic model grounded in controllability analysis, considering the drone’s different flight attitude.
Chamseddine [
9] et al. based on Kalman’s classical controllability theory, did the assessment of controllability involves the rank test of the controllability matrix. However, as was noted in their study, the classical theory stipulates that the origin must be an interior point of the reachable control constraints set, which is not always the case when the rotor fails. Brammer [
10] et al. presented a sufficient and necessary condition for the controllability of linear autonomous systems with positive constraints, which can be used to analyze the controllability of a multi-rotor system. Du [
11] et al. discussed the optimal design problem of multi-rotor drone based on controllability, and a complete multi-rotor system model was derived considering drone dynamics for different mission requirements. Ghosh et al. [
12] considered the significance of controllability for different mission requirements, and performed a reliability analysis of a quadrotor drone with different configurations based on Markov’s method. This analysis demonstrated that the reliability of a multi-rotor drone is contingent not only on its components, but also on its mission and payload.
For system reliability studies considering FDEP, separate FDEP gates are incorporated within the dynamic fault tree to characterize its dynamic property [
13]. Zhang et al. [
14] presented the k-out-of-n system reliability assessments with FDEP often neglect analysis of flexible component support relations, causing inaccuracies. They proposed a novel PTVDDBN–HDFS method integrating a Parameter Time-Varying Discrete Dynamic Bayesian Network (PTVDDBN) with a Hungarian algorithm enhanced by Depth-First Search (DFS). Boudali and Dugan [
15] proposed a novel reliability modeling and analysis framework based on Bayesian Networks (BN). The capability of this framework was verified by defining the discrete-time BN reliability form and converting the DFT with FDEP gates to a BN model. Liu et al. [
16] presented traditional Markov methods for FDEP with imperfect coverage, which are inefficient. Based on the total probability theorem and divide-and-conquer, it decouples FDEP and imperfect coverage effects from system combination. The method is efficient, accurate, handled any failure distribution, and overcomes Markov limitations.
The proliferation of drone applications necessitates increased rotor configurations and larger-scale propulsion systems. In fault tree-based safety and reliability analysis [
1], system scalability inversely impacts computational efficiency, potentially causing combinatorial explosion. This inefficiency stems from the Boolean logic foundation of fault trees: expanding system size exponentially increases Boolean operator complexity and computational demands. The Boolean satisfiability problem (SAT) [
17] determines whether there exists a model for a given Boolean formula. Although the problem has proved to be NP-complete [
18], modern SAT solvers can handle large problems with tens of thousands of variables, such as bounded model checking [
19], planning [
20], and sampling [
21].
At the same time, part of the research is based on the MCSs (Minimum Cut Sets) of the complex event fault tree for simplified processing. Luo et al. [
22] presented a new method for computing MCSs based on SAT, namely SATMCS. Specifically, given a fault tree, they iteratively search for a cut set based on the conflict-driven clause learning framework. By exploiting local propagation graph, which characterizes the partial failure propagation based on the cut set, we provide efficient algorithms for extracting an MCS. Jacob et al. [
23] developed the direct evaluation method to analyze the large systems with FTA (Fault Tree Analysis). The aforementioned goal has been achieved by a thorough search of independence in the fault tree and making use of hash tables and dynamic memory. Moreover, our solution is applicable to any standard fault tree, regardless of the number of children per gate.
When voting gates are present in the fault tree, the system still faces space explosion problems due to the complexity of the selection logic. Xiang et al. [
24] proposed a set of reduction rules to simplify the voting gates without direct expanding. They also proposed a concept of minimal cut vote (MCV) denoting a k/n gate, in which the MCSs of fault trees can be evaluated and weeded more efficiently, and the result can be represented in a more compact form. Wang [
25] proposed a new decomposition algorithm based on an expanded combination formula which can decompose the voting gates more quickly while the space and time complexity is lower than the traditional expansion was proposed. The above literature does not take into account how the system’s reliability is resolved when the voters are present concurrently with complex failure events. The literature is summarized in
Table 2.
Based on the above literature analysis,
Section 2 is based on the controllability analysis, considering the different attitude of drone flight, to accurately determine the value of k.
Section 3 introduces function dependence nodes, explores the effect of FDEP on system reliability, and constructs the system reliability model based on the adder model while considering complex failure events and voting gates, and solves the space explosion problem by reconfiguring the Bayesian network.
Section 4 takes the propulsion system of a 16 (2 × 8) coaxial rotor drone as an example to verify the accuracy and practicality of the proposed reliability algorithm.
2. Multi-Rotor Drone Controllability Modeling
To satisfy stringent airworthiness certification requirements for multi-rotor drones, the reliability assessment necessitates a highly conservative approach. The drone’s propulsion system functions as a k-out-of-n system. While industry practices typically select the k-value based on factors like take-off weight and symmetry axis configurations [
5], this approach proves inadequate to meet the overly conservative reliability demands encountered during research and development. To overcome this limitation, we develop precise drone dynamics and control models through controllability analysis. This analysis explicitly considers the drone’s controllability in roll, yaw, pitch, and other axes, thereby enabling the precise determination of the k-value for the k-out-of-n propulsion system.
2.1. Drone Control Modeling
As illustrated in
Figure 1, there exists a wide variety of multi-rotor drones, characterized by differing rotor counts and configurations. It is evident that there are discrepancies in configuration and performance between the various configurations. However, these configurations can all be modeled by the general form of Equation (1) [
26].
h, ϕ, θ, Ψ—the altitude, the roll angle, the pitch angle, the yaw angle of the drone.
vh—the vertical speed of the drone.
p, q, r—the roll angular velocity, the pitch angular velocity, the yaw angular velocity of the drone.
T—the thrust generated by the rotor blades of the drone.
L, M, N—the three-axis moments of the drone.
ma—the mass of the drone.
Jx, Jy, Jz—the moment of inertia of the drone.
There are four control inputs to the multi-rotor drone: total thrust,
T, and three-axis moments,
L,
M, and
N. The four control inputs are generated by the motor thrust and counter-torque moments, respectively [
27].
- (1)
Lift generated by rotor
In accordance with the principle of rotor aerodynamics, it is generally accepted that the lift generated by the rotor is proportional to the square of its rotational speed. The proportionality coefficient
k1 is defined as the lift coefficient, Ω
m is the rotational speed of the mth rotor. Any drone configuration in
Figure 1 can be modeled similarly below, we use coaxial 2 × 8 rotors as an example here. Therefore, the projection of the lift generated by 16 rotors in the fuselage coordinate system can be expressed as follows:
For a 16-rotor drone, the total thrust generated by the propulsion system equals the sum of the individual propeller thrusts. Propeller thrust is defined as the force perpendicular to the propeller plane. These combined forces provide lift, translational thrust, and generate moments enabling airframe pitch and roll maneuvers. The total thrust
T is expressed as follows:
- (2)
Moments generated by rotor
The projection of the moment generated by each rotor lift on each airframe coordinate system can be expressed as:
Lm denotes the coordinates of the rotor center on the fuselage coordinate system, and
r denotes as the distance of the rotor center relative to the barycenter of the drone; the rotor layout of the 16-rotor drone is shown in
Figure 2. Consequently, the lift moment produced by the rotor can be expressed as follows:
- (3)
Antitorque moment generated by the rotor
The rotation of the rotor also creates an antitorque moment with a magnitude proportional to the square of the rotor rotational speed. The resultant moment of all antitorques provides the airframe with a yawing moment of rotation in the plane of the propeller [
28]. The scale coefficient
k2 is called the drag coefficient. Within the airframe’s coordinate system, the counter-torque moment generated by the 16 rotors is expressed as follows:
Therefore, the resultant moment of the rotor acting in the fuselage coordinate system is expressed as follows:
The control efficiency model of the co-axial 16-rotor drone can be derived from Equations (3) and (7) and expressed as follows:
The 4 × 16 matrix in Equation (8) is the control efficiency matrix
Bf.
The bm denotes the contribution factor of the mth rotor to the total thrust or torque, and the parameter nm is used to characterize the failure of the rotor. When the mth rotor fails, nm = 0.
Equation (1) has the following two constraints, with
F = [0,Ω
2m] as the set of speeds that can be output:
The classical controllability theory of linear systems typically assumes that the origin is an interior point in the set of control constraints U. In such cases, the full rank of the rows of the matrix C (A,B) is a sufficient condition for controllability. However, in the event of rotor failure, the origin may not be attributable to the set of control constraints U. Other additional conditions are therefore required to prove the controllability of the system (1).
2.2. Controllability Analysis of a Multi-Rotor Drone
In this section, the controllability of the system (1) is studied based on the positive controllability theory. The application of the positive controllability theorem to Equation (1) necessitates the satisfaction of two conditions. Firstly, C (A,B) must be row-full rank. Secondly, for all of u in the control constraints U, there exists no real eigenvector v in AT satisfying vTBu ≤ 0.
However, in practice, it is not feasible to verify all of u in the control constraints
U individually. For this reason, an equivalent formulation is proposed and defined as the available control authority index (ACAI) [
29], which is formulated as follows:
The assessment of capability is achieved through the calculation of the Available Control Authority Index (ρ) for each failure combination, thereby determining the drone’s capacity to remain operational within the specific failure combination.
In contrast to the classical Kalman controllability analysis with the rank tests, the ACAI is derived from a linearized dynamic model of the drone in a hovering scenario. The four control channels are as follows: altitude, roll, pitch, and yaw. The set of control constraints centered on X is defined as the largest closed sphere in four-dimensional space, ρ is the distance measured from X to δΩ, which is essentially the radius of the largest closed sphere in the reachable control set, X represents the form of moment that can be provided by some combination of failures, as mentioned in Equation (10). Ω is the set of reachable controls, with boundaries defined as δΩ, and Ωc is the complementary set of Ω in which the drone is no longer able to control. As the value of ρ increases, the ability of the drone to control the four channels is greater, and a system is defined as being controllable if and only if ρ ≥ 0; this also indicates that the system is able to maintain stability of the system by varying the rotor’s rotation speed.
3. Reliability Modeling Considering FDEP
Voting systems exhibit functional redundancy due to their multi-component architecture. This complexity leads to FDEP relationships between distinct component types, represented by FDEP gates in dynamic fault tree models [
30]. FDEP describes scenario where System F becomes unavailable upon failure of triggering System T, despite no intrinsic failure within System F itself. When incorporating System T directly into System F’s intermediate events during fault tree modeling, the failure probability of System F becomes overestimated [
31]. Such overestimation compromises the reliability of fault tree solutions for system design optimization. Consequently, exploring alternative reliability modeling methods for FDEP systems becomes essential. We propose Bayesian Networks (BN) as a rigorous solution.
3.1. BN Modeling
A Bayesian network (BN) consists of nodes {
X1, …,
Xn} and directed arcs between them. Each node
Xi is a random variable. If there is an arc from node
Xi to node
Xj, then node
Xi is the parent node of node
Xj and node
Xj is the child node of node
Xi. A directed arc describes the conditional probability transformation relationship between nodes and is represented by a conditional probability table (CPT) [
32].
Pa(
Xi) the set of parent nodes of
Xi,
Pr[
Xi|
Pa(
Xi)] is conditional probability given the set of its parent nodes of
Xi [
33]. In this paper, the node state is defined as a discrete quantity, indicating that the node is in a working or failed state. The joint probability of its non-empty parent node is denoted as:
Following the extraction of the joint probability as outlined in Equation (12), the subsequent formula is employed to calculate the marginal probability of the child nodes:
In Bayesian Networks (BN), directed arcs between nodes are quantified through conditional probability functions, typically structured as conditional probability table (CPT). As a static modeling framework, BN is restricted to assessing system reliability at discrete time points. To characterize the temporal evolution of component behaviors, the model extends to Dynamic Bayesian Networks (DBN), enabling analysis of dynamic failure dependencies over continuous time horizons.
We present a k-out-of-n system with FDEP, consisting of a trigger component and a functional component. Denoted
Ti and
Fi, respectively, the components are in binary states, where 1 indicates a working state and 0 indicates a failed state. The failure probability of each component studied in this paper is exponential. The state transfer probability
Pi of the components is therefore shown in Equation (14).
λi is the failure rate of the component and Δt is the fundamental time interval.
When accounting for FDEP, the availability of component
Fi depends not only on its intrinsic state but also on the status of its triggering component
Ti, as depicted in
Figure 3. Consequently, k-out-of-n systems exhibiting FDEP characteristics cannot establish the triggering component as a direct fault tree bottom event for the functional component. Such conventional modeling neglects the dynamic failure propagation mechanism between triggering and functional components.
3.2. Dynamic BN Modeling with FDEP
In a DBN model, time is divided into successive time instants, treating a static BN at a particular time as a time slice. Each time slice characterizes the state of units, sub-systems, and systems at a particular time instant.
The node
Xi extends to
Xi(
t), and the DBN model can be decomposed into two BN slices (
B(
t),
B(
t + 1)). With
t = 0,
B(0) is a priori network, representing the probability distribution of the initial state of the system. The probability from
B(
t) to
B(
t + 1). Simulates the transition of the unit’s state over time [
34].
To consider the impact of FDEP on the reliability of propulsion systems, the triggering component and the functional component are used as parent nodes. Instead of being the bottom event of the electric propulsion unit, affecting the normal operation of the electric propulsion unit through AND-OR logic, this will lead to an overestimation of the failure probability of the electric propulsion unit. If we consider the triggering component as the parent node in BN, it can ensure the independence of the electric propulsion unit, as the triggering component affects the operation of the electric propulsion unit through conditional probability as shown in Equation (12) with
Pa(
N1) = {
T1,
F1,
F2}, and we can obtain
Pr(
N1) through Equation (13) as illustrated in
Figure 4. The “1” in
Figure 4 represents a dynamic update process of the BN.
With the basic time interval Δ
t, since the failure probability is the exponential distribution, the transition relationship between the trigger component nodes within the slice is expressed as follows:
The transition relationship between the functional components nodes within the slice is expressed as follows:
λiT, λiF are the failure probabilities of the trigger component and the functional component, respectively.
3.3. BN Reconstruction Based on Adder Modeling
It is evident that the BN possesses the capacity for reasoning about probabilities and the computation of posterior probabilities. However, convergent BN structures, such as the BN in
Figure 5, cannot be analyzed due to the increased number of parent nodes and the presence of voting gates [
35].
The converged BN structure has a CPT size that grows exponentially with the number of parent nodes, but the problem of exponential growth of CPT can be solved by realizing inference through causal independence between nodes.
To solve the problem of exponential growth of CPT, the temporal model of noise adder based on Heckerman [
36] is used to realize the reconstruction of BN structure. The noise adder is defined as follows: in the convergent BN structure as in
Figure 5, there are n binary random variables [
C1…
Cn] with states 1 (system normal operation) and 0 (system failure), which affect the random variable, where denotes a counter with fixed domain [0,
n]. The counter is given a 1 if the state of
Ci is true. The model simulates the causal effect of variables
C1 through
Cn on variable
k through the overall effect of the contributing variable
Ei on the combined parent node with domain [0,
i]. Heckerman defines the CPT of the contributing variable as follows:
A voting gate can be represented by a convergent BN structure [
37], where the convergent node is
K, a binary random variable, denoting the availability of the system with at least
k components available. The following equation shows the probabilistic model of voting gate based on BN:
The t(x) is an indicator function that takes the value of 1 if and only if it is true, and 0 in other cases.
According to the full probability formula of BN in Equation (13), the marginal probability of
K = true is obtained as follows:
However, when the probability of Equation (18) is 1, the summation value of
t(
ci) exhibits many possibilities, and only one CPT cannot completely describe its probability model, so variable intermediate variables
H are needed to replace the state of summation value of
t(
ci). The probability model is split, and the CPT logic of the variables
H is as follows:
Since
H is a random variable affected by the state of the parent node, so its marginal probability distribution is as follows:
Since it is necessary to model the probability of a voting gate, the probabilistic relationship between
K and
N is modeled as follows:
Equation (22) demonstrates that the challenge of exponential growth in the Conditional Probability Table (CPT) size has been transferred to variable
H. Consequently, the voting gate selection logic can be reformulated as the adder structure in
Figure 6, while Equation (22)’s probabilistic model becomes mathematically equivalent to Heckerman’s adder model.
where the set of conditional probability equations is
The value space of
Yi in CPT is {0, 1, …,
h}, and its value condition is
The contributing variable Ei in the adder has n states and conditionally dependents on the Ei−1 variable, which has n − 1 states, so its CPT scales O(n2), while the number of contributing variables in the adder is n. Thus, the overall space complexity of the probabilistic k-out-of-n model is O(n3). The space complexity is reduced from exponential to polynomial by reconfiguring the BN through the adder, so that the problem of CPT explosion of the voting gate due to the high number of parent nodes can be ignored and the subsequent computation can be completed.
3.4. Multi-Rotor Drone Reliability Assessment Framework
When some multi-rotor drone propulsion units fail, the remaining thrust units may be unable to generate sufficient thrust and torque for translational and rotational control, potentially leading to loss of controllability. Thus, a controllability analysis must evaluate residual thrust/torque to determine system reliability. During drone design, propulsion system components are typically diversified to prevent common-cause failures [
38] and accommodate k-value constraints. This heterogeneity yields distinct failure rates per thrust unit, necessitating explicit analysis of time-dependent system reliability. This study employs Bayesian Network (BN) modeling to address this reliability analysis. The framework in
Figure 7 formalizes the reliability assessment workflow for multi-rotor drone propulsion systems, with the decision logic applicable to arbitrary drone configurations.
5. Conclusions
The expanding operational scope of drones necessitates increased rotor configurations, which introduces computational complexity explosion in propulsion system reliability analysis. Simultaneously, determining the maximum tolerable rotor failures becomes essential for defining reliability objectives. Crucially, propulsion system functionality depends on power and communication systems, creating inherent functional dependencies. This paper addresses these challenges through the following:
- (1)
A reliability analysis method of propulsion system based on controllability is proposed for these problems, the k-value is scientifically selected. We complete its control model construction by modeling the dynamics of the airframe and conservatively seeking the k-value by taking into account the controllability analysis of the drone in the case of roll, yaw, pitch, and so on.
- (2)
Due to the selection logic brought by the voting gate, the fault tree, plain BN cannot be analyzed. Through adder modeling, the BN structure is reconstructed to reduce the space complexity from exponential to polynomial, so as to solve the problem of CPT explosion brought by a large number of parent nodes.
- (3)
The system reliability considering FDEP was calculated. By comparative analysis, we find that the system reliability would be underestimated if the trigger component is used as a series parallel system of function components. At the same time, the importance of different motors is analyzed, and the curve inflection point can guide the dynamic adjustment of maintenance strategy.
Our methodology establishes reliable objectives for drone propulsion systems grounded in control theory principles, applicable across diverse drone configurations. We resolve computational complexity explosion from excessive rotors, eliminating rotor count constraints in reliability analysis. The resultant reliability and criticality curves enable dynamic maintenance scheduling to sustain system reliability. Crucially, functional dependence analysis demonstrates that propulsion system reliability can only be accurately quantified through independent system evaluation, otherwise, reliability would be artificially underestimated.