MétaCan
Menu
Back to cohort
Record W2973734321 · doi:10.1109/jsyst.2019.2939250

Information-Based Hierarchical Planning for a Mobile Sensing Network in Environmental Mapping

2019· article· en· W2973734321 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Systems Journal · 2019
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer sciencePlannerAdaptive samplingMotion planningDistributed computingField (mathematics)GaussianSampling (signal processing)Greedy algorithmMobile robotData miningReal-time computingArtificial intelligenceAlgorithmComputer visionMathematics

Abstract

fetched live from OpenAlex

This article investigates the problem of information-based sampling design and path planning for a mobile sensing network to predict scalar fields of monitored environments. A hierarchical framework with a built-in Gaussian Markov random field model is proposed to provide adaptive sampling for efficient field reconstruction. In the proposed framework, a nonmyopic planner is operated at a sink to navigate the mobile sensing agents in the field to the sites that are most informative. Meanwhile, a myopic planner is carried out on board each agent. A tradeoff between computationally intensive global optimization and efficient local greedy search is incorporated into the system. The mobile sensing agents can be scheduled online through an anytime algorithm to visit and observe the high-information sites. Experiments on both synthetic and real-world datasets are used to demonstrate the feasibility and efficiency of the proposed planner in model exploitation and adaptive sampling for environmental field mapping.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.747
Threshold uncertainty score0.534

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.011
GPT teacher head0.241
Teacher spread0.230 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it