SearcharxivSearch

arXiv subjects

Gitae Park

Publications and source records attributed to Gitae Park.

3 recordsLinked to original sources

Beyond Average-Channel-Based Rate Approximations: UAV Trajectory and Scheduling Optimization With Expected Rate Consideration

This paper investigates the joint optimization of trajectory, user scheduling, and time-slot duration in unmanned aerial vehicle (UAV)-assisted wireless communication systems under minimum expected spectral efficiency (SE) constraints. Unlike most existing studies that approximate the expected SE by substituting the random channel gain with its mean value, thereby evaluating the SE at the average channel realization and overestimating the true expected SE due to Jensen's inequality, we approximate the expected SE by numerically integrating the SE over the channel distributions. Specifically, instead of relying on average-channel-based approximations, we develop a conservative yet tractable quadrature-based approximation by discretizing the associated cumulative distribution functions. The resulting finite-sum representation explicitly accounts for the probabilistic LoS structure and channel fading effects, while remaining tractable for optimization. Leveraging this lower bound, we formulate a mission completion time minimization problem subject to minimum expected-SE requirements for all ground nodes. The resulting problem is a mixed-integer nonconvex optimization, which is tackled via a penalty-based block coordinate descent framework. The proposed algorithm alternately optimizes the scheduling decisions and the UAV trajectory along with adaptive time-slot durations, and maintains feasibility with respect to the original expected-SE constraints by leveraging successive convex approximation and quadratic transform techniques. Simulation results demonstrate that the proposed method strictly satisfies the minimum expected-SE constraints and achieves a significantly shorter mission completion time than conventional average-channel-based approaches, which are shown to yield infeasible or overly conservative solutions.

eess.SY

Blockage-Aware UAV-Assisted Wireless Data Harvesting With Building Avoidance

Unmanned aerial vehicles (UAVs) offer dynamic trajectory control, enabling them to avoid obstacles and establish line-of-sight (LoS) wireless channels with ground nodes (GNs), unlike traditional ground-fixed base stations. This study addresses the joint optimization of scheduling and three-dimensional (3D) trajectory planning for UAV-assisted wireless data harvesting. The objective is to maximize the minimum uplink throughput among GNs while accounting for signal blockages and building avoidance. To achieve this, we first present mathematical models designed to avoid cuboid-shaped buildings and to determine wireless signal blockage by buildings through rigorous mathematical proof. The optimization problem is formulated as nonconvex mixed-integer nonlinear programming and solved using advanced techniques. Specifically, the problem is decomposed into convex subproblems via quadratic transform and successive convex approximation. Building avoidance and signal blockage constraints are incorporated using the separating hyperplane method and an approximated indicator function. These subproblems are then iteratively solved using the block coordinate descent algorithm. Simulation results validate the effectiveness of the proposed approach. The UAV dynamically adjusts its trajectory and scheduling policy to maintain LoS channels with GNs, significantly enhancing network throughput compared to existing schemes. Moreover, the trajectory of the UAV adheres to building avoidance constraints for its continuous trajectory, ensuring uninterrupted operation and compliance with safety requirements.

cs.IT

On Correcting Errors in Existing Mathematical Approaches for UAV Trajectory Design Considering No-Fly-Zones

Motivated by the fact that current mathematical methods for the trajectory design of an unmanned aerial vehicle (UAV) considering no-fly-zones (NFZs) cannot perfectly avoid NFZs throughout the entire continuous trajectory, this study introduces a new constraint that ensures the complete avoidance of NFZs. Moreover, we provide mathematical proof demonstrating that a UAV operating within the proposed constraints will never violate NFZs. Under the proposed constraint on NFZs, we aim to optimize the scheduling, transmit power, length of the time slot, and the trajectory of the UAV to maximize the minimum throughput among ground nodes without violating NFZs. To find the optimal UAV strategy from the non-convex optimization problem formulated here, we use various optimization techniques, in this case quadratic transform, successive convex approximation, and the block coordinate descent algorithm. Simulation results confirm that the proposed constraint prevents NFZs from being violated over the entire trajectory in any scenario. Furthermore, the proposed scheme shows significantly higher throughput than the baseline scheme using the traditional NFZ constraint by achieving a zero outage probability due to NFZ violations.

math.OC