arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.05241cs.RO

TIE: Time-Informed Exploration For Robot Motion Planning

Institute for Robotics and Intelligent Machines, Georgia Institute of Technology(佐治亚理工学院机器人与智能机器研究所)

Sagar Suhas Joshi, Seth Hutchinson, Panagiotis Tsiotras

英文摘要:

Anytime sampling-based methods are an attractive technique for solving kino-dynamic motion planning problems. These algorithms scale well to higher dimensions and can efficiently handle state and control constraints. However, an intelligent exploration strategy is required to accelerate their convergence and avoid redundant computations. Using ideas from reachability analysis, this work defines a "Time-Informed Set", that focuses the search for time-optimal kino-dynamic planning after an initial solution is found. Such a Time-Informed Set (TIS) includes all trajectories that can potentially improve the current best solution and hence exploration outside this set is redundant. Benchmarking experiments show that an exploration strategy based on the TIS can accelerate the convergence of sampling-based kino-dynamic motion planners.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑