English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The coordination among drones and ground vehicles for last-mile delivery hasgained significant interest in recent years. In this paper, we study\textit{multiple drone delivery scheduling problem(MDSP) \cite{Betti_ICDCN22}for last-mile delivery, where we have a set of drones with an identical batterybudget and a set of delivery locations, along with reward or profit fordelivery, cost and delivery time intervals. The objective of the MDSP is tofind a collection of conflict-free schedules for each drone such that the totalprofit for delivery is maximum subject to the battery constraint of the drones.Here we propose a fully polynomial time approximation scheme (FPTAS) for thesingle drone delivery scheduling problem (SDSP) and a$\frac{1}{4}$-approximation algorithm for MDSP with a constraint on the numberof drones.

Approximation Algorithms for Drone Delivery Scheduling Problem