Automatic Separation Management Between Multiple Unmanned Aircraft Vehicles in Uncertain Dynamic Airspace Based on Trajectory Prediction
Bibliographic record
Abstract
In an uncertain dynamic airspace, the future trajectories of noncooperative aircrafts (obstacles) are very uncertain. Multiple unmanned aircraft vehicles (UAVs) must avoid colliding into noncooperative obstacles and keep a safe distance between each other. This poses a huge challenge to the unmanned aircraft system traffic management (UTM). To cope with the challenge, this paper puts forward an automatic separation management method for a formation of multiple UAVs based on trajectory prediction in 3D dynamic airspace. Firstly, the uncertain trajectories of each obstacle in a time horizon were predicted based on the reachable set, producing an ellipsoidal reachable region. Next, a safe and efficient double-layer separation management strategy was proposed based on the improved artificial potential field (APF) method, considering the safe distance between cooperative UAVs and that between cooperative and noncooperative UAVs. The distance-based traditional APF method was adopted to manage the conflicts according to the reachable region of each obstacle, maximizing the safety between the UAV and the obstacle. The APF method based on relative motion state was employed to manage the conflicts, and adaptively adjust the dynamic safe separation between the UAVs. Experimental results prove that our method can effectively prevent the conflicts between a UAV and other UAVs in the formation or noncooperative obstacle. Besides, the collision-free trajectory generated by our method is smooth and stable, and close to the planned trajectory. The proposed method provides a solid guarantee to UAV flight safety, while minimizing the impacts on nearby aircrafts. The research findings shed new light on the UTM of highly uncertain low-altitude airspaces.
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.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".