MétaCan
Menu
Back to cohort
Record W2007718303 · doi:10.1109/ascc.2013.6606205

Robust adaptive attitude synchronization of rigid body networks with unknown inertias

2013· article· en· W2007718303 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsSynchronization (alternating current)Control theory (sociology)InertiaManifold (fluid mechanics)Lyapunov functionComputer scienceNonlinear systemTask (project management)Rigid bodyFunction (biology)Artificial intelligenceEngineeringControl (management)Channel (broadcasting)

Abstract

fetched live from OpenAlex

In this paper we consider the attitude synchronization task for rigid body networks. The configurations of such systems evolve on SO(3), which is a nonlinear manifold and needs a special treatment for fulfilling this task. We propose two robust adaptive algorithms to handle the effects of unmodeled dynamics and unknown inertia matrices of agents. Our first approach is based on σ-modification method which “trap” the trajectories of the system in to a small neighborhood around the origin. In the second algorithm, the effects of external disturbances are removed using a discontinuous function. We use Lyapunov methods to prove the main results of this paper. Simulation results show the effectiveness of our proposed methods.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.973
Threshold uncertainty score0.528

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.013
GPT teacher head0.190
Teacher spread0.177 · 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

Citations3
Published2013
Admission routes2
Has abstractyes

Explore more

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