Adaptive Communication-Constrained Deployment of Unmanned Vehicle Systems
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
Cooperation between multiple autonomous vehicles requires inter-vehicle communication, which in many scenarios must be established over an ad-hoc wireless network. This paper proposes an optimization-based approach to the deployment of such mobile robotic networks. A primal-dual gradient descent algorithm jointly optimizes the steady-state positions of the robots based on the specification of a high-level task in the form of a potential field, and routes packets through the network to support the communication rates desired for the application. The motion planning and communication objectives are tightly coupled since the link capacities depend heavily on the relative distances between vehicles. The algorithm decomposes naturally into two components, one for position optimization and one for communication optimization, coupled via a set of Lagrange multipliers. Crucially and in contrast to previous work, our method can rely on on-line evaluation of the channel capacities during deployment instead of a prespecified model. In this case, a randomized sampling scheme along the trajectories allows the robots to implement the algorithm with minimal coordination overhead.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.004 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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