Joint Green and Deadline-Aware Path Planning for Rotary-Wing UAV-Assisted Internet-of-Things
This paper proposes two unmanned aerial vehicles (UAV) trajectory planning solutions taking into consideration mission deadline, energy consumption, and communication constraints. The problem is mathematically formulated as a mult-iobjective optimization problem. The NP-hardness complexity is demonstrated then two heuristic solutions are proposed. Specifically, we first present a near-optimal UAV trajectory planning algorithm that reduces the number of stop/hovering points. Then, we propose an artificial bee colony-based algorithm with enhanced candidate selection. Extensive simulation results show that both our schemes outperform the well-known Successive Convex Approximation (SCA) technique, under low-moderate traffic demand. They perform as well as SCA under high demand.
Authors
- Halima Elbiaze (ORCID: https://orcid.org/0000-0001-5681-6445)
- Essaïd Sabir (ORCID: https://orcid.org/0000-0001-9946-5761)
- Akram Khelili
Institutions
- Université du Québec à Montréal (CA)
Publication Details
- Published
- 2024-09-02
- DOI
- https://doi.org/10.1109/pimrc59610.2024.10817272
- Citations
- 1
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.25