Abstract
This paper describes a novel technique to reduce planning time and memory using precomputed search trees with steering sets. One property of precomputed search trees is that collision checking is not greatly required during growing the nodes. Precomputed search tree is one of the idea of reducing planning time however it's a time-memory trade off. We present a new path planning with precomputed search tree using pruning based on a rule of memory constant.
