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...
Main Authors: | Gammell, JD, Barfoot, TD, Srinivasa, SS |
---|---|
格式: | Journal article |
语言: | English |
出版: |
SAGE Publications
2020
|
相似书籍
-
Informed sampling for asymptotically optimal path planning
由: Gammell, J, et al.
出版: (2018) -
Adaptively Informed Trees (AIT*): fast asymptotically optimal path planning through adaptive heuristics
由: Strub, MP, et al.
出版: (2020) -
Task and motion informed trees (TMIT*): Almost-surely asymptotically optimal integrated task and motion planning
由: Thomason, W, et al.
出版: (2022) -
Anytime information theory
由: Sahai, Anant
出版: (2005) -
Library information anytime anywhere
由: Tony, Ferguson
出版: (2004)