Hierarchical Path Planner Using Workspace Decomposition and Parallel Task-Space RRTs

George Mesesan, Máximo A. Roa, Esra Icer, Matthias Althoff

Abstract

This paper presents a hierarchical path planner consisting of two stages: a global planner that uses workspace information to create collision-free paths for the robot end-effector to follow, and multiple local planners running in parallel that verify the paths in the configuration space by expanding a task-space rapidly-exploring random tree (RRT). We demonstrate the practicality of our approach by comparing it with state-of-the-art planners in several challenging path planning problems. While using a single tree, our planner outperforms other single tree approaches in task-space or configuration space (C-space), while its performance and robustness are comparable to or better than that of parallelized bidirectional C-space planners.
BibTeX
@inproceedings{mesesan2018hierarchical,
  author = {George Mesesan and Máximo A. Roa and Esra Icer and Matthias Althoff},
  title = {{Hierarchical Path Planner Using Workspace Decomposition and Parallel Task-Space RRTs}},
  booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems},
  year = {2018},
  doi = {10.1109/iros.2018.8593870},
}

Loading related content...

Figure