経路計画arXiv:2302.11670
バッチ情報付き木探索(BIT*)
Batch Informed Trees (BIT*)
複雑な障害物空間での経路計画を高速に収束させるアルゴリズムBIT*を解説し、RRT*との比較シミュレーションを示した論文。
著者: James Swedeen, Greg Droge
分類: cs.RO
原文アブストラクト
Path planning through complex obstacle spaces is a fundamental requirement of many mobile robot applications. Recently a rapid convergence path planning algorithm, Batch Informed Trees (BIT*), was introduced. This work serves as a concise write-up and explanation of BIT*. This work includes a description of BIT* and how BIT* operates, a graphical demonstration of BIT*, and simulation results where BIT* is compared to Optimal Rapidly-exploring Random Trees (RRT*).
