Online Ride-Hitching in UAV Travelling

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review

View graph of relations

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationComputing and Combinatorics - 27th International Conference, COCOON 2021, Proceedings
EditorsChi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee
Place of PublicationCham
PublisherSpringer
Pages565-576
ISBN (Electronic)9783030895433
ISBN (Print)9783030895426
Publication statusPublished - 2021

Publication series

NameLecture Notes in Computer Science
Volume13025
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Title27th International Conference on Computing and Combinatorics (COCOON 2021)
LocationShangri-La's Far Eastern Plaza Hotel
PlaceTaiwan
CityTainan
Period24 - 26 October 2021

Abstract

The unmanned aerial vehicle (UAV) has emerged as a promising solution to provide delivery and other mobile services to customers rapidly, yet it drains its stored energy quickly when travelling on the way and (even if solar-powered) it takes time for charging power on the way before reaching the destination. To address this issue, existing works focus more on UAV’s path planning with designated system vehicles providing charging service. However, in some emergency cases and rural areas where system vehicles are not available, public trucks can provide more feasible and cost-saving services and hence a silver lining. In this paper, we explore how a single UAV can save flying distance by exploiting public trucks, to minimize the travel time of the UAV. We give the first theoretical work studying online algorithms for the problem, which guarantees a worst-case performance. We first consider the offline problem knowing future truck trip information far ahead of time. By delicately transforming the problem into a graph satisfying both time and power constraints, we present a shortest-path algorithm that outputs the optimal solution of the problem. Then, we proceed to the online setting where trucks appear in real-time and only inform the UAV of their trip information some certain time Δt beforehand. As a benchmark, we propose a well-constructed lower bound that an online algorithm could achieve. We propose an online algorithm MyopicHitching that greedily takes truck trips and an improved algorithm Δt -Adaptive that further tolerates a waiting time in taking a ride. Our theoretical analysis shows that Δt -Adaptive is asymptotically optimal in the sense that its ratio approaches the proposed lower bounds as Δt increases.

Research Area(s)

  • Energy efficiency, Online algorithm, Ride-hitching

Citation Format(s)

Online Ride-Hitching in UAV Travelling. / Li, Songhua; Li, Minming; Duan, Lingjie; Lee, Victor C. S.

Computing and Combinatorics - 27th International Conference, COCOON 2021, Proceedings. ed. / Chi-Yeh Chen; Wing-Kai Hon; Ling-Ju Hung; Chia-Wei Lee. Cham : Springer, 2021. p. 565-576 (Lecture Notes in Computer Science; Vol. 13025).

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review