MétaCan
Menu
Back to cohort
Record W2023813658 · doi:10.1117/12.604337

Command, control, and autonomous swarms

2005· article· en· W2023813658 on OpenAlexaff
Simon P. Monckton, Gregory S. Broten

Bibliographic record

VenueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2005
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsSwarm behaviourComputer scienceBandwidth (computing)Dependency (UML)PredictabilityRobotDistributed computingControl (management)Command and controlSwarm roboticsSwarm intelligenceControl engineeringArtificial intelligenceParticle swarm optimizationEngineeringComputer networkTelecommunications

Abstract

fetched live from OpenAlex

For unmanned combat forces, some research proposes multi-robot coordination through common analytical coordination algorithms using reliable, high bandwidth communications. Such coordination is capable of optimal or near-optimal distribution of unmanned forces, but requires reliable communications and frequent feedback and control to ensure predictable performance. Others propose local autonomy, reducing dependence on reliable communications through greater intelligence within each unmanned system, but at the cost of optimality, predictability, and dependency on rich, high rate sensing. Thus a fundamental problem of swarm control can be starkly drawn. If centralized control is not practical and the swarm must function at a level comparable to manned forces, swarm members must adhere to common goal direction semantics that permits each unit to dissect its contribution to the team objective with or without consultation and negotiation. How, then should missions be expressed, allocated, and monitored?

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.006
Scholarly communication0.0030.004
Open science0.0010.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0050.001

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.009
GPT teacher head0.218
Teacher spread0.208 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations0
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIESame topicDistributed Control Multi-Agent SystemsFrench-language works237,207