MétaCan
Menu
Back to cohort
Record W1986121630 · doi:10.1109/ssrr.2009.5424167

Market-based dynamic task allocation in mobile surveillance systems

2009· article· en· W1986121630 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
TopicOptimization and Search Problems
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceTask (project management)Distributed computingMobile robotSet (abstract data type)Tree (set theory)Mobile telephonyVolume (thermodynamics)Mobile computingReal-time computingRobotArtificial intelligenceComputer networkMobile radioEngineering

Abstract

fetched live from OpenAlex

Mobile surveillance systems include a vast array of mobile sensing nodes with varying sensing modalities that can sense continuously the volume of interest. These distributed nodes are capable of sensing, processing, mobilization and communication with other nodes. One of the fundamental problems of mobile surveillance systems is how to assign a set of tasks to a set of mobile sensors and how to coordinate the behavior of these mobile sensing nodes in order to perform cooperative tasks efficiently. This problem is known as multi-robot task allocation (MRTA). This paper presents centralized and hierarchical dynamic and fixed tree task allocation approaches to solve the MRTA problem. The objective comparison results show that hierarchical dynamic tree task allocation outperforms all the other techniques especially in complex surveillance operations where large number of robots is used to scan large number of areas.

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.981
Threshold uncertainty score0.268

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.001
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.008
GPT teacher head0.248
Teacher spread0.240 · 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

Quick stats

Citations8
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicOptimization and Search ProblemsFrench-language works237,207