Use of evolutionary computation techniques for exploration and prediction of helicopter loads
Bibliographic record
Abstract
The development of accurate load spectra for helicopters is necessary for life cycle management and life extension efforts. This paper explores continued efforts to utilize evolutionary computation (EC) methods and machine learning techniques to estimate several helicopter dynamic loads. Estimates for the main rotor normal bending (MRNBX) on the Australian Black Hawk helicopter were generated from an input set that included thirty standard flight state and control system parameters under several flight conditions (full speed forward level flight, rolling left pullout at 1.5g, and steady 45° left turn at full speed). Multi-objective genetic algorithms (MOGA) used in combination with the Gamma test found reduced subsets of predictor variables with modeling potential. These subsets were used to estimate MRNBX using Cartesian genetic programming and neural network models trained by deterministic and evolutionary computation techniques, including particle swarm optimization (PSO), differential evolution (DE), and MOGA. PSO and DE were used alone or in combination with deterministic methods. Different error measures were explored including a fuzzy-based asymmetric error function. EC techniques played an important role in both the exploratory and modeling phase of the investigation. The results of this work show that the addition of EC techniques in the modeling stage generated more accurate and correlated models than could be obtained using only deterministic optimization.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".