MétaCan
Menu
Back to cohort
Record W2483243753 · doi:10.1109/acc.2016.7525296

Formation control of high-altitude balloons by distributed extremum seeking control

2016· article· en· W2483243753 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
TopicExtremum Seeking Control Systems
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputationController (irrigation)Computer scienceControl (management)Control theory (sociology)Function (biology)Altitude (triangle)BalloonControl engineeringSimulationEngineeringAlgorithmMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, a method for the formation control of high-altitude balloons is developed. This method uses a distributed extremum seeking controller implemented at each balloon. The controller works to minimize a cost function based on the number of users connected to each balloon. This cost function is designed so that the balloons tend to spread themselves out evenly over Earth. The control approach is fully distributed and requires no central coordinator. Balloons communicate over a network via a consensus algorithm providing all balloons with an accurate estimate of the total cost. Since extremum seeking is a model-free approach, it does not require a complex wind model. The resulting algorithm is efficient as the burden of computation is shared between all balloons. A simulation study involving 20 balloons is used to verify the effectiveness of this approach.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.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.004
GPT teacher head0.175
Teacher spread0.171 · 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
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicExtremum Seeking Control SystemsFrench-language works237,207