Author:
Maciej Kalisiak, Dept. of Computer Science, University of Toronto
Michiel van de Panne, Dept. of Computer Science, University of British Columbia
Paper from Proceedings of the 2006 IEEE International Conference on Robotics and Automation
Abstract:
This paper proposes a new variation of the RRT planner which demonstrates good performance on both looselyconstrained and highly-constrained environments. The key to the planner is an implicit flood-fill-like mechanism, a technique that is well suited to escaping local minima in highly constrained problems. We show sample results for a variety of problems and environments, and discuss future improvements.
Check out our FTP server for a local copy of the paper.
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.