MétaCan
Menu
Back to cohort
Record W4391547749 · doi:10.1109/lsp.2024.3362189

Distributed Multi-Sensor Control for Multi-Target Tracking With a Sparsity-Promoting Objective Function

2024· article· en· W4391547749 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 Signal Processing Letters · 2024
Typearticle
Languageen
FieldEngineering
TopicGuidance and Control Systems
Canadian institutionsUniversity of Calgary
FundersAeronautical Science Foundation of ChinaChina Scholarship Council
KeywordsComputer scienceFunction (biology)Tracking (education)Wireless sensor networkControl (management)Artificial intelligenceComputer network

Abstract

fetched live from OpenAlex

A distributed multi-sensor control method is presented for multi-target tracking. The problem is formulated as auctioned partially observed Markov decision processes (auctioned POMDPs), which is a tractable approach to approximate the solutions in a distributed manner. To ensure adequate coverage of the multi-sensor system, a sparsity-promoting objective function is also designed to reduce overlapping sensing areas, balancing a tradeoff between the control reward and sensor coverage. Simulation results demonstrate that the proposed distributed method achieves comparable tracking performance to the state-of-art centralized approach. Furthermore, the proposed sparsity-promoting objective function outperforms the conventional Cauchy-Schwarz divergence (CSD) in discovery performance.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.890
Threshold uncertainty score1.000

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.020
GPT teacher head0.230
Teacher spread0.210 · 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