English
Related papers

Related papers: A geometric approach to shortest bounded curvature…

200 papers

Choose two points in the tangent bundle of the Euclidean plane $(x,X),(y,Y)\in T{ \mathbb R}^2$. In this work we characterise the immersed length minimising paths with a prescribed bound on the curvature starting at $x$, tangent to $X$;…

Metric Geometry · Mathematics 2015-11-03 José Ayala

A bounded curvature path is a continuously differentiable piecewise $C^2$ path with bounded absolute curvature that connects two points in the tangent bundle of a surface. In this note we give necessary and sufficient conditions for two…

Metric Geometry · Mathematics 2017-08-23 José Ayala , J. Hyam Rubinstein

A bounded curvature path is a continuously differentiable piecewise $C^2$ path with a bounded absolute curvature that connects two points in the tangent bundle of a surface. In this work, we analyze the homotopy classes of bounded curvature…

Metric Geometry · Mathematics 2017-05-08 José Ayala , Hyam Rubinstein

A bounded curvature path is a continuously differentiable piece-wise $C^2$ path with bounded absolute curvature connecting two points in the tangent bundle of a surface. These paths have been widely considered in computer science and…

Metric Geometry · Mathematics 2020-05-28 Jean Díaz , José Ayala

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.…

Optimization and Control · Mathematics 2015-09-01 Satyanarayana Manyam , Sivakumar Rathinam , David Casbeer , Eloy Garcia

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…

Discrete Mathematics · Computer Science 2012-11-14 Sylvester Eriksson-Bique , David Kirkpatrick , Valentin Polishchuk

We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…

Computational Geometry · Computer Science 2018-10-26 Ery Arias-Castro , Thibaut Le Gouic

Let $S$ be a complete flat surface, such as the Euclidean plane. We obtain direct characterizations of the connected components of the space of all curves on $S$ which start and end at given points in given directions, and whose curvatures…

Geometric Topology · Mathematics 2016-02-11 Nicolau C. Saldanha , Pedro Zühlke

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,…

Optimization and Control · Mathematics 2017-11-15 C. Yalçın Kaya

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…

Optimization and Control · Mathematics 2020-04-08 Zheng Chen

It is well known that plane curves with the same endpoints are homotopic. An analogous claim for plane curves with the same endpoints and bounded curvature still remains open. In this work we find necessary and sufficient conditions for two…

Geometric Topology · Mathematics 2017-08-23 José Ayala

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…

We consider the set E of curves with positive algebraic curvature, whose extremities and tangents in their extremities are given. For each of the curves of E, we define the minimum of the radius of curvature. We first prove that there…

Metric Geometry · Mathematics 2019-07-16 Jérôme Bastien

This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by $\epsilon >0$, and in time complexity…

Computational Geometry · Computer Science 2007-05-23 Fajie Li , Reinhard Klette

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…

Optimization and Control · Mathematics 2025-12-08 C. Yalçın Kaya , Lyle Noakes , Philip Schrader

This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…

Metric Geometry · Mathematics 2007-05-23 Imre Barany , Krystyna Kuperberg , Tudor Zamfirescu

We consider the problem of a particle traveling from an initial configuration to a final configuration (given by a point in the plane along with a prescribed velocity vector) in minimum time with non-homogeneous velocity and with…

Optimization and Control · Mathematics 2014-01-13 Ricardo G. Sanfelice , Sze Zheng Yong , Emilio Frazzoli

The aim of this paper is to associate a measure for certain sets of paths in the Euclidean plane $\mathbb{R}^2$ with fixed starting and ending points. Then, working on parameterized surfaces with a specific Riemannian metric, we define and…

Differential Geometry · Mathematics 2020-05-12 Leonardo A. Cano G. , Sergio A. Carrillo

We consider the set E of curves with positive algebraic curvature, whose extremities and tangents in their extremities are given. For each of the curves of E, we define the minimum of the radius of curvature. There exists a unique curve of…

Metric Geometry · Mathematics 2021-12-07 Jérôme Bastien

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…

Systems and Control · Electrical Eng. & Systems 2024-10-08 Aditya K. Rao , Twinkle Tripathy
‹ Prev 1 2 3 10 Next ›