UAV Path Planning for Civil Applications

We will present a simple and efficient algorithm for solving the path planning problem for civil UAV operating in a dynamic or incomplete environment. This algorithm searches for a continuous waypoints sequence starting from the initial configuration, visiting all the desired locations and reaching the final position. We will present our proposed algorithm on two steps: The first produces a sorted location set. The second step generates an optimal path for the overall mission. The same algorithm constructs the initial path or re-plans a new one when changes occur to the configuration space. To prove the effectiveness of our proposed algorithm, we will provide computer simulations. A comparison of many results will show that this algorithm yields good experience performance over a wide variety of examples.

@article{Asmaa2019,
  title     = {UAV Path Planning for Civil Applications},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {10},
  number    = {12},
  year      = {2019},
  publisher = {The Science and Information Organization},
  author    = {IDALENE Asmaa and BOUKHDIR Khalid and MEDROMI Hicham},
  doi       = {10.14569/IJACSA.2019.0101281},
  url       = {https://doi.org/10.14569/IJACSA.2019.0101281}
}