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...
मुख्य लेखकों: | Gammell, J, Barfoot, T, Srinivasa, S |
---|---|
स्वरूप: | Journal article |
प्रकाशित: |
IEEE
2018
|
समान संसाधन
-
Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search
द्वारा: Gammell, JD, और अन्य
प्रकाशित: (2020) -
Adaptively Informed Trees (AIT*): fast asymptotically optimal path planning through adaptive heuristics
द्वारा: Strub, MP, और अन्य
प्रकाशित: (2020) -
A survey of asymptotically optimal sampling-based motion planning methods
द्वारा: Gammell, JD, और अन्य
प्रकाशित: (2021) -
AIT* and EIT*: asymmetric bidirectional sampling-based path planning
द्वारा: Strub, M, और अन्य
प्रकाशित: (2022) -
Task and motion informed trees (TMIT*): Almost-surely asymptotically optimal integrated task and motion planning
द्वारा: Thomason, W, और अन्य
प्रकाशित: (2022)