Informed sampling for asymptotically optimal path planning
Anytime almost-surely asymptotically optimal planners, such as RRT∗, incrementally find paths to every state in the search domain. This is inefficient once an initial solution is found, as then only states that can provide a better solution need to be considered. Exact knowledge of these states requ...
Main Authors: | Gammell, J, Barfoot, T, Srinivasa, S |
---|---|
Format: | Journal article |
Izdano: |
IEEE
2018
|
Podobne knjige/članki
-
Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search
od: Gammell, JD, et al.
Izdano: (2020) -
Adaptively Informed Trees (AIT*): fast asymptotically optimal path planning through adaptive heuristics
od: Strub, MP, et al.
Izdano: (2020) -
A survey of asymptotically optimal sampling-based motion planning methods
od: Gammell, JD, et al.
Izdano: (2021) -
AIT* and EIT*: asymmetric bidirectional sampling-based path planning
od: Strub, M, et al.
Izdano: (2022) -
Task and motion informed trees (TMIT*): Almost-surely asymptotically optimal integrated task and motion planning
od: Thomason, W, et al.
Izdano: (2022)