Related papers: A new mathematical model and algorithm for the opt…
In this study, we propose an algorithmic framework for solving a class of optimal control problems. This class is associated with the minimum-time interception of moving target problems, where a plant with a given state equation must…
We present a path planning problem for a pursuer to intercept a target traveling on a circle. The pursuer considered here has limited yaw rate, and therefore its path should satisfy the kinematic constraints. We assume that the distance…
This paper investigates the problem of computing a two-dimensional optimal curvature straight line (CS) shortest path for an unmanned aerial vehicle (UAV) to intercept a moving target, with both the UAV (pursuer) and target travelling at…
The task of intercepting a target moving along a rectilinear or circular trajectory by a Dubins' car is formulated as a time-optimal control problem with an arbitrary direction of the car's velocity at the interception moment. To solve this…
This paper is concerned with a Minimum-Time Intercept Problem (MTIP), for which a Dubins vehicle is guided from a position with a prescribed initial orientation angle to intercept a moving target in minimum time. Some geometric properties…
The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications…
This paper is concerned with characterizing the shortest path of a Dubins vehicle from a position with a prescribed heading angle to a target circle with the final heading tangential to the target circle. Such a shortest path is of…
This paper is concerned with the minimum-time path-planning problem for a Dubins airplane under the influence of steady wind. The path-planning problem, by transforming into the air-relative frame, is equivalent to finding the minimum-time…
This paper presents the problem of lateral interception by a Dubins car of a target that moves along an a priori known trajectory. This trajectory is given by two coordinates of a planar location and one angle of a heading orientation,…
This work develops feasible path trajectories for a coordinated strike with multiple aircraft in a constrained environment. Using direct orthogonal collocation methods, the two-point boundary value optimal control problem is transcribed…
In this paper, we address the problem of computing optimal paths through three consecutive points for the curvature-constrained forward moving Dubins vehicle. Given initial and final configurations of the Dubins vehicle, and a midpoint with…
Markov-Dubins path is the shortest planar curve joining two points with prescribed tangents, with a specified bound on its curvature. Its structure, as proved by Dubins in 1957 nearly 70 years after Markov posed the problem of finding it,…
The minimum-time path for intercepting a moving target with a prescribed impact angle is studied in the paper. The candidate paths from Pontryagin's maximum principle are analyzed, so that each candidate is related to a zero of a…
The Dubins interval problem aims to find the shortest path of bounded curvature between two targets such that the departure angle from the first target and the arrival angle at the second target are constrained to two respective intervals.…
The main contribution of this paper is a novel method for planning globally optimal trajectories for dynamical systems subject to polygonal constraints. The proposed method is a hybrid trajectory planning approach, which combines graph…
This paper is concerned with finding an optimal path for an observer, or sensor, moving at a constant speed, which is to estimate the position of a stationary target, using only bearing angle measurements. The generated path is optimal in…
A Dubins path is a shortest path with bounded curvature. The seminal result in non-holonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another…
The interception of moving targets is a widely studied issue. In this paper, we propose an algorithm of intercepting the moving target with a wheeled mobile robot in a dynamic environment. We first predict the future position of the target…
Computing shortest paths for curvature-constrained Dubins vehicles on the unit sphere is fundamental to many engineering applications, including long-range flight planning, persistent surveillance patterns, and global routing problems where…
Path planning is crucial for the efficient operation of Autonomous Mobile Robots (AMRs) in factory environments. Many existing algorithms rely on Dubins paths, which have been adapted for various applications. However, an efficient method…