Fast-BIT∗: Modified heuristic for sampling-based optimal planning with a faster first solution and convergence in implicit random geometric graphs

Alexander C. Holston, Deok-Hwa Kim, Jong-Hwan Kim. Fast-BIT∗: Modified heuristic for sampling-based optimal planning with a faster first solution and convergence in implicit random geometric graphs. In 2017 IEEE International Conference on Robotics and Biomimetics, ROBIO 2017, Macau, Macao, December 5-8, 2017. pages 1892-1899, IEEE, 2017. [doi]

Abstract

Abstract is missing.