Energy-Efficient Delivery by Heterogeneous Mobile Agents

Bärtschi, Andreas; Chalopin, Jérémie; Das, Shantanu; Disser, Yann; Gräf, Daniel; Hackfeld, Jan; Penna, Paolo

doi:10.4230/lipics.stacs.2017.10

Cited by 3 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the first package must reach u n+1 and the second package must reach u n+1 by time n + 1 as shown above, we have by (7):…”

Section: The Reductionmentioning

confidence: 99%

“…The problem of delivering packages through a swarm of autonomous drones has been studied in the literature. The work of Bärtschi et al [7] considers the problem of delivering packages while minimizing the total energy consumption of the drones. In their work, all drones have the same velocity but may have different weights, and the package's exchanges between drones are restricted to take place on the graph's nodes.…”

Section: Related Workmentioning

confidence: 99%

“…, Y n corresponds to the situation discussed in Section 5.2, and hence the findings from that section apply. By (7), at time n + 1 the package reaches the point on P at distance…”

Section: The Reductionmentioning

confidence: 99%

See 2 more Smart Citations

On the fast delivery problem with one or two packages

Carvalho

Erlebach

Papadopoulos

2021

Journal of Computer and System Sciences

View full text Add to dashboard Cite

“…As the first package must reach u n+1 and the second package must reach u n+1 by time n + 1 as shown above, we have by (7):…”

Section: The Reductionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On the fast delivery problem with one or two packages

Carvalho

Erlebach

Papadopoulos

2021

Journal of Computer and System Sciences

View full text Add to dashboard Cite

“…The problem of delivering packages through a swarm of autonomous drones has been studied in the literature. The work of Bärtschi et al [3] considers the problem of delivering packages while minimizing the total energy consumption of the drones. In their work, all drones have the same velocity but may have different weights, and the package's exchanges between drones are restricted to take place on the graph's nodes.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Algorithm for the Fast Delivery Problem

Carvalho

Erlebach

Papadopoulos

2019

Fundamentals of Computation Theory

View full text Add to dashboard Cite

We study a problem where k autonomous mobile agents are initially located on distinct nodes of a weighted graph (with n nodes and m edges). Each autonomous mobile agent has a predefined velocity and is only allowed to move along the edges of the graph. We are interested in delivering a package, initially positioned in a source node s, to a destination node y. The delivery is achieved by the collective effort of the autonomous mobile agents, which can carry and exchange the package among them. The objective is to compute a delivery schedule that minimizes the delivery time of the package. In this paper, we propose an O(kn log n + km) time algorithm for this problem. This improves the previous state-of-the-art O(k 2 m + kn 2 + APSP) time algorithm for this problem, where APSP stands for the running-time of an algorithm for the All-Pairs Shortest Paths problem.

show abstract