| Document Date: 2012-12-20 19:29:35
Open Document File Size: 4,02 MBShare Result on Facebook
City Shanghai / Sampling / / Company MIT Press / / Country China / Singapore / / Facility Laboratory of Information / Massachusetts Institute of Technology / Harvard University / / IndustryTerm path-merging algorithm / autonomous car-like robot / motion planning algorithms / manner using such algorithms / real-time implementations / feasible solution / online settings / final solution / dedicated parallel computing hardware / computing / expert race car drivers / asymptotically-optimal incremental sampling-based algorithms / Real-time motion / incremental sampling-based algorithms / dynamical systems / feasible solutions / real-time planning scenario / / Organization Harvard University / Laboratory of Information and Decision Systems / Massachusetts Institute of Technology / / Position S. Teller / / ProvinceOrState Massachusetts / / Technology sampling-based algorithms / RRG algorithm / sampling-based motion planning algorithms / RRT∗ algorithm / RRT algorithms / incremental sampling-based algorithms / path-merging algorithm / motion planning algorithms / RRT algorithm / two algorithms / /
SocialTag |
Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula