Approximation of curvature-constrained shortest paths through a sequence of points
From MaRDI portal
Recommendations
- Bounded-curvature shortest paths through a sequence of points using convex optimization
- Approximation algorithms for curvature-constrained shortest paths
- scientific article; zbMATH DE number 871939
- A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
- Curvature-Constrained Shortest Paths in a Convex Polygon
- A geometric approach to shortest bounded curvature paths
- Unconstrained and curvature-constrained shortest-path distances and their approximation
- Shortest paths of bounded curvature in the plane
- scientific article; zbMATH DE number 1501051
- Approximating shortest paths on a nonconvex polyhedron
Cited in
(13)- Method to approximate the space curve of least energy and prescribed length
- A geometric approach to shortest bounded curvature paths
- Shortest paths of bounded curvature in the plane
- The cost of bounded curvature
- Shortest Dubins paths through three points
- Unconstrained and curvature-constrained shortest-path distances and their approximation
- Approximation algorithms for curvature-constrained shortest paths
- Bounded-curvature shortest paths through a sequence of points using convex optimization
- Reachability by paths of bounded curvature in a convex polygon
- scientific article; zbMATH DE number 871939 (Why is no real title available?)
- Hierarchical trajectory optimization for a class of hybrid dynamical systems
- How to cut corners and get bounded convex curvature
- Three-dimensional reachable set for the Dubins car: foundation of analytical description
This page was built for publication: Approximation of curvature-constrained shortest paths through a sequence of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753947)