This article addresses an important path planning problem for robots and Unmanned Aerial
Vehicles (UAVs), which is to find the shortest path of bounded curvature passing through a …

This article addresses an important path planning problem for robots and Unmanned Aerial
Vehicles (UAVs) which aims to find a shortest path of bounded curvature passing through a …

Abstract The Generalized Dubins Interval Problem (GDIP) stands to determine the minimal
length path connecting two disk-shaped regions where the departure and terminal headings …

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 …

Given two points in a plane, each with a prescribed direction of motion in it, the question
being asked is to find the shortest smooth path of bounded curvature that joins them. The …

The Dubins path planning problem has enormous applications in path planning for
autonomous vehicles. In this paper, we consider a generalization of the Dubins path …

We present a path planning problem for a pursuing unmanned aerial vehicle (UAV) to
intercept a target traveling on a circle. The target is cooperative, and its position, heading …

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 …

The paper characterizes the shortest bounded-curvature paths from an initial configuration
(a location and a heading orientation), via the boundary of an intermediate circle, to a target …

Finding the shortest path from source to target is key to efficient search missions of
unmanned aerial vehicles (UAVs). For fixed wing UAVs, Dubins curves can be used to find …