Energy-Efficient Fast Delivery by Mobile Agents

Bärtschi, Andreas; Tschager, Thomas

doi:10.1007/978-3-662-55751-8_8

Cited by 14 publications

(26 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They provided 2-resource-augmented algorithm for general graphs in this setting and showed that it is the best possible solution that can be computed in polynomial time. Other variants of collaborative delivery that have been considered are when agents have distinct rate of energy consumption [21] or when the agents have distinct speeds [22]. In these cases the optimization criteria is to minimize the total energy consumption and/or the total time taken for delivery.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Collaborative delivery on a fixed path with homogeneous energy-constrained agents

Chalopin

Das

Disser

et al. 2021

Theoretical Computer Science

View full text Add to dashboard Cite

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 some vertex of the graph; it can move along the edges of the graph and can can pick up the package from a vertex and drop it in another vertex during the course of its movement. 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, we show that 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 a single pickup per agent), compared to the known results for the general version of the problem.We provide polynomial time approximation algorithms for both directed and $ This work was partially supported by the ANR project ANCOR (anr-14-CE36-0002-01).

show abstract

Section: Related Workmentioning

confidence: 99%

“…Another related work [23] studied the collective delivery problem for selfish agents that try to optimize their personal gain. See also [24] for a survey of recent results on collaborative delivery by agents with energy limitations.…”

Section: Related Workmentioning

confidence: 99%

Collaborative delivery on a fixed path with homogeneous energy-constrained agents

Chalopin

Das

Disser

et al. 2021

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…In [12] it is shown that deciding whether the agents can deliver the data is (weakly) NP-complete. Additional research under various conditions and topological assumptions can be found in [4] which studies the game-theoretic task of selecting mobile agents to deliver multiple items on a network and optimizing or approximating the total energy consumption over all selected agents, in [2,5,7] which study data delivery and combine energy and time efficiency, and in [18,19] which are concerned with collaborative exploration in various topologies.…”

Section: Related Workmentioning

confidence: 99%

Message Delivery in the Plane by Robots with Different Speeds

Coleman¹,

Kranakis²,

Kriz̧anc³

et al. 2021

Preprint

View full text Add to dashboard Cite

We study a fundamental cooperative message-delivery problem on the plane. Assume n robots which can move in any direction, are placed arbitrarily on the plane. Robots each have their own maximum speed and can communicate with each other face-to-face (i.e., when they are at the same location at the same time). There are also two designated points on the plane, S (the source) and D (the destination). The robots are required to transmit the message from the source to the destination as quickly as possible by face-to-face message passing. We consider both the offline setting where all information (the locations and maximum speeds of the robots) are known in advance and the online setting where each robot knows only its own position and speed along with the positions of S and D. In the offline case, we discover an important connection between the problem for two-robot systems and the well-known Apollonius circle which we employ to design an optimal algorithm. We also propose a √ 2 approximation algorithm for systems with any number of robots. In the online setting, we provide an algorithm with competitive ratio 1 7 5 + 4 √ 2 for two-robot systems and show that the same algorithm has a competitive ratio less than 2 for systems with any number of robots. We also show these results are tight for the given algorithm. Finally, we give two lower bounds (employing different arguments) on the competitive ratio of any online algorithm, one of 1.0391 and the other of 1.0405.

show abstract

“…Additional research under various conditions and topological assumptions can be found in [2] which studies the game-theoretic task of selecting mobile agents to deliver multiple items on a network and optimizing or approximating the total energy consumption over all selected agents, in [3] which studies data delivery and combines energy and time efficiency, and in [11,12] which is concerned with collaborative exploration in various topologies.…”

Section: Related Workmentioning

confidence: 99%

The Pony Express Communication Problem

Coleman¹,

Kranakis²,

Kriz̧anc³

et al. 2021

Preprint

View full text Add to dashboard Cite

We introduce a new problem which we call the Pony Express problem. n robots with differing speeds are situated over some domain. A message is placed at some commonly known point. Robots can acquire the message either by visiting its initial position, or by encountering another robot that has already acquired it. The robots must collaborate to deliver the message to a given destination 6 .The objective is to deliver the message in minimum time. In this paper we study the Pony Express problem on the line where n robots are arbitrarily deployed along a finite segment. We are interested in both offline centralized and online distributed algorithms. In the online case, we assume the robots have limited knowledge of the initial configuration. In particular, the robots do not know the initial positions and speeds of the other robots nor even their own position and speed. They do, however, know the direction on the line in which to find the message and have the ability to compare speeds when they meet. First, we study the Pony Express problem where the message is initially placed at one endpoint (labeled 0) of a segment and must be delivered to the other endpoint (labeled 1). We provide an O(n log n) running time offline algorithm as well as an optimal (competitive ratio 1) online algorithm. Then we study the Half-Broadcast problem where the message is at the center (at 0) and must be delivered to either one of the endpoints of the segment [−1, +1]. We provide an offline algorithm running in O(n 2 log n) time and we provide an online algorithm that attains a competitive ratio of 3 2 which we show is the best possible. Finally, we study the Broadcast problem where the message is at the center (at 0) and must be delivered to both endpoints of the segment [−1, +1]. Here we give an FPTAS in the offline case and an online algorithm that attains a competitive ratio of 9 5 , which we show is tight.

show abstract

Energy-Efficient Fast Delivery by Mobile Agents

Cited by 14 publications

References 28 publications

Collaborative delivery on a fixed path with homogeneous energy-constrained agents

Collaborative delivery on a fixed path with homogeneous energy-constrained agents

Message Delivery in the Plane by Robots with Different Speeds

The Pony Express Communication Problem

Contact Info

Product

Resources

About