Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search

Path planning in robotics often requires finding high-quality solutions to continuously valued and/or high-dimensional problems. These problems are challenging and most planning algorithms instead solve simplified approximations. Popular approximations include graphs and random samples, as used by i...

詳細記述

書誌詳細
主要な著者: Gammell, JD, Barfoot, TD, Srinivasa, SS
フォーマット: Journal article
言語:English
出版事項: SAGE Publications 2020

類似資料