The cost of bounded curvature
From MaRDI portal
Publication:1947977
DOI10.1016/j.comgeo.2012.10.008zbMath1317.51017MaRDI QIDQ1947977
Hyo-Sil Kim, Otfried Schwarzkopf
Publication date: 29 April 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.10.008
51M10: Hyperbolic and elliptic geometries (general) and generalizations
93C85: Automated systems (robots, etc.) in control theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
- Planning constrained motion
- Shortest paths of bounded curvature in the plane
- Approximation Algorithms for Curvature-Constrained Shortest Paths
- Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization
- 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
- 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
- Curvature-bounded traversals of narrow corridors
- Planning Algorithms