Retour aux projets ML · scikit-learn · TensorFlow · Optimal design

Optimization of Cyclic Fatigue Testing (CRBOS) using Machine Learning

SLB Group · 3 months

Machine-learning optimization of cyclic fatigue testing

Case study · data-driven fatigue-life prediction

Résumé

Cyclic fatigue qualification of composite cable components on the CRBOS test bench is slow and expensive: each additional loading condition adds days of test time before a statistically meaningful fatigue-life estimate is available. This case study documents a machine-learning approach that models fatigue life directly from load, environmental and layup features, uses an optimal-design criterion to identify which loading profiles are most informative to test, and validates that a shortened, ML-guided test protocol preserves the predictive power of the original, more exhaustive campaign.

Introduction & objectifs

Classical fatigue characterization tests every loading condition of interest to failure, which scales poorly as the number of variables (stress ratio, amplitude, temperature, layup) grows. A data-driven approach can instead learn the underlying relationship between test conditions and fatigue life from the historical and newly generated CRBOS dataset, and use that model to decide which future tests actually add information. The project pursued three objectives:

  1. Predictive modeling — build a fatigue-life model, benchmarked against the classical Basquin/Miner framework, accurate enough to support test-planning decisions.
  2. Test-matrix optimization — use an optimal-experimental-design criterion to select the smallest set of loading profiles that maximizes information gained per test.
  3. Prospective validation — confirm on held-out, physically run tests that the shortened protocol matches the predictive power of the original, more exhaustive test matrix.

Cadre théorique

Classical fatigue-life framework

The classical benchmark for the learned models is the Basquin power-law relation between stress amplitude σa and cycles to failure Nf,

$$ \sigma_a = \sigma_f'\,(2N_f)^{b} $$

and Miner’s rule for cumulative damage under variable-amplitude loading, which sums the fractional life consumed at each stress level i and predicts failure once the total reaches unity:

$$ D = \sum_i \frac{n_i}{N_i}, \qquad \text{failure at } D = 1 $$

These relations remain the interpretable backbone against which every learned model’s predictions were sanity-checked.

Supervised learning formulation

Fatigue life (or its logarithm, to stabilize the typically wide dynamic range) was treated as the regression target of a supervised model f(x;θ), fit by minimizing a regularized loss over m training examples:

$$ L(\theta) = \frac{1}{m}\sum_{i=1}^{m}\big(y_i - f(\mathbf{x}_i;\theta)\big)^2 + \lambda\lVert\theta\rVert^2 $$

Gradient-boosted tree baselines built the model as an additive expansion of weak learners hm fit to the residuals of the previous stage, scaled by a learning rate ν:

$$ F_m(\mathbf{x}) = F_{m-1}(\mathbf{x}) + \nu\, h_m(\mathbf{x}) $$

and neural-network baselines composed layers of the standard form

$$ \mathbf{a}^{(l)} = \phi\big(W^{(l)}\mathbf{a}^{(l-1)} + \mathbf{b}^{(l)}\big) $$

with model selection and hyperparameter tuning driven by k-fold cross-validated error,

$$ CV = \frac{1}{k}\sum_{j=1}^{k} L\big(\text{model fit on folds}\neq j,\ \text{evaluated on fold } j\big) $$

Model interpretability

To confirm the learned models were relying on physically sensible drivers rather than spurious correlations, feature contributions were quantified with Shapley additive explanation (SHAP) values, which distribute a prediction fairly across features i using the cooperative-game-theoretic Shapley value over all feature subsets S of the full feature set F:

$$ \phi_i = \sum_{S \subseteq F\setminus\{i\}} \frac{|S|!\,(|F|-|S|-1)!}{|F|!}\Big[f(S\cup\{i\}) - f(S)\Big] $$

which confirmed stress ratio, peak stress and layup descriptors as the dominant predictors, consistent with the classical Basquin framework of Equation (1).

Optimal test-matrix design

Selecting which loading profiles to physically test was framed as a D-optimal design problem: for a candidate set of test points forming design matrix X, the subset maximizing the determinant of the Fisher information matrix

$$ \max_{X}\ \det\!\big(X^{\mathsf T}X\big) $$

gives the loading profiles that most reduce parameter uncertainty in the fitted model per test run — the mathematical basis for the shortened test protocol proposed in Section 3.3.

Méthodologie

Data pipeline

Historical and newly generated CRBOS records (loads, frequencies, cycles to failure) were aggregated, cleaned and enriched with engineered features — stress ratio R = σminmax, peak stress, test temperature and humidity, and layup descriptors — chosen to align with the variables that classical fatigue theory (Equation 1) already identifies as first-order drivers of life.

Modeling

Regularized linear/ridge regression, gradient-boosted trees (Equation 4) and a small feed-forward neural network (Equation 5) were trained and compared using the cross-validated error of Equation (6), with hyperparameters tuned on the validation folds only. SHAP analysis (Equation 7) was run on the best-performing model to confirm feature attributions were physically sensible before the model was trusted for test-planning decisions.

Test optimization

The trained model was used as a fast surrogate to score candidate loading profiles, and the D-optimal criterion of Equation (8) selected the subset of profiles expected to most reduce prediction uncertainty per additional physical test, producing a shortened test matrix proposal in place of the original exhaustive plan.

Validation

The shortened protocol was validated prospectively: profiles it had not been trained on were physically tested on the CRBOS bench, and predicted versus measured fatigue life was compared using root-mean-square error and the coefficient of determination,

$$ \text{RMSE} = \sqrt{\frac{1}{m}\sum_{i=1}^{m}(y_i-\hat{y}_i)^2}, \qquad R^2 = 1 - \frac{\sum_i (y_i-\hat{y}_i)^2}{\sum_i (y_i-\bar{y})^2} $$

to confirm the reduced test matrix preserved predictive accuracy relative to the full historical dataset.

Résultats & retombées

The gradient-boosted model consistently outperformed the regularized linear baseline in cross-validation, and SHAP attributions (Equation 7) confirmed stress ratio and peak stress as the dominant predictors, in line with the classical Basquin relation of Equation (1). Selecting the test matrix via the D-optimal criterion of Equation (8) allowed a materially shorter physical test campaign, and the prospective validation of Equation (9) confirmed the shortened protocol retained predictive accuracy statistically comparable to the original, more exhaustive test matrix — the central result required to justify adopting the shortened protocol for future qualification campaigns.

Environnement technique

Modeling used Python (scikit-learn, TensorFlow / PyTorch) alongside MATLAB for classical fatigue-model cross-checks. Physical fatigue data came from the CRBOS fatigue bench and DAQ systems, with all datasets and analysis notebooks kept under version control for reproducibility.

Nomenclature

SymboleSignification
σa, σf′, bStress amplitude, fatigue strength coefficient and exponent
Nf, ni, Ni, DCycles to failure and Miner’s rule cumulative damage terms
θ, L(θ), λModel parameters, training loss and regularization strength
Fm, hm, νBoosted ensemble, weak learner and learning rate
W(l), b(l), φNeural-network layer weights, bias and activation function
CVk-fold cross-validation error
φiSHAP attribution for feature i
XCandidate test-matrix design matrix
RMSE, R²Root-mean-square error and coefficient of determination

Références

  1. O. H. Basquin, “The Exponential Law of Endurance Tests,” Proceedings ASTM, 1910.
  2. M. A. Miner, “Cumulative Damage in Fatigue,” Journal of Applied Mechanics, 1945.
  3. J. H. Friedman, “Greedy Function Approximation: A Gradient Boosting Machine,” Annals of Statistics, 2001.
  4. S. M. Lundberg and S.-I. Lee, “A Unified Approach to Interpreting Model Predictions,” NeurIPS, 2017.
  5. V. V. Fedorov, Theory of Optimal Experiments, Academic Press, 1972.