Distributed identification of stable large-scale isomorphic nonlinear networks using partial observations

Distributed parameter identification in large-scale isomorphic nonlinear multi-agent networks encounters challenges due to inherent nonlinear dynamics and partial observations. Ensuring stability is crucial for stable parameter identification, especially under uncertainties in data and models. To address these challenges, this paper proposes a particle consensus-based expectation maximization (EM) algorithm. The E-step employs a distributed particle filtering approach to achieve global consensus state estimation, approximating the analytically intractable likelihood function arising from unknown dynamic interactions and multiple integrals. The M-step imposes prior contraction-stabilization constraints during likelihood function maximization to ensure stable parameter identification under data and model uncertainties. Performance analysis and simulation results confirm the effectiveness of the proposed method in accurately identifying parameters for nonlinear networks.

Authors

Publication Details

Journal
Automatica
Published
2025-11-20
DOI
https://doi.org/10.1016/j.automatica.2025.112702
Citations
1
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed identification of stable large-scale isomorphic nonlinear networks using partial observations

Chengpu Yu, Chunhui Li
1 citations
Automatica
Distributed Control Multi-Agent Systems
1.49
article

Distributed identification of stable large-scale isomorphic nonlinear networks using partial observations

Chengpu Yu, Chunhui Li
article en
1 citations

Abstract

Distributed parameter identification in large-scale isomorphic nonlinear multi-agent networks encounters challenges due to inherent nonlinear dynamics and partial observations. Ensuring stability is crucial for stable parameter identification, especially under uncertainties in data and models. To address these challenges, this paper proposes a particle consensus-based expectation maximization (EM) algorithm. The E-step employs a distributed particle filtering approach to achieve global consensus state estimation, approximating the analytically intractable likelihood function arising from unknown dynamic interactions and multiple integrals. The M-step imposes prior contraction-stabilization constraints during likelihood function maximization to ensure stable parameter identification under data and model uncertainties. Performance analysis and simulation results confirm the effectiveness of the proposed method in accurately identifying parameters for nonlinear networks.

AutomaticaVol. 184
Openalex Percentile: Top 12%
Distributed Control Multi-Agent Systems
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.