Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.23203

A Network Transformation Mapping Approach to Synchronization of Multi-Agent Systems With Disconnected Switching Topologies

Haotian Xu·Bohui Wang·Shuai Liu·Chao Shen·Xiangyu Meng·Guanghui Wen
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper focuses on the multi-agent synchronization problem with an open-loop unstable leader and followers under the switching topologies. For this issue, the typical approach is intermittent communication (including a spanning tree intermittently) or fast switching strategy. We here consider a more general scenario where each communication link between two agents is randomly disconnected and reconnected, and the durations of both the disconnected intervals and the connected intervals follow negative exponential distributions. To handle this issue, we propose a network transformation mapping method that divides the communication network into reachable and unreachable parts at any time. A node can access the leader's information and synchronize only when it lies in the reachable part; otherwise, it cannot. For each node, the synchronization speed is designed such that its convergence amplitude in the reachable part exceeds its divergence amplitude in the unreachable part. Hence, all nodes achieve asymptotic synchronization over the entire time domain. We further develop adaptive strategies for coupling gains to reduce the computational complexity introduced by the network transformation mapping. The proposed method is also applicable to jointly connected switching topologies and distributed observers under topologies that lack a spanning tree at any time. Finally, two numerical simulations -- synchronous control of multi-one-link manipulator systems and multi-motor systems based on Fieldbus -- are provided to demonstrate the effectiveness of our approach.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haotian Xu, Bohui Wang, Shuai Liu, Chao Shen, Xiangyu Meng, Guanghui Wen. 2026-04-25. A Network Transformation Mapping Approach to Synchronization of Multi-Agent Systems With Disconnected Switching Topologies. https://arxiv.org/abs/2604.23203

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Equidistribution of saddle periodic points for Hénon-like maps

We prove that under a natural assumption on the dynamical degrees, the saddle periodic points of a Hénon-like map in any dimension equidistribute with respect to the equilibrium measure. Our work is a generalization of the results of Bedford-Lyubich-Smillie, Dujardin, and Dinh-Sibony along with improvements of their techniques. We also investigate some fine properties of Green currents associated with the map.

math.DS↗
arXiv2026

On dissonance and orthogonal projections of self-conformal measures

Let $μ$ be a self-conformal measure on $\mathbb{R}^d$. We establish conditions for $μ$ under which $\dim(μ*ν) = \min\lbrace d,\dimμ+\dimν\rbrace$ holds when $ν$ is any Ahlfors-regular or self-conformal measure on $\mathbb{R}^d$. Our main result states the following sufficient condition: $μ$ is totally non-linear and not supported on a smooth hypersurface. We also establish sufficient (likely non-sharp) algebraic conditions for self-conformal measures which are not totally non-linear. In addition, we show that $\dim μ\circπ^{-1} = \min\{ k, \dim μ\}$ for every ortohogonal projection $π:\mathbb{R}^d\to\mathbb{R}^k$, $0<k<d$, when either $d=2$ and $μ$ is not self-similar and not supported on a line, or $d\geq 3$ and $μ$ is totally non-linear and not supported on a smooth hypersurface.

math.DS↗
arXiv2026

Equation-Free Screening of Mittag-Leffler-Compatible Dynamics from Scalar Time Series via kNN Multi-Horizon Profiles

Fractional models provide a natural description of systems with memory, but a noninteger derivative should not be introduced solely because a time series is curved or slowly relaxing. We develop an equation-free preliminary screening framework that asks whether a scalar time series produces a multi-horizon k-nearest-neighbor (kNN) profile more compatible with Mittag-Leffler-type behavior than with selected conventional alternatives. In an ideal matched Caputo-relaxation benchmark, the complete generation-kNN-profile-model-comparison pipeline reproduces the expected Mittag-Leffler geometry and recovers the generating order to within approximately $10^{-3}$; this is interpreted as controlled calibration rather than as general fractional-order identification. Under 3% trajectory-specific observational noise, the held-out Mittag-Leffler preference is most consistent when the generating dynamics are well separated from the integer-order limit and becomes progressively less decisive as $α\rightarrow1$. The fitted order $α_{\mathrm{fit}}$, however, shows substantially larger realization-to-realization variability. Thus, relative model compatibility is more robust than single-realization order estimation in the present noisy benchmark. Noise-free nonfractional controls show a separate limitation of specificity: a stretched exponential can generate a strongly Mittag-Leffler-compatible profile, whereas inclusion of the generating rational/Hill family recovers that family and its parameters to numerical precision in the matched setting. A positive Mittag-Leffler-versus-exponential screen therefore does not uniquely establish fractional origin. A fractional chaotic system is treated only as an exploratory extension: the Mittag-Leffler growth family gives lower finite-window RMSE than exponential and logistic/saturating alternatives over the detected pre-transition interval.

math.DS↗