| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Convex Tours of Bounded Curvature.
Abstract : We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with n vertices. We present an O(m+n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible.
https://hal.inria.fr/inria-00413181
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Thursday, September 3, 2009 - 2:06:11 PM
Last modification on : Wednesday, August 14, 2019 - 2:10:02 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 9:22:49 PM
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Thursday, September 3, 2009 - 2:06:11 PM
Last modification on : Wednesday, August 14, 2019 - 2:10:02 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 9:22:49 PM
File
bcdry-ctbc.pdf
Files produced by the author(s)