Path planning using adaptive burs of free configuration space

摘要

This paper presents an adaptive version of the path planning algorithm based on the recently proposed structure called bur of free configuration space. The original planning algorithm - rapidly exploring bur tree (RBT) is based on the multi-directional extension of tree nodes for efficient exploration of free configuration space. A suitable number of directions for extension (extension degree) was empirically determined and has been kept fixed during the algorithm run. This paper investigates the possibility to adapt the extension degree during the algorithm execution in order to further boost the efficiency of the path planner in terms of number of iterations and runtime. Validation study demonstrates that the proposed adaptive version of RBT algorithm (aRBT) outperforms the original algorithm.