An algorithm for computing a convex and simple path of bounded curvature in a simple polygon

DOI10.1007/s00453-002-0950-0zbMath1001.68180OpenAlexW1519400727MaRDI QIDQ699767

Sylvain Lazard, Jean-Daniel Boissonnat, Telikepalli Kavitha, Subir Kumar Ghosh

Publication date: 25 September 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0950-0

zbMATH Keywords

collision-free path planning problempoint robot

Mathematics Subject Classification ID

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

Related Items (2)

Reachability by paths of bounded curvature in a convex polygon ⋮ The cost of bounded curvature

This page was built for publication: An algorithm for computing a convex and simple path of bounded curvature in a simple polygon