MétaCan
Menu
Back to cohort
Record W4386883033 · doi:10.1109/tnnls.2023.3309326

Adaptive Event-Triggered Bipartite Formation for Multiagent Systems via Reinforcement Learning

2023· article· en· W4386883033 on OpenAlexaff
Huarong Zhao, Jinjun Shan, Peng Li, Hongnian Yu

Bibliographic record

VenueIEEE Transactions on Neural Networks and Learning Systems · 2023
Typearticle
Languageen
FieldComputer Science
TopicAdaptive Dynamic Programming Control
Canadian institutionsYork University
FundersFundamental Research Funds for the Central UniversitiesHigher Education Discipline Innovation Project
KeywordsBipartite graphLyapunov functionComputer scienceReinforcement learningLinearizationAdaptive controlNonlinear systemController (irrigation)Artificial neural networkConvergence (economics)Control theory (sociology)Multi-agent systemGraphFeedback linearizationArtificial intelligenceControl (management)Theoretical computer science

Abstract

fetched live from OpenAlex

This article investigates the online learning and energy-efficient control issues for nonlinear discrete-time multiagent systems (MASs) with unknown dynamics models and antagonistic interactions. First, a distributed combined measurement error function is formulated using the signed graph theory to transfer the bipartite formation issue into a consensus issue. Then, an enhanced linearization controller model for the controlled MASs is developed by employing dynamic linearization technology. After that, an online learning adaptive event-triggered (ET) actor-critic neural network (AC-NN) framework for the MASs to implement bipartite formation control tasks is proposed by employing the optimized NNs and designed adaptive ET mechanism. Moreover, the convergence of the designed formation control framework is strictly proved by the constructed Lyapunov functions. Finally, simulation and experimental studies further demonstrate the effectiveness of the proposed algorithm.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.021
GPT teacher head0.245
Teacher spread0.224 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations28
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Neural Networks and Learning SystemsSame topicAdaptive Dynamic Programming ControlFrench-language works237,207