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...
Hlavní autoři: | Gammell, JD, Barfoot, TD, Srinivasa, SS |
---|---|
Médium: | Journal article |
Jazyk: | English |
Vydáno: |
SAGE Publications
2020
|
Podobné jednotky
-
Informed sampling for asymptotically optimal path planning
Autor: Gammell, J, a další
Vydáno: (2018) -
Adaptively Informed Trees (AIT*): fast asymptotically optimal path planning through adaptive heuristics
Autor: Strub, MP, a další
Vydáno: (2020) -
Task and motion informed trees (TMIT*): Almost-surely asymptotically optimal integrated task and motion planning
Autor: Thomason, W, a další
Vydáno: (2022) -
Anytime information theory
Autor: Sahai, Anant
Vydáno: (2005) -
Library information anytime anywhere
Autor: Tony, Ferguson
Vydáno: (2004)