MétaCan
Menu
Back to cohort
Record W4401580851 · doi:10.1080/00207721.2024.2390170

Complex Laplacian approach for formation tracking without velocity measurements

2024· article· en· W4401580851 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

VenueInternational Journal of Systems Science · 2024
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsConvergence (economics)Control theory (sociology)Tracking (education)Laplace operatorControl (management)Process (computing)Computer scienceConstant (computer programming)MathematicsArtificial intelligenceMathematical analysis

Abstract

fetched live from OpenAlex

This paper is focused on formation tracking control of multi-agent systems in a leader–follower setting. The objective is to introduce control algorithms to steer a team of mobile agents into a desired, moving geometrical pattern while the agents are unaware of their own and other agents' velocity information during the entire process. We introduce a formation control law under which the agents asymptotically shape a desired geometrical pattern and track a constant reference velocity. Another control law is then introduced to address the case where the reference velocity is time-varying. Both control laws are based on the complex Laplacian approach and do not require agents' velocity information. The convergence of these algorithms are proved and their performance are examined via numerical examples. Simulation results verify the outperformance of the proposed control laws compared to the rival control schemes in the literature.

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.004
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.981
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0020.004
Open science0.0030.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.114
GPT teacher head0.336
Teacher spread0.222 · 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