A Path Planning Model for Intercepting a Moving Target with Finite Obstacle Avoidance
math.OC
Submitted: 2025-07-02
Updated: 2026-10-28
Comments: 36 Pages, 18 Figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: This paper investigates the problem of computing a two-dimensional curvature-constrained shortest path for an unmanned aerial vehicle (UAV) to intercept a moving target…
Terminology
Abstract
This paper investigates the problem of computing a two-dimensional curvature-constrained shortest path for an unmanned aerial vehicle (UAV) to intercept a moving target, with both the UAV (pursuer) and the target traveling at constant speeds. We formulate an optimal control problem that integrates two critical objectives: avoiding static obstacles and successfully intercepting the target. The formulation integrates curvature constraints, geometric obstacle-avoidance conditions, and time-consistent interception constraints within a constrained optimal control framework. A geometric framework is developed, along with necessary conditions for path optimality under the imposed constraints. The problem is initially examined in the presence of a single obstacle and later extended to scenarios involving a finite number of obstacles. Numerical experiments are carried out to evaluate the performance and efficiency of the proposed model using illustrative examples. Finally, we present a realistic case study using actual geographic data, including obstacle placement, target trajectory, and heading angles, to demonstrate the practical applicability and effectiveness of the proposed method in real-world scenarios.
Sources
- A geometric approach to shortest bounded curvature paths
- A new mathematical model and algorithm for the optimal path to intercept a moving target
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise