AI News HubLIVE
站內改寫2 分鐘閱讀

待翻譯:DeRP: An Algorithm for Self-Assembly of Power-Delivery Networks using Recursive Branching in Information-Limited Environments

AI 服務暫時不可用,以下為來源摘要,待恢復後補全翻譯:arXiv:2608.02904v1 Announce Type: new 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.

來源arXiv Robotics作者: Mohammadali Rashidioun, Sangwoo Park, Petras Swissler

AI 服務暫時不可用,以下為來源正文,待恢復後補全翻譯。

--> [Submitted on 3 Aug 2026] Title:DeRP: An Algorithm for Self-Assembly of Power-Delivery Networks using Recursive Branching in Information-Limited Environments View a PDF of the paper titled DeRP: An Algorithm for Self-Assembly of Power-Delivery Networks using Recursive Branching in Information-Limited Environments, by Mohammadali Rashidioun and 2 other authors View PDF HTML (experimental) 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. Comments: 8 pages Subjects: Robotics (cs.RO) Cite as: arXiv:2608.02904 [cs.RO] (or arXiv:2608.02904v1 [cs.RO] for this version) https://doi.org/10.48550/arXiv.2608.02904 arXiv-issued DOI via DataCite (pending registration) Submission history From: Petras Swissler [view email] [v1] Mon, 3 Aug 2026 21:42:49 UTC (795 KB) Full-text links: Access Paper: View a PDF of the paper titled DeRP: An Algorithm for Self-Assembly of Power-Delivery Networks using Recursive Branching in Information-Limited Environments, by Mohammadali Rashidioun and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.RO new | recent | 2026-08 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar Loading... Data provided by: Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)