CHEAP PATHS FOR NONHOLONOMIC MOTION PLANNING

In this paper an algorithm of computing a locally optimal nonholonomic path is presented. The algorithm exploits local dynamic programming method applied iteratively. Tests of the algorithm were carried out on the model of the unicycle robot.