| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Curvature-Constrained Shortest Paths in a Convex Polygon
Abstract : Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let P be a convex polygon with n vertices. We study the collision-free, optimal path-planning problem for B moving between two configurations inside P (a configuration specifies both a location and a direction of travel). We present an O(n2 log n) time algorithm for determining whether a collision-free path exists for B between two given configurations. If such a path exists, the algorithm returns a shortest one. We provide a detailed classification of curvature-constrained shortest paths inside a convex polygon and prove several properties of them, which are interesting in their own right. Some of the properties are quite general and shed some light on curvature-constrained shortest paths amid obstacles.
https://hal.inria.fr/inria-00100887
Contributor : Sylvain Lazard <>
Submitted on : Tuesday, December 15, 2009 - 1:58:43 PM
Last modification on : Friday, February 26, 2021 - 3:28:03 PM
Long-term archiving on: : Monday, April 5, 2010 - 11:54:00 PM
Contributor : Sylvain Lazard <>
Submitted on : Tuesday, December 15, 2009 - 1:58:43 PM
Last modification on : Friday, February 26, 2021 - 3:28:03 PM
Long-term archiving on: : Monday, April 5, 2010 - 11:54:00 PM
File
paper.pdf
Files produced by the author(s)