Empirical Sampling of Path Sets for Local Area Motion Planning

Ross Alan Knepper and Matthew T. Mason
Conference Paper, International Symposium on Experimental Robotics, July, 2008

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


We consider the problem of online planning for a mobile robot among obstacles, where it is impractical to test all possible future paths. One approach is for the runtime task to test some subset of the possible paths and select a path that does not collide with obstacles while advancing the robot toward its goal. Performance depends on the choice of path set. In this paper we assume the path set is fixed and chosen offline. By randomly sampling the space of path sets we discover effective path sets?omparable or superior to the best previously suggested approaches. In addition, testing large numbers of randomly generated path sets yields some insights on the relation of robot performance to the choice of path set.

author = {Ross Alan Knepper and Matthew T. Mason},
title = {Empirical Sampling of Path Sets for Local Area Motion Planning},
booktitle = {International Symposium on Experimental Robotics},
year = {2008},
month = {July},
publisher = {IFRR},
keywords = {motion planning, nonholonomic, path, trajectory, sampling, diversity, separation},
} 2017-09-13T10:41:33-04:00