MétaCan
Menu
Back to cohort
Record W2745739653 · doi:10.1109/ahs.2017.8046386

Self-adaptive pattern formation with battery-powered robot swarms

2017· article· en· W2745739653 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
FieldEngineering
TopicModular Robots and Swarm Intelligence
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsRobotComputer scienceMobile robotSwarm behaviourSoftware deploymentTree traversalSimulationBattery (electricity)Real-time computingArtificial intelligenceAlgorithmPower (physics)

Abstract

fetched live from OpenAlex

This paper presents a distributed, energy-aware algorithm for an autonomous deployment of battery-powered robots in a specified pattern. While each robot gradually discharges and leaves the formation to recharge, the algorithm presented in this paper assures that the formation pattern is preserved. This is achieved by defining the desired pattern as a point cloud where each point is occupied by a robot. The point cloud is transformed into a tree model that is shared among all robots. This model is used by each robot independently to govern its behavior, resulting in a self-adaptive network of robots which automatically generate paths for joining the formation and leaving it to recharge. Robots which leave the formation are replaced by neighbors to preserve the formation pattern. To demonstrate our algorithm we use a physics-based simulator and evaluate the persistence of the pattern formation formed by a robot swarm in an environment without global positioning, using only range and bearing.

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: Empirical · Consensus signal: none
Teacher disagreement score0.967
Threshold uncertainty score0.407

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.017
GPT teacher head0.211
Teacher spread0.195 · 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
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicModular Robots and Swarm IntelligenceFrench-language works237,207