Quantum-Driven State-Reduction for Reliable UAV Trajectory Optimization in Low-Altitude Networks
Zeeshan Kaleem, Muhammad Afaq, Chau Yuen, Octavia A. Dobre, John M. Cioffi
TL;DR
The paper tackles reliable UAV trajectory optimization in dense, interference-prone, low-altitude networks. It introduces GC-QAP, a quantum-inspired graph condensation method that reduces the waypoint state space to a radio-aware set $\mathcal{C}$, preserving interference structure, and embeds this in an outage-aware Markov decision process solved via independent Q-learning on the condensed graph. Key contributions include a QA-based condensation objective $L(\mathbf{c}_j)$ with quantum jumps and cooling, a priority-aware reward shaping for outage minimization, and empirical evidence showing significantly lower outages and faster convergence than baselines. The approach demonstrates practical, real-time viability and scalability for UAV-assisted wireless networks, with potential to leverage real quantum annealers in future work.
Abstract
This letter introduces a Graph-Condensed Quantum-Inspired Placement (GC-QAP) framework for reliability-driven trajectory optimization in Uncrewed Aerial Vehicle (UAV) assisted low-altitude wireless networks. The dense waypoint graph is condensed using probabilistic quantum-annealing to preserve interference-aware centroids while reducing the control state space and maintaining link-quality. The resulting problem is formulated as a priority-aware Markov decision process and solved using epsilon-greedy off-policy Q-learning, considering UAV kinematic and flight corridor constraints. Unlike complex continuous-action reinforcement learning approaches, GC-QAP achieves stable convergence and low outage with substantially and lower computational cost compared to baseline schemes.
