Approximation Algorithms for Curvature-Constrained Shortest Paths
From MaRDI portal
Publication:2706133
DOI10.1137/S0097539796307790zbMath0980.68145OpenAlexW2042553152MaRDI QIDQ2706133
Hong-Yan Wang, Pankaj K. Agarwal
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539796307790
Analysis of algorithms (68W40) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)
Related Items (6)
A survey of motion planning algorithms from the perspective of autonomous UAV guidance ⋮ Reachability by paths of bounded curvature in a convex polygon ⋮ The cost of bounded curvature ⋮ A Model for Optimal Human Navigation with Stochastic Effects ⋮ Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles ⋮ Modeling and Optimal Control of an Octopus Tentacle
This page was built for publication: Approximation Algorithms for Curvature-Constrained Shortest Paths