A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths

DOI10.1007/978-3-540-92182-0_56zbMath1183.68741OpenAlexW2131651363MaRDI QIDQ3596757

Jonathan Backer, David G. Kirkpatrick

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_56

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

Time-optimal of fixed wing UAV aircraft with input and output constraints ⋮ Reachability by paths of bounded curvature in a convex polygon ⋮ The cost of bounded curvature

This page was built for publication: A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths