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
格式: Journal article
出版: IEEE 2018

相似书籍