A Multiaircraft Path Distributive Planning Method via Autonomous Self‐Separation Operation Mode
Bibliographic record
Abstract
In this paper, a multiaircraft path planning method framework for autonomous operation and distributed decision‐making was proposed. The core content of this framework consists of two parts: single‐aircraft path planning and multiaircraft path coordination. The path planning process includes airspace operational situation assessment, initial path generation based on operational situation, path optimization, and smoothing. A joint path planning algorithm of artificial potential field (APF) and particle swarm optimization is designed to overcome the inherent defects of the APF method and optimize the path to make it more resistant to disturbance. In the process of multiaircraft route coordination, a mixed strategy game model is constructed to promote the fair allocation of airspace resources among aircraft. The mathematical properties of the mixed strategy Nash equilibrium solution for this problem are presented. Finally, a simulation scenario is constructed based on the actual sector structure (ZSSSAR01) and running data to verify the effectiveness of the proposed method. The simulation results show that with the increasing proportion of aircraft operating in the autonomous mode, the length of the planned path increases first and then decreases, the airspace operation situation is gradually balanced in the spatial distribution, and the robustness of the planned path is gradually enhanced. The average path length of aircraft increases only by 9.15%, but the peak air traffic complexity can be reduced by 34.77%, and the number of highly utilized grids in airspace can be increased by 22.55%. And, the anti‐disturbance capability of this path is significantly improved. It proves that the multiaircraft distributed route planning method proposed in this paper has a good application prospect in future air traffic management.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.003 | 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".