Active flatness control of membrane structures using adaptive genetic algorithm
Bibliographic record
Abstract
Membrane structures are attracting attention as excellent candidates for lightweight large space structures, which can be utilized to improve the performance and reduce the cost of space exploration and earth observation missions. Membrane structures can be stowed to a small volume during launch and function as large structures after deployed. For many applications, maintaining surface accuracy of membranes is extremely important to achieve satisfactory performance, especially for membrane antennas and adaptive optics. Active flatness control is a vital technology to maintain surface accuracy of membrane structures. In this research, multiple shape memory alloy (SMA) actuators around the boundary of a rectangular membrane are used to apply tension forces to membrane structures to compensate wrinkle effects. The dynamics of membrane structures is nonlinear and computationally expensive, hence unfeasible to be used in real-time active flatness control. As a parallel direct searching method, genetic algorithm (GA) is used search optimal tension force combination on a high dimensional nonlinear surface. Due to increasing number of tension forces to search, the convergence is more difficult to attain. In order to increase responsiveness and convergence of genetic algorithm, an adaptive genetic algorithm (AGA) is proposed. Adaptive rules are incorporated in a modified genetic algorithm to regulate control parameters of genetic algorithm. Through numerical simulation and experimental studies, it is demonstrated that AGA can expedite its search process and prevent premature convergence.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".