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)