Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.14127

Help | Advanced Search

Computer Science > Robotics

arXiv:2509.14127 (cs)
[Submitted on 17 Sep 2025 ]

Title: Energy Efficient Multi Robot Package Delivery under Capacity-Constraints via Voronoi-Constrained Networks

Title: 基于Voronoi约束网络的容量约束下高效多机器人包裹配送

Authors:Alkesh K. Srivastava, Jared Michael Levin, Philip Dames
Abstract: We consider the problem of delivering multiple packages from a single pickup depot to distinct goal locations using a homogeneous fleet of robots with limited carrying capacity. We propose VCST-RCP, a Voronoi-Constrained Steiner Tree Relay Coordination Planning framework that constructs sparse relay trunks using Steiner tree optimization and then synthesizes robot-level pickup, relay, and delivery schedules. This framework reframes relays from incidental byproducts into central elements of coordination, offering a contrast with traditional delivery methods that rely on direct source-to-destination transport. Extensive experiments show consistent improvements of up to 34% compared to conventional baselines, underscoring the benefits of incorporating relays into the delivery process. These improvements translate directly to enhanced energy efficiency in multi-robot delivery under capacity constraints, providing a scalable framework for real-world logistics.
Abstract: 我们考虑从单一取货仓库向不同目标地点交付多个包裹的问题,使用具有有限承载能力的同质机器人车队。 我们提出VCST-RCP,一种Voronoi约束Steiner树中继协调规划框架,该框架使用Steiner树优化构建稀疏中继主干,然后综合机器人级别的取货、中继和交付计划。 此框架将中继重新定义为协调的核心要素,而非偶然的副产品,这与依赖直接源到目标运输的传统配送方法形成对比。 大量实验显示,与传统基线相比,改进幅度高达34%,证明了在配送过程中引入中继的好处。 这些改进直接转化为在容量限制下多机器人配送的能量效率提升,为现实世界的物流提供了一个可扩展的框架。
Subjects: Robotics (cs.RO) ; Multiagent Systems (cs.MA)
Cite as: arXiv:2509.14127 [cs.RO]
  (or arXiv:2509.14127v1 [cs.RO] for this version)
  https://doi.org/10.48550/arXiv.2509.14127
arXiv-issued DOI via DataCite

Submission history

From: Alkesh Kumar Srivastava [view email]
[v1] Wed, 17 Sep 2025 16:08:42 UTC (1,296 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.RO
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.MA

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

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?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号