scientific article; zbMATH DE number 871939
From MaRDI portal
Publication:4875214
Recommendations
- Approximation algorithms for curvature-constrained shortest paths
- A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
- Curvature-Constrained Shortest Paths in a Convex Polygon
- scientific article; zbMATH DE number 1670669
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
Cited in
(25)- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Modeling parallel parking a car
- Approximation algorithms for geometric shortest path problems
- A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
- A geometric approach to shortest bounded curvature paths
- Curvature-Constrained Shortest Paths in a Convex Polygon
- Shortest path planning for a tethered robot
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment
- Approximation algorithms for curvature-constrained shortest paths
- Pseudo approximation algorithms with applications to optimal motion planning
- scientific article; zbMATH DE number 2015319 (Why is no real title available?)
- Unconstrained and curvature-constrained shortest-path distances and their approximation
- A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
- scientific article; zbMATH DE number 1670669 (Why is no real title available?)
- Shortest paths among transient obstacles
- Optimal trajectories of curvature constrained motion in the Hamilton-Jacobi formulation
- Pseudo approximation algorithms, with applications to optimal motion planning
- Curvature-bounded traversals of narrow corridors
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- Finding curvature-constrained paths that avoid polygonal obstacles
- An efficient algorithm for computing high-quality paths amid polygonal obstacles
- Convex tours of bounded curvature
- Approximating minimum bending energy path in a simple corridor
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875214)
