Loading...

Informed RRT* @ UTIAS (IROS 2014)

15,193 views

Loading...

Loading...

Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on Jul 4, 2014

UNIVERSITY OF TORONTO
Autonomous Space Robotics Lab: http://asrl.utias.utoronto.ca
YouTube Channel: http://www.youtube.com/utiasASRL

This video shows an improvement to the popular RRT* planning algorithm that focusses the search area by eliminating some regions that cannot possibly improve the solution. It turns out we use an admissible ellipsoidal search region to do this, thereby greatly speeding up the search.

This video is associated with the following IROS 2014 paper:

Gammell J D, Srinivasa S S, and Barfoot T D. "Informed RRT*: Optimal Incremental Path Planning Focused through an Admissible Ellipsoidal Heuristic". In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), to appear. Chicago, Illinois, 14-18 September 2014.

http://asrl.utias.utoronto.ca/~tdb/sb...

There is also a follow-on ICRA 2015 paper that improves on this work in an algorithm called BIT*:

Gammell J D, Srinivasa S S, and Barfoot T D. “Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of an Implicit Random Geometric Graph”. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), to appear. Seattle, Washington, 26-30 May 2015.

http://arxiv.org/abs/1405.5848

For all our planning-related videos see our Planning Playlist on our YouTube Channel:

https://www.youtube.com/watch?v=TQIoC...

Comments are disabled for this video.
When autoplay is enabled, a suggested video will automatically play next.

Up next


to add this to Watch Later

Add to

Loading playlists...