Abstract
Delivering sustained power to distributed equipment in unstructured field environments using pre-planned wired networks or battery-based solutions presents significant infrastructure and logistics challenges. This paper presents Dendritic Recursive Pivoting (DeRP), a decentralized framework for multi-target network formation in robot swarms based solely on local communication and bearing-based sensing toward sinks. We envision a system in which robots, acting as a conduit, self-assemble a power network from a common source, forming branches at locally selected pivot points that approximate the Steiner points of Steiner trees to efficiently route to multiple Sinks. This branching operation is performed recursively to enable scalable and adaptive network formation without global planning. The proposed method is evaluated in terms of the total network length and estimated power loss, and is quantitatively compared against global baselines such as the Minimum Spanning Tree and Steiner tree solutions (GeoSteiner), which require complete knowledge of Sink locations. Specifically, we found that the networks formed by DeRP asymptotically form approximately 125% of the global minimum length while reducing power losses to 65% relative to Euclidean Steiner trees. In addition, we empirically characterize scaling behavior by measuring simulation completion time as the number of Sinks and robots increases, and find that this scaling was sub-linear for up to 100 sinks. The proposed approach enables resilient, adaptive power delivery in environments where deployment of traditional infrastructure is challenging.
Explore similar work
May 20, 2026cs.RO
Autonomous drone swarms deployed for surveillance, environmental monitoring, and infrastructure inspection must maintain reliable coverage of critical assets despite robot failures. This requires multicoverage: each asset must be observed by multiple robots for redundancy, with coverage requirements varying by asset importance. While recent work has solved the centralized problem optimally using integer programming, practical deployments face constraints that demand distributed solutions: robots operate with limited communication ranges, onboard computation restricts global planning, and partial system failures must not cause mission abort. We present a distributed multicoverage algorithm for robot swarms operating with local sensing, local communication, and no global coordination.
Mariem Guitouni, Aaron T. Becker
May 25, 2026cs.LG
Decentralized multi-agent swarm coordination on resource-constrained edge platforms remains fundamentally bottlenecked by the exponential scaling of joint action spaces and high-latency communication overhead. This paper introduces the Swarm Policy Interference Network (SPIN) framework, an architectural paradigm that bypasses these limitations by modeling swarm topologies as a compressed tensor network. We factorize the joint policy tensors of local multi-agent cliques into Matrix Product State (MPS) chains, reducing the computational complexity of evaluation from an exponential
O(nm) wall to a strictly linear
O(m⋅n⋅χ2) constraint. To bridge local continuous spatial geometry with this discrete algebraic backend without requiring power-intensive online training loops, we introduce a decoupled, hybrid neuro-symbolic control pipeline. Local multi-layered neural networks operate as structural coordination encoders, pre-trained offline to nonlinearly map hand-engineered geometric descriptors into abstract environmental target measures. At runtime, edge agents execute instantaneous behavioral adaptations by applying the Radon-Nikodým derivative directly as a zero-shot importance-reweighting filter. We validate the framework within a discrete-time multi-agent simulation sandbox spanning tracking, decentralized dispersion/area coverage, and multi-goal coordination regimes. Qualitative telemetry demonstrates that the integrated pipeline achieves stable target-directed motion, anti-collapse spatial spreading under decentralized constraints, and structured subgroup formation across multiple targets, providing a mathematically grounded route to tractable, low-power edge swarm intelligence.
Zhaowen Fan
Aug 3, 2026cs.RO
Accurate localization remains a key challenge in swarm robotics, particularly for self-reconfigurable systems that must identify relative positions to form diverse structures. Most existing approaches rely on external tracking infrastructure or high-cost sensors, which limit scalability and deployment in unstructured environments. In this paper, we propose a novel contact-driven localization method for modular robots that leverages only local communication through binary contact information (whether two robots are physically connected or not). To exploit these contact cues, we introduce a virtual-force framework in which robots iteratively refine their poses attracting toward dock-connected neighbors and repelling from non-connected ones. The method requires no external infrastructure and relies only on minimal onboard sensing. Simulations show effective localization during the assembly of towers and cantilevers, enabling accurate, scalable, free-form self-assembly.
Mohammadali Rashidioun, Michael Sosa, Petras Swissler