Bounded-curvature shortest paths through a sequence of points using convex optimization
From MaRDI portal
Recommendations
- Shortest paths of bounded curvature in the plane
- Curvature-Constrained Shortest Paths in a Convex Polygon
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
- Approximation of curvature-constrained shortest paths through a sequence of points
- Approximation algorithms for curvature-constrained shortest paths
Cited in
(16)- 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
- Convex tours of bounded curvature
- On shortest Dubins path via a circular boundary
- Shortest Dubins paths through three points
- Markov-Dubins interpolating curves
- Approximation of curvature-constrained shortest paths through a sequence of points
- Discrete optimization methods to determine trajectories for Dubins' vehicles
- An efficient method to find a shortest path for a car-like robot
- Reachability by paths of bounded curvature in a convex polygon
- Construction of shortest line of restricted curvature in a non-singly-connected polygonal area
- Classification of the Dubins set
- Shortest Paths in Graphs of Convex Sets
- Constraint guided velocity field design for Riemannian surface trajectory planning
This page was built for publication: Bounded-curvature shortest paths through a sequence of points using convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840989)