Curvature-Constrained Shortest Paths in a Convex Polygon

DOI10.1137/S0097539700374550zbMath1008.68143OpenAlexW1992049804MaRDI QIDQ4785623

Steve Robbins, Sylvain Lazard, Pankaj K. Agarwal, Subhash Suri, S. H. Whitesides, Therese C. Biedl

Publication date: 5 January 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539700374550

zbMATH Keywords

mobile robotshortest pathscomputational geometrycurvature constraintnonholonomic motion planningDubins pathbounded radius of curvature

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

How to cut corners and get bounded convex curvature ⋮ Reachability by paths of bounded curvature in a convex polygon ⋮ The cost of bounded curvature ⋮ Disks in Curves of Bounded Convex Curvature ⋮ Census of bounded curvature paths ⋮ Time-optimal Dubins trajectory for moving obstacle avoidance ⋮ Locking constraints for elastic rods and a curvature bound for spatial curves

This page was built for publication: Curvature-Constrained Shortest Paths in a Convex Polygon