A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 871939
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Approximation algorithms for curvature-constrained shortest paths
- A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
- Finding curvature-constrained paths that avoid polygonal obstacles
Cited in
(16)- Pseudo approximation algorithms with applications to optimal motion planning
- A geometric approach to shortest bounded curvature paths
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- Shortest paths of bounded curvature in the plane
- The cost of bounded curvature
- Time-optimal of fixed wing UAV aircraft with input and output constraints
- Approximation algorithms for curvature-constrained shortest paths
- scientific article; zbMATH DE number 1670669 (Why is no real title available?)
- Finding curvature-constrained paths that avoid polygonal obstacles
- Approximating minimum bending energy path in a simple corridor
- Reachability by paths of bounded curvature in a convex polygon
- scientific article; zbMATH DE number 1501051 (Why is no real title available?)
- Nonuniform Discretization for Kinodynamic Motion Planning and its Applications
- Pseudo approximation algorithms, with applications to optimal motion planning
- A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
- scientific article; zbMATH DE number 871939 (Why is no real title available?)
This page was built for publication: A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596757)