UAV Trajectory Generation Based on Integration of RRT and Minimum Snap Algorithms
Bibliographic record
Abstract
Aiming at the problems that carrying out forest fire monitoring and fighting missions by using the Rapidly-exploring Randomized Tree (RRT) algorithm to plan paths cannot adapt to the autonomous movement of an Unmanned Aerial Vehicle (UAV) and that high-order dynamic characteristics may mutate during the mission, this paper investigates a trajectory generation algorithm based on the integration of the RRT algorithm and the minimum snap algorithm. First, the RRT algorithm is used to generate the initial path, then the minimum snap algorithm is used to smooth the initial path and obtain a trajectory suitable for the actual flight of the UAV. However, because the UAV is considered as a particle in the simulation, during the actual flight, this trajectory may not guarantee the safe flight of the UAV and may cause the UAV to collide with an obstacle or other nearby UAVs in the cases of formation flight. To solve this problem, flight corridor concept is used to limit the UAV's flight trajectory for ensuring the safe flight of the UAV. Simulation results show that the algorithm can effectively ensure the safety, smoothness, feasibility, and trajectory of unmanned aerial vehicles.
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.001 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".