Wireless sensor network-assisted, autonomous mapping with information-theoretic utility
Bibliographic record
Abstract
A mobile, autonomous platform is assisted by a wireless sensor network in its task of inferring a map of the spatial distribution of a physical quantity that is measured by the sensor nodes. Sensor nodes initiate a broadcast in the network, when the measured quantity assumes a value in the range of interest. Specifically, we consider randomly deployed networks of location-agnostic wireless sensor nodes, which broadcast messages by flooding. The node-to-node delays are assumed to be random. In networks of this type, the hop count of a broadcast message, given the distance from the source node, can be approximated by a simple parametric distribution. The mobile platform can interrogate a nearby sensor node to obtain, with a given success probability, the hop counts of the broadcast messages originating from different source nodes. By fusing successive hop count observations, the mobile platform infers the locations of the source nodes and thereby, the spatial distribution of the quantity of interest. The path taken by the mobile platform should minimize the resulting mapping error as quickly as possible. We propose an information-driven path planning approach, in which the mobile platform acts by maximizing a weighted sum of myopic, mutual information gains. We show by simulation, that suitable control of the weights is effective at reducing the error between the true and the inferred map, by preventing the information gain to be dominated by only a few source nodes.
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 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.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 teacher head, 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".