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...
Prif Awduron: | Gammell, JD, Barfoot, TD, Srinivasa, SS |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
SAGE Publications
2020
|
Eitemau Tebyg
-
Informed sampling for asymptotically optimal path planning
gan: Gammell, J, et al.
Cyhoeddwyd: (2018) -
Adaptively Informed Trees (AIT*): fast asymptotically optimal path planning through adaptive heuristics
gan: Strub, MP, et al.
Cyhoeddwyd: (2020) -
Task and motion informed trees (TMIT*): Almost-surely asymptotically optimal integrated task and motion planning
gan: Thomason, W, et al.
Cyhoeddwyd: (2022) -
Anytime information theory
gan: Sahai, Anant
Cyhoeddwyd: (2005) -
Library information anytime anywhere
gan: Tony, Ferguson
Cyhoeddwyd: (2004)