MétaCan
Menu
Back to cohort
Record W2159013590 · doi:10.1109/icma.2007.4303973

Temperature Control of Energetic Swarms

2007· article· en· W2159013590 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
TopicDistributed Control Multi-Agent Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsSwarm behaviourParticle swarm optimizationMulti-swarm optimizationComputer scienceTrajectoryController (irrigation)Swarm intelligenceTemperature controlSwarm roboticsMathematical optimizationControl theory (sociology)Control (management)AlgorithmMathematicsEngineeringControl engineeringArtificial intelligencePhysics

Abstract

fetched live from OpenAlex

In this paper, an M-member continuous-time energetic swarm problem is studied. A new swarm temperature variable is introduced to investigate the internal kinetic energy properties of the swarm. A controller is developed such that the swarm center can follow any desired trajectory with different corresponding swarm temperatures. The proposed control algorithm can be used effectively for multi-agent coverage path planning problem. It is shown that a better coverage can be achieved by increasing the temperature of a swarm. In addition, more insight into the problem of swarm cohesion is provided. Simulation is used to validate the results and to understand the basic properties of energetic swarm such as velocity distribution.

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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.975
Threshold uncertainty score0.402

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.000
Open science0.0010.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.005
GPT teacher head0.214
Teacher spread0.209 · 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

Citations7
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Control Multi-Agent SystemsFrench-language works237,207