MétaCan
Menu
Back to cohort
Record W2133144849 · doi:10.1109/naecon.2010.5712978

Sensor-based allocation for path planning and area coverage using UGSs

2010· article· en· W2133144849 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsComputer scienceWireless sensor networkMotion planningReal-time computingSituation awarenessPath (computing)Resource management (computing)Resource allocationVariety (cybernetics)Data miningDistributed computingArtificial intelligenceComputer networkEngineeringRobot

Abstract

fetched live from OpenAlex

The goal of the project is to incorporate situational awareness methods and performance evaluation using distributed unattended ground sensor (UGS) wireless sensor networks, area coverage, and path planning to monitor targets. Generalized measures of performance are utilized for determining which sensors to allocate to observe a moving target through obscurations. Using a variety of techniques in the literature, we propose a method of analysis for dynamic resource management for decision support. In this paper, we simulate a path planning object that moves to goal in the presence of obstacles. The distributed sensors must maintain area coverage and perform sensor management to maintain the path of the object. We investigated the sensor management functions of direct search, cueing, the sequential probability ratio test (SPRT), and information theoretical methods of KL divergence (or discrimination gain) and mutual information. These methods afford sensor hand-off and can be used to optimal place sensors to maintain are coverage and target tracking.

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.000
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.793
Threshold uncertainty score0.344

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.000
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.033
GPT teacher head0.273
Teacher spread0.241 · 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