Data-driven selective sampling for marine vehicles using multi-scale paths
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 addresses adaptive coverage of a spatial field without prior knowledge. Our application in this paper is to cover a region of the sea surface using a robotic boat, although the algorithmic approach has wider applicability. We propose an anytime planning technique for efficient data gathering using point-sampling based on non-uniform data-driven coverage. Our goal is to sense a particular region of interest in the environment and be able to reconstruct the measured spatial field. Since there are autonomous agents involved, there is a need to consider the costs involved in terms of energy consumed and time required to finish the task. An ideal map of the scalar field requires complete coverage of the region, but can be approximated by a good sparse coverage strategy along with an efficient interpolation technique. We propose to optimize the trade off between the environmental field mapping and the costs (energy consumed, time spent, and distance traveled) associated with sensing. We present an anytime algorithm for sampling the environment adaptively by following a multi-scale path to produce a variable resolution map of the spatial field. We compare our approach to a traditional exhaustive survey approach and show that we are able to effectively represent a spatial field spending minimum energy. We present results that indicate our sampling technique gathering most informative samples with least travel. We validate our approach through simulations and test the system on real robots in the open ocean.
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.000 | 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