Evolutionary Mapping with 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
Unmanned aerial vehicles (UAVs) have been very successful in many civilian and commercial applications, including disaster relief, search and rescue, precision farming, archaeology, cargo transport, and surveillance. In most of these applications, mapping is a required phase that needs to be performed as an initial step. While mapping has attracted much attention in the last decades, much of the works rely on single drones. In this context, we propose a multiple UAV system for efficient mapping, minimizing mission time and cost. The system includes offline and online planning, and a good balance between both to reduce on-board processing. Offline planning includes area decomposition, take-off location finding, and path planning. Online planning will then be used to react to any unforeseen event that might occur during the plan execution. These incidents include a sudden change in weather conditions, communication loss or drone malfunction, and the presence of a nearby flying obstacle. Each of the main offline and online planning tasks are formalized as a Multi-Objective optimization (MOO) problem where requirements need to be met while objectives have to be optimized. In this regard, we consider several evolutionary techniques to tackle these MOO problems. To assess the performance of these techniques, we conducted several experiments and reported the related results. One finding is that MOEA/D outperforms NSGA2, while the latter requires less processing 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.
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