An Improved Adaptive Simulated Annealing Particle Swarm Optimization Algorithm for ARAIM Availability
Bibliographic record
Abstract
Civil aviation transportation equipment is more convenient and faster than other transportation tools and is an essential part of intelligent transportation. It is significant to study the reliability of positioning information and enhance traffic safety. Advanced receiver autonomous integrity monitoring (ARAIM) can provide vertical guidance during the different navigation stages in civil aviation fields. The traditional multiple hypothesis solution separation (MHSS) algorithm distributes the probability of hazardous misleading information (PHMI) and probability of false alarm (PFA) uniformly over all visible satellites resulting in reduced global availability of ARAIM. Aiming at this problem, we proposed an adaptive simulated annealing particle swarm optimization (ASAPSO) algorithm to redistribute integrity and continuity risks and establish a protection level optimization model. Based on the real BeiDou navigation satellite system/global positioning system (BDS/GPS) data, the experimental results show that the optimized algorithm can reduce the vertical protection level (VPL), and the ARAIM global availability of BDS/GPS is improved by 1.73%∼2.73%. The optimized algorithm can improve the availability of integrity monitoring at different stages of the navigation system and provide a basis for ensuring the reliability of the positioning results.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".