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

Alkesh K. Srivastava, Jared Michael Levin, Philip Dames
9/17/2025
cs.ROcs.MA

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{srivastava2025energy,
  title  = {Energy Efficient Multi Robot Package Delivery under Capacity-Constraints via Voronoi-Constrained Networks},
  author = {Alkesh K. Srivastava and Jared Michael Levin and Philip Dames},
  year   = {2025},
  eprint = {2509.14127},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.14127v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.14127.svg)](https://codeofpaper.com/paper/2509.14127)

Discussion