Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.08715

Stochastic Geometry-based Trajectory Design for Multi-Purpose UAVs: Package and Data Delivery

Yujie Qin·Mustafa A. Kishk·Mohamed-Slim Alouini
View original source ↗Read source document ↗Export metadata ↓

Abstract

With the advancements achieved in drones' flexibility, low cost, and high efficiency, they obtain huge application opportunities in various industries, such as aerial delivery and future communication networks. However, the increasing transportation needs and expansion of network capacity demands for UAVs will cause aerial traffic conflicts in the future. To address this issue, in this paper, we explore the idea of multi-purpose UAVs, which act as aerial wireless communication data relays and means of aerial transportation simultaneously to deliver data and packages at the same time. While UAVs deliver the packages from warehouses to residential areas, we design their trajectories which enable them to collect data from multiple Internet of Things (IoT) clusters and forward the collected data to terrestrial base stations (TBSs). To select the serving nearby IoT clusters, UAVs rank them based on their priorities and distances. From the perspectives of data and package delivery, respectively, we propose two algorithms that design the optimal UAVs trajectory to maximize the transmitted data or minimize the round trip time. Specifically, we use tools from stochastic geometry to model the locations of IoT clusters and TBSs. Given the nature of random locations, the proposed algorithm applies to general cases. Our numerical results show that multi-purpose UAVs are practical and have great potential to enhance the energy/time-efficiency of future networks.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yujie Qin, Mustafa A. Kishk, Mohamed-Slim Alouini. 2023-11-15. Stochastic Geometry-based Trajectory Design for Multi-Purpose UAVs: Package and Data Delivery. https://doi.org/10.1109/tvt.2023.3323682

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Constrained Feedback Control of Nonlinear Systems via Approximate HJB and Control Barrier Functions

This paper presents a two-stage framework for constrained feedback control of input-affine nonlinear systems. Offline, an approximate value function for the unconstrained problem is computed, for example using Hamilton--Jacobi--Bellman (HJB)-based policy iteration. Online, the proposed quadratic program (QP) minimizes the pre-Hamiltonian evaluated using the approximate value-function gradient subject to safety constraints enforced by control barrier functions (CBFs). This architecture decouples performance optimization from constraint enforcement, allowing constraints to be modified without recomputing the value function. As in CBF-QP architectures based on control Lyapunov functions (CLFs), safety is enforced as a hard constraint; however, the performance objective targets approximate optimality rather than a prescribed Lyapunov decay. Numerical results on a linear 2-state hovercraft and a nonlinear 9-state spacecraft attitude-control problem show agreement with the constrained open-loop optimal control problem (OCP) benchmark in the linear case, and performance close to the OCP benchmark, improving on CLF-based controllers, in the nonlinear case.

eess.SY↗
arXiv2026

Rao-Blackwellized Stein Gradient Descent for Joint State-Parameter Estimation

We present a filtering framework for online joint state estimation and parameter identification in nonlinear, time-varying systems. The algorithm uses a Rao-Blackwellization technique to infer joint state-parameter posteriors efficiently. In particular, conditional state distributions are computed analytically via Kalman filtering, while model parameters, including the measurement-noise covariance, are approximated using particle-based Stein Variational Gradient Descent (SVGD), enabling stable real-time inference. To handle parameters subject to physical constraints, we further introduce constrained variants that enforce them through an alternating direction method of multipliers (ADMM) splitting of the SVGD update, including nonlinear equality constraints that standard particle filters cannot readily handle. We derive a stability bound that relates the approximation error in the parameter posterior to the resulting error in the marginal state distribution. Performance of the proposed filters is validated on three case studies: a fed-batch bioreactor with Haldane kinetics and a damped pendulum, both under physical constraints, and a neural-network-augmented dynamic system. The examples cover parameter estimation under inequality and equality constraints and online neural-network training within a dynamical model.

eess.SY↗
arXiv2026

Firing Rate Neural Network Implementations of Model Predictive Control

Human and animal brains perform planning to enable complex movements and behaviors, a process that can be effectively described using model predictive control (MPC). How could the brain physically implement MPC? In this work, we translate model predictive controllers into firing rate neural networks, offering insights into the nonlinear neural dynamics that underpin planning. We propose a constructive method; no training is required. This is done first applying the projected gradient method to the dual problem to derive a baseline neural network implementation. We then use factorization and contraction analysis to systematically generate alternative network architectures; in other words, we systematically generate hypotheses for how planning is done in the brain via neural dynamics. Finally, we present numerical simulations to study different neural networks performing MPC to balance an inverted pendulum on a cart (i.e., balancing a stick on a hand), including one example in which imposing sparse connectivity (a property observed in brain networks) does not degrade control performance.

eess.SY↗