cs.LGNov 12, 2026

PF-Exec: Large-Scale UAV Relay Load Balancing with an Anchored Potential Direction Decider and a Per-Dimension Gain-Learning Executor

Authors: Liheng Zeng, Hanzhang Jia, Yiran Li, Yi Gao, Bo Ma

Organizations: University of Sussex · Shanghai Shuyuan Information Technology Co., Ltd. · Zhejiang Gongshang University

Abstract

Relay load balancing in large-scale UAV networks requires joint decisions on association, bandwidth, power and hovering position, while the dimension grows with the number of UAVs and each UAV sees only its local state. This paper splits the decision into two layers. An anchored potential direction decider emits a closed-form target at every instant and returns its direction only. A gain-learning executor maps a local observation into a positive gain per dimension, composes gain and target, and clips the action against the physical single-step bound; the two layers form PF-Exec. The unit gain is the default start, so the executor reduces to the pure potential policy before training. The load is first-order homogeneous in bandwidth, making the bandwidth target closed form, and the position target is the demand-weighted centroid of the served users. The system uses a two-hop access and millimetre-wave backhaul link with soft association, a 3GPP UMa-AV channel with two shadowing layers, an OU-type social-force crowd and a quadrotor physical layer. Evaluation spans all fleet sizes, two crowd scenarios, independent seeds, the published baselines in their own settings and a degraded-information line. In the highest-pressure burst setting the fixed-step comparison breaks down on part of the seeds, losing fairness and mean load at once, while PF-Exec holds fairness near one. Among the ten comparison methods only the greedy heuristic survives that setting; its load variance stays far higher. Under stale global state and position noise the fairness index stays high at both largest-scale scenarios. Flight energy is nearly identical between the learned and the fixed-step executor, and three constants are fixed once across all settings. The convergence properties of both layers, from the truncated gain iteration to the perturbed tracking bound, are proved in the companion analysis.

Figures & tables

Explore similar work

Nov 12, 2026

Convergence Properties of PF-Exec: Homogeneous Structure, Anchored Closed Form, and Gain Dynamics

This paper establishes a layered mathematical char acterisation of PF-Exec, the algorithm of the companion system paper. Demand-proportional bandwidth allocation yields an exact first-order homogeneous decomposition, from which the equal-load bandwidth target and its feasibility bound follow in closed form. The logarithmic knee view preserves strict load order and shares its global optimum with the Jain fairness index, while the demand-weighted centroid minimises the position potential. The damped softmax association block possesses a fixed point on the product of simplices. The truncated one-dimensional gain iteration admits a complete characterisation, with geomet ric convergence below the critical gain, initial-value-dependent bounded oscillation at it, and a family of bounded two-state cycles above it. A global invariant error ball and an explicit tracking recursion complete the execution guarantee. A numerical audit confirms the structural identities on every measured state and quantifies the local amplification of the coupled association and resource dynamics. Together, the results explain how closed form recovery directions and bounded adaptive gains provide stable execution without requiring a global Euclidean contraction assumption.
Aug 1, 2026

Partially-Observable Transmission Control for UAV-Enabled Federated Learning in IoT Networks

Uncrewed aerial vehicle (UAV)-enabled federated learning (FL) can provide flexible, on-demand edge intelligence for large-scale IoT deployments, but operating in shared unlicensed bands makes uplink update delivery interference-coupled and unreliable. In this paper, we develop a packet-level transmission framework that captures buffer overflow, delay violations, and transmission errors, and uses the resulting packet delivery ratio (PDR) to represent partial-update reception through a packetized, Bernoulli-masked FL aggregation process. We then formulate a fairness-consensus bilevel (FCB) optimization that jointly controls (i) transmission thresholds to maximize the average PDR while reaching consensus under partial observability and (ii) transmission powers to improve the worst PDR and enforce fairness across IoT learners. To solve this problem, we propose an alternating FCB optimizer composed of a consensus-based threshold controller (CTC), which drives the IoT learners toward a PDR-efficient consensus on transmission thresholds, and a fairness-based power controller (FPC), which updates transmission powers to improve the worst PDR and ensure fairness under the resulting consensus thresholds. Numerical results on CNN-based FL tasks show that the FCB optimizer improves FL aggregation and training performance by enhancing packet-level update delivery, consistently outperforming baseline transmission policies.
Jan 29, 2026

Spatiotemporal Continual Federated Learning for Agentic Multi-UAV Edge Networks: Mitigating Catastrophic Forgetting

This paper addresses multi-objective conflicts and catastrophic forgetting in uncrewed aerial vehicle (UAV) networks across dynamic spatiotemporal environments. Conventional multi-agent reinforcement learning (MARL) algorithms suffer from severe policy degradation during sequential task transitions. We propose a spatiotemporal continual federated learning (SCFL) framework driven by the group-decoupled multi-agent proximal policy optimization (G-MAPPO) algorithm. SCFL incorporates a three-stage geometric alignment mechanism: it resolves local gradient conflicts via group-decoupled policy optimization (GDPO), mitigates spatial Non-Independent and Identically Distributed (non-IID) client drift through adaptive cosine aggregation, and suppresses inter-task interference via global temporal orthogonal projection without raw experience replay. Evaluations show that SCFL achieves superior robustness over federated baselines, maintaining spatial service reliability above 0.95 and a load balancing index of approximately 0.95 during non-stationary transitions. A longitudinal self-degradation analysis further shows that SCFL preserves historical knowledge with near-zero performance variation in spatial reliability and QoS under moderate loads from 40 to 120 users, while revealing its operating boundary under extreme congestion with 140 users due to hard projection constraints. The framework provides a scalable, communication-efficient approach for autonomous aerial network orchestration.