Adaptive distributed Kalman filtering with wind estimation for astronomical adaptive optics
Bibliographic record
Abstract
In the framework of adaptive optics (AO) for astronomy, it is a common assumption to consider the atmospheric turbulent layers as "frozen flows" sliding according to the wind velocity profile. For this reason, having knowledge of such a velocity profile is beneficial in terms of AO control system performance. In this paper we show that it is possible to exploit the phase estimate from a Kalman filter running on an AO system in order to estimate wind velocity. This allows the update of the Kalman filter itself with such knowledge, making it adaptive. We have implemented such an adaptive controller based on the distributed version of the Kalman filter, for a realistic simulation of a multi-conjugate AO system with laser guide stars on a 30 m telescope. Simulation results show that this approach is effective and promising and the additional computational cost with respect to the distributed filter is negligible. Comparisons with a previously published slope detection and ranging wind profiler are made and the impact of turbulence profile quantization is assessed. One of the main findings of the paper is that all flavors of the adaptive distributed Kalman filter are impacted more significantly by turbulence profile quantization than the static minimum mean square estimator which does not incorporate wind profile information.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".