An improved RRT algorithm incorporating obstacle boundary information

Rapidly-Exploring Random Trees (RRT) is a sampling-based path planning method, which aims at finding the feasible path using a randomized data structure. But RRT usually can not find the optimal path. Although RRT* is an asymptotically optimal algorithm, its planning time scales poorly. In this paper, we propose an improved RRT algorithm incorporating obstacle boundary information to deal with these two problems. We classify obstacles in the environment into valuable and valueless obstacles. For the obstacle placed between the start and goal positions, it is regarded as valuable and we use its boundary information to make the path planner sample points around it to avoid other bad sampling points. Then the random tree will grow more intentionally to the goal position. By applying Partially Observed Markov Decision Process (POMDP) in our algorithm, we also can prove in theory that obstacle boundary information really improves RRT algorithm. In our experiments, we show that our algorithm can find a better feasible path faster than RRT.

[1]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

[2]  Young J. Kim,et al.  GPU-based motion planning under uncertainties using POMDP , 2013, 2013 IEEE International Conference on Robotics and Automation.

[3]  Chau Ton,et al.  Human-Assisted RRT for Path Planning in Urban Environments , 2015, 2015 IEEE International Conference on Systems, Man, and Cybernetics.

[4]  Jan Rosell,et al.  HG-RRT*: Human-guided optimal random trees for motion planning , 2015, 2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA).

[5]  Min Chen,et al.  POMDP-lite for robust robot planning under uncertainty , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[6]  Kai Oliver Arras,et al.  Distance metric learning for RRT-based motion planning with constant-time inference , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[7]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[8]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[9]  Tod S. Levitt,et al.  Qualitative Navigation for Mobile Robots , 1990, Artif. Intell..

[10]  Kai Oliver Arras,et al.  RRT-based nonholonomic motion planning using any-angle path biasing , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[11]  Michael A. Goodrich,et al.  Homotopy-aware RRT*: Toward human-robot topological path-planning , 2016, 2016 11th ACM/IEEE International Conference on Human-Robot Interaction (HRI).

[12]  Marc Toussaint,et al.  POMDP manipulation via trajectory optimization , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[13]  P. Pharpatara,et al.  3-D Trajectory Planning of Aerial Vehicles Using RRT* , 2017, IEEE Transactions on Control Systems Technology.

[14]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .