Tangent-Based Path Planning for UAV in a 3-D Low Altitude Urban Environment
Bibliographic record
Abstract
Unmanned aerial vehicles (UAVs) have emerged as promising platforms for fast, energy-efficient, and cost-effective package delivery. Path planning in 3-D urban environments is critical to drone delivery. The paper proposes a novel tangent-based (3D-TG) method for UAV path planning in 3-D urban environments. When a drone encounters an obstacle, a tangent graph is constructed to generate three sub-paths from both sides and above to bypass an obstacle, one of which is selected according to sophistically designed heuristic rules. The selected sub-path would be constantly adjusted its direction via tangent graph to avoid obstacles until the path can extend to the goal without obstacle collision. To avoid moving obstacles, velocity obstacle is incorporated in the 3D-TG. The experimental results on synthetic and realistic scenarios illustrate that 3D-TG performs well under static, unknown and dynamic environments. More significantly, 3D-TG can also generate a collision-free path for a drone to navigate through simple mazes efficiently, within a reasonable time.
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.001 |
| Science and technology studies | 0.000 | 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".