We consider the motion planning problem for a point constrained to move alo
ng a smooth closed convex path of bounded curvature. The workspace of the m
oving point is bounded by a convex polygon with pn 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 curva
ture is the smallest possible. (C) 1999 Elsevier Science B.V. All rights re
served.