Research Research Research Research Research Research on UAV Trails
Bibliographic record
Abstract
Path planning is one of the key technologies of UAV autonomous flight. The typical path planning can be divided into three steps: firstly, the preliminary planning of flight path should be carried out by fully considering various threat environments; secondly, the optimal path should be found by using the optimization search algorithm; finally, the path should be smoothed. This paper systematically summarizes the studies of UAV path planning in recent years; analyzes the flight airspace, dynamic constraints and environmental constraints in the process of path planning; expounds the key technologies involved in path planning, including terrain acquisition, threat and cost modeling, path planning algorithm and path smoothing; and further analyzes and summarizes the common path planning algorithms, such as A* search algorithm, genetic algorithm, ant colony algorithm, particle swarm optimization algorithm, and the common path smoothing algorithm B-spline curve method; and summarizes the problems of the current UAV path planning model construction and path planning search algorithm. Finally, some potential future development trends of UAV path planning are proposed, including the construction of reasonable path planning system, the study of advanced online path planning algorithm, and the cooperative path planning of multi-UAV.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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".