Publication:4499928
From MaRDI portal
zbMath0966.70005MaRDI QIDQ4499928
Publication date: 16 August 2001
obstacles; polynomial-size circuits; \(NP\)-hard problem; polygons with \(N\) vertices; two-dimensional curvature-constrained shortest-path problem
70B15: Kinematics of mechanisms and robots
Related Items
Reachability by paths of bounded curvature in a convex polygon, Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles, The cost of bounded curvature, Census of bounded curvature paths, Disks in Curves of Bounded Convex Curvature