A polynomial-time algorithm for computing a shortest path ofbounded curvature amidst moderate obstaclesJean -

Abstract

In this paper, we consider the problem of computing a shortest path of bounded curvature amidst obstacles in the plane. More precisely, given prescribed initial and nal conngurations (i.e. positions and orientations) and a set of obstacles in the plane, we want to compute a shortest C 1 path joining those two conngurations, avoiding the obstacles, and with… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics