Finding curvature-constrained paths that avoid polygonal obstacles

DOI10.1145/1247069.1247080MaRDI QIDQ3602855zbMATH OpenOpenAlexFDO

Authors Jonathan Backer, David Kirkpatrick

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1247069.1247080

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other finite incidence structures (geometric aspects) (51E30)

Recommendations

• A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
• scientific article; zbMATH DE number 871939
• Reachability by paths of bounded curvature in a convex polygon
• Approximation algorithms for curvature-constrained shortest paths
• An algorithm for computing a convex and simple path of bounded curvature in a simple polygon

Cited in

(10)

• Curvature-bounded traversals of narrow corridors
• Census of bounded curvature paths
• Curvature-Constrained Shortest Paths in a Convex Polygon
• Generation of configuration space obstacles: The case of moving algebraic curves
• On polygonal paths with bounded discrete-curvature: the inflection-free case
• Reachability by paths of bounded curvature in a convex polygon
• On the Complexity of Universality for Partially Ordered NFAs
• The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles
• Optimal trajectories of curvature constrained motion in the Hamilton-Jacobi formulation
• A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths

This page was built for publication: Finding curvature-constrained paths that avoid polygonal obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602855)