skip to main content
Idioma:

Motion Planning in UAV-Aided Data Collection with Dynamic Jamming

Wu, Binbin ; Zhang, Bangning ; Ma, Wenfeng ; Xie, Chen ; Guo, Daoxing ; Jiang, Hao

Electronics (Basel), 2023-04, Vol.12 (8), p.1841 [Periódico revisado por pares]

Basel: MDPI AG

Texto completo disponível

Citações Citado por
  • Título:
    Motion Planning in UAV-Aided Data Collection with Dynamic Jamming
  • Autor: Wu, Binbin ; Zhang, Bangning ; Ma, Wenfeng ; Xie, Chen ; Guo, Daoxing ; Jiang, Hao
  • Assuntos: Algorithms ; Altitude ; Boundary value problems ; CFC ; Communication ; Convex analysis ; Data collection ; Demodulation ; Design ; Drone aircraft ; dynamic jammings ; Energy consumption ; Flight corridors ; Internet of Things ; Jamming ; Motion planning ; Obstacle avoidance ; Optimization ; SCA ; Sensors ; UAV ; Unmanned aerial vehicles
  • É parte de: Electronics (Basel), 2023-04, Vol.12 (8), p.1841
  • Descrição: Unmanned-aerial-vehicle (UAV)-aided data collection for Internet of Things applications has attracted increasing attention. This paper investigates motion planning for UAV collecting low-power ground sensor node (SN) data in a dynamic jamming environment. We targeted minimizing the flight energy consumption via optimization of the UAV trajectory while considering the indispensable constraints which cover the collection data demodulation threshold, obstacle avoidance, data collection volume, and motion principle. Firstly, we formulate the UAV-aided data collection problem as an energy consumption minimization problem. To solve this nonconvex optimization problem, we rewrite the original problem by introducing relaxation variables and constructing equivalence constraints to obtain a new relaxation convex problem, which can be solved iteratively using the successive convex approximation (SCA) method. However, SCA is susceptible to initial values, especially in dynamic environments where fixed initial values may lead to a wide range of results, making it difficult to obtain a truly optimal solution to the optimization problem. To solve the initial value problem in dynamic environments, we further propose a communication-flight-corridor(CFC)-based initial path generation method to improve the reliability and convergence speed of the SCA method by constructing reliable communication regions and resilient secure paths in real time. Finally, simulation results validate the performance of the proposed algorithm compared to the benchmark algorithms under different parameter configurations.
  • Editor: Basel: MDPI AG
  • Idioma: Inglês
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.