Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.07557

SPIN: Decentralized Swarm Control via Tensorized Policy Coordination

Zhaowen Fan·Yunxiang Han
View original source ↗Read source document ↗Export metadata ↓

Abstract

Decentralized multi-agent swarm coordination remains fundamentally challenged by the combinatorial scaling of joint action spaces and high-overhead training or optimization loops when managing localized group behaviors. To address this problem from a different perspective, this paper introduces the Swarm Policy Interference Network (SPIN) framework, which models multi-agent communication topologies as compressed tensor networks. By factorizing the joint policy tensors of local multi-agent cliques into Open Boundary Condition Matrix Product State (MPS) chains, SPIN replaces explicit exponential joint-action enumeration with clique-level contractions that scale linearly in clique length for fixed local behavior and bond dimensions. To connect raw spatial geometry with this discrete algebraic backend without relying on online training loops, we introduce a decoupled framework combining a lightweight frozen neural mapper evaluated offline with a deterministic zero-shot importance-reweighting filter based on the Radon-Nikodým derivative. We evaluate an executable prototype of this framework within a simulation experiment across distinct task regimes: single-target tracking, decentralized area coverage, and structured multi-goal coordination. The results demonstrate that SPIN functions as a reusable decentralized coordination layer across tracking, dispersion / area coverage, and structured multi-goal coordination, with its strongest gains appearing in multi-goal coordination and dense local interaction regimes, without requiring scenario-specific online optimization or retraining.

Explore related subjects

cs.LGcs.MAcs.SI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhaowen Fan, Yunxiang Han. 2026-07-20. SPIN: Decentralized Swarm Control via Tensorized Policy Coordination. https://arxiv.org/abs/2606.07557

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

KEEP EXPLORING

Related papers

arXiv2026

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG↗
arXiv2026

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG↗
arXiv2026

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG↗