Reachability by paths of bounded curvature in a convex polygon
From MaRDI portal
Publication:425619
DOI10.1016/j.comgeo.2011.07.003zbMath1244.68076arXiv1008.4244OpenAlexW2213465260MaRDI QIDQ425619
Antoine Vigneron, Hee-Kap Ahn, Ji{ří} Matoušek, Otfried Schwarzkopf
Publication date: 8 June 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.4244
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Related Items (3)
How to cut corners and get bounded convex curvature ⋮ On the topology of the spaces of curvature constrained plane curves ⋮ Length minimising bounded curvature paths in homotopy classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- An exact algorithm for kinodynamic planning in the plane
- Finding the medial axis of a simple polygon in linear time
- Planning constrained motion
- Reconstructing curves without Delaunay computation
- Shortest paths of bounded curvature in the plane
- Optimal paths for a car that goes both forwards and backwards
- Approximation Algorithms for Curvature-Constrained Shortest Paths
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
- A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
- Kinodynamic motion planning
- Motion planning in the presence of moving obstacles
- Curvature-Constrained Shortest Paths in a Convex Polygon
- A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
- Traveling Salesperson Problems for the Dubins Vehicle
This page was built for publication: Reachability by paths of bounded curvature in a convex polygon
