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...
Huvudupphovsmän: | Gammell, JD, Barfoot, TD, Srinivasa, SS |
---|---|
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
SAGE Publications
2020
|
Liknande verk
-
Informed sampling for asymptotically optimal path planning
av: Gammell, J, et al.
Publicerad: (2018) -
Adaptively Informed Trees (AIT*): fast asymptotically optimal path planning through adaptive heuristics
av: Strub, MP, et al.
Publicerad: (2020) -
Task and motion informed trees (TMIT*): Almost-surely asymptotically optimal integrated task and motion planning
av: Thomason, W, et al.
Publicerad: (2022) -
Anytime information theory
av: Sahai, Anant
Publicerad: (2005) -
Library information anytime anywhere
av: Tony, Ferguson
Publicerad: (2004)