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...
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Journal article |
| Julkaistu: |
IEEE
2018
|