An Improved UAV-PHD Filter-Based Trajectory Tracking Algorithm for Multi-UAVs in Future 5G IoT Scenarios
Bibliographic record
Abstract
The 5G cellular network is expected to provide core service platform for the expanded Internet of Things (IoT) by supporting enhanced mobile broadband (eMBB), massive machine-type communication (mMTC), and ultra-reliable low latency communications (URLLC). Unmanned aerial vehicles (UAVs), also known as drones, provide civil, commercial, and government services in various fields. Particularly in a 5G IoT scenario, UAV-aided network communications will fulfill an increasingly important role and will require the tracking of multiple UAV targets. As UAVs move quickly, maintaining the stability of the communication connection in 5G will be a challenge. Therefore, it is necessary to track the trajectory of UAVs. At present, the GM-PHD filter has a problem that the new target intensity must be known, and it cannot obtain the moving target trajectory and the influence of the clutter is likely to cause false alarm. A UAV-PHD filter is proposed in this work to improve the traditional GM-PHD filter by applying machine learning to the emergency detection and trajectory tracking of UAV targets. An out-of-sight detection algorithm for multiple UAVs is then presented to improve tracking performance. The method is assessed by simulation using MATLAB, and OSPA distance is utilized as an evaluation indicator. The simulation results illustrate that the proposed method can be applied to the tracking of multiple UAV targets in future 5G-IoT scenarios, and the performance is superior to the traditional GM-PHD filter.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 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.001 | 0.001 |
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".