A Survey on Approximation Algorithms for Path Planning of UAVs 


Vol. 43,  No. 1, pp. 161-167, Jan.  2018
10.7840/kics.2018.43.1.161


PDF
  Abstract

As exploiting Unmanned Aerial Vehicles (UAVs) as mobile elements is a new research trend recently, approximation algorithms to solve path planning problems for UAVs are promising approaches. In this paper, we divide problems in two main objectives, cost and reward. We introduce some representative approximation algorithms, which focus on maximizing reward or minimizing travel time. Particularly, we explore path planning for each node visit within different time deadline. In recent works, researchers extend classic algorithms to distributed path planning algorithms for multiple UAVs.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Yoon and H. Lee, "A Survey on Approximation Algorithms for Path Planning of UAVs," The Journal of Korean Institute of Communications and Information Sciences, vol. 43, no. 1, pp. 161-167, 2018. DOI: 10.7840/kics.2018.43.1.161.

[ACM Style]

JinYi Yoon and HyungJune Lee. 2018. A Survey on Approximation Algorithms for Path Planning of UAVs. The Journal of Korean Institute of Communications and Information Sciences, 43, 1, (2018), 161-167. DOI: 10.7840/kics.2018.43.1.161.

[KICS Style]

JinYi Yoon and HyungJune Lee, "A Survey on Approximation Algorithms for Path Planning of UAVs," The Journal of Korean Institute of Communications and Information Sciences, vol. 43, no. 1, pp. 161-167, 1. 2018. (https://doi.org/10.7840/kics.2018.43.1.161)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880