Parallel Algorithm for the Path Planning of Multiple Unmanned Aerial Vehicles
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper presents a parallel algorithm for the path planning of multiple unmanned aerial vehicles (UAVs) in the context of a surveillance mission. The UAVs are tasked to visit a set of points of interest (POIs) dispersed in a 3D environment and the algorithm allocates the POIs to the UAVs and computes optimal paths in between the POIs. The algorithm following a four-step approach and relies on a single source shortest path (SSSP) algorithm to compute the optimal paths between the POIs and a genetic algorithm to assign the POIs to the UAVs and find the order in which the POIs are visited. The algorithm is parallelized on a graphics processing unit and a multicore CPU to reduce the computing time and to allow for in-flight planning. The proposed algorithm is able to calculate paths for 3 UAVs and 10 POIs in just 0.6 seconds which represents a speedup of 48x compared to a sequential implementation on CPU.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it