Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents

Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matúš Mihalák

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Abstract

We consider the problem of collectively delivering a package from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent starts from a distinct vertex of the graph, and can move along the edges of the graph carrying the package. However, each agent has limited energy budget allowing it to traverse a path of bounded length b; thus, multiple agents need to collaborate to move the package to its destination. Given the positions of the agents in the graph and their energy budgets, the problem of finding a feasible movement schedule is called the collaborative delivery problem and has been studied before.one of the open questions from previous results is what happens when the delivery must follow a fixed path given in advance. Although this special constraint reduces the search space for feasible solutions, the problem of finding a feasible schedule remains np hard (as the original problem). We consider the optimization version of the problem that asks for the optimal energy budget b per agent which allows for a feasible delivery schedule, given the initial positions of the agents. We show the existence of better approximations for the fixed-path version of the problem (at least for the restricted case of single pickup per agent), compared to the known results for the general version of the problem, thus answering the open question from the previous paper.we provide polynomial time approximation algorithms for both directed and undirected graphs, and establish hardness of approximation for the directed case. Note that the fixed path version of collaborative delivery requires completely different techniques since a single agent may be used multiple times, unlike the general version of collaborative delivery studied before. We show that restricting each agent to a single pickup allows better approximations for fixed path collaborative delivery compared to the original problem. Finally, we provide a polynomial time algorithm for determining a feasible delivery strategy, if any exists, for a given budget b when the number of available agents is bounded by a constant.
Original languageEnglish
Title of host publicationStructural Information and Communication Complexity. SIROCCO 2019
Subtitle of host publicationProceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)
EditorsKeren Censor-Hillel, Michele Flammini
PublisherSpringer, Cham
Pages139-153
Number of pages15
ISBN (Electronic)978-3-030-24922-9
ISBN (Print)978-3-030-24921-2
DOIs
Publication statusPublished - 2019

Publication series

SeriesLecture Notes in Computer Science
Number11639
ISSN0302-9743

Cite this