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
|
Схожие документы
-
Informed sampling for asymptotically optimal path planning
по: Gammell, J, и др.
Опубликовано: (2018) -
Adaptively Informed Trees (AIT*): fast asymptotically optimal path planning through adaptive heuristics
по: Strub, MP, и др.
Опубликовано: (2020) -
Task and motion informed trees (TMIT*): Almost-surely asymptotically optimal integrated task and motion planning
по: Thomason, W, и др.
Опубликовано: (2022) -
Anytime information theory
по: Sahai, Anant
Опубликовано: (2005) -
Library information anytime anywhere
по: Tony, Ferguson
Опубликовано: (2004)