Related papers: Markov-Dubins Path via Optimal Control Theory
A realistic generalization of the Markov--Dubins problem, which is concerned with finding the shortest planar curve of constrained curvature joining two points with prescribed tangents, is the requirement that the curve passes through a…
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…
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…
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.…
This paper is concerned with determining the shortest path for a pursuer aiming to intercept a moving target travelling at a constant speed. To address this challenge, we introduce an efficient mathematical model outlined as an optimal…
This paper presents the reachability analysis of curves in $\mathbb{R}^3$ with a prescribed curvature bound. Based on Pontryagin Maximum Principle, we leverage the existing knowledge on the structure of solutions to minimum-time problems,…
In this article, a variation of the classical Markov-Dubins problem is considered, which deals with curvature-constrained least-cost paths in a plane with prescribed initial and final configurations, different bounds for the sinistral and…
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…
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…
The Dubins path problem had enormous applications in path planning for autonomous vehicles. In this paper, we consider a generalization of the Dubins path planning problem, which is to find a shortest Dubins path that starts from a given…
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…
We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…
This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and an iterative method for doing so in 3D space. Such a network will be…
In this paper, we present strategies for designing curvature-bounded trajectories of any desired length between any two given oriented points. The proposed trajectory is constructed by the concatenation of three circular arcs of varying…
Consider two elements in the tangent bundle of the Euclidean plane $(x,X),(y,Y)\in T{\mathbb R}^2$. In this work we address the problem of characterizing the paths of bounded curvature and minimal length starting at $x$, finishing at $y$…
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…
In this paper, a model of a pair of Dubins vehicles is considered. The vehicles move from an initial position and orientation to final position and orientation. A long the motion, the two vehicles are not allowed to collide however the two…
We propose a combination of a bounding procedure and gradient descent method for solving the Dubins traveling salesman problem, that is, the problem of finding a shortest curvature-constrained tour through a finite number of points in the…
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…
We consider the problem of finding curves of minimum pointwise-maximum curvature, i.e., curves of minimax curvature, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We reformulate the problem in…