mlsanityData to 7 Oct 2026

Multi-UAV Speed Control with Collision Avoidance and Handover-aware Cell Association: DRL with Action Branching

arXiv 2307.13158 ↗First posted 24 Jul 2023cs.LG cs.RO cs.SYcited by 5

Not on the map. Why?

Abstract (arXiv)

This paper presents a deep reinforcement learning solution for optimizing multi-UAV cell-association decisions and their moving velocity on a 3D aerial highway. The objective is to enhance transportation and communication performance, including collision avoidance, connectivity, and handovers. The problem is formulated as a Markov decision process (MDP) with UAVs' states defined by velocities and communication data rates. We propose a neural architecture with a shared decision module and multiple network branches, each dedicated to a specific action dimension in a 2D transportation-communication space. This design efficiently handles the multi-dimensional action space, allowing independence for individual action dimensions. We introduce two models, Branching Dueling Q-Network (BDQ) and Branching Dueling Double Deep Q-Network (Dueling DDQN), to demonstrate the approach. Simulation results show a significant improvement of 18.32% compared to existing benchmarks.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 5 of its 12 references that are in the map. First posted on arXiv 24 Jul 2023.

Builds on

5 of 12 references.

References · 5

  1. 2017Action Branching Architectures for Deep Reinforcement Learningcited by 90
  2. 2022Reinforcement Learning for Joint V2I Network Selection and Autonomous Driving Policiescited by 7
  3. 2019Efficient Drone Mobility Support Using Reinforcement Learningcited by 6
  4. 2021Disconnectivity-Aware Energy-Efficient Cargo-UAV Trajectory Planning with Minimum Handoffscited by 4
  5. 2023Optimization of Speed and Network Deployment for Reliable V2I Communication in the Presence of Handoffs and Interferencecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 2.

5 papers.