HAS-RRT: RRT-based Motion Planning using Topological Guidance
Abstract: We present a hierarchical RRT-based motion planning strategy, Hierarchical Annotated-Skeleton Guided RRT (HAS-RRT), guided by a workspace skeleton, to solve motion planning problems. HAS-RRT provides up to a 91% runtime reduction and builds a tree at least 30% smaller than competitors while still finding competitive-cost paths. This is because our strategy prioritizes paths indicated by the workspace guidance to efficiently find a valid motion plan for the robot. Existing methods either rely too heavily on workspace guidance or have difficulty finding narrow passages. By taking advantage of the assumptions that the workspace skeleton provides, HAS-RRT is able to build a smaller tree and find a path faster than its competitors. Additionally, we show that HAS-RRT is robust to the quality of workspace guidance provided and that, in a worst-case scenario where the workspace skeleton provides no additional insight, our method performs comparably to an unguided method.
- B. Englot and F. S. Hover, “Sampling-based coverage path planning for inspection of complex structures,” in Proc. Int. Conf. Automated Planning and Scheduling, 2012.
- D. Brutlag, M. Apaydin, C. Guestrin, D. Hsu, C. Varma, A. Singh, and J.-C. Latombe, “Using robotics to fold proteins and dock ligands.” in Bioinformatics, 2002, p. 18:S74.S83.
- J. H. Reif, “Complexity of the mover’s problem and generalizations,” in Proc. IEEE Symp. Found. Comp. Sci. (FOCS), San Juan, Puerto Rico, Oct. 1979, pp. 421–427.
- S. M. LaValle and J. J. Kuffner, “Rapidly-exploring random trees: Progress and prospects,” in New Directions in Algorithmic and Computational Robotics. A. K. Peters, 2001, pp. 293–308, (WAFR 2000).
- J. Denny, R. Sandström, A. Bregger, and N. M. Amato, “Dynamic region-biased exploring random trees,” in Alg. Found. Robot. XII. Springer, 2020, (WAFR ‘16).
- M. Rickert, O. Brock, and A. Knoll, “Balancing exploration and exploitation in motion planning,” in 2008 IEEE International Conference on Robotics and Automation, 2008, pp. 2812–2817.
- L. E. Kavraki, P. Švestka, J. C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Trans. Robot. Automat., vol. 12, no. 4, pp. 566–580, Aug. 1996.
- H. Kurniawati and D. Hsu, “Workspace importance sampling for probabilistic roadmap planning,” in Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), vol. 2, Sept. 2004, pp. 1618–1623.
- J. Berg and M. Overmars, “Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners,” in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 2004, pp. 453–460.
- H. Kurniawati and D. Hsu, “Workspace-based connectivity oracle - an adaptive sampling strategy for prm planning,” in Alg. Found. Robot. VII. Springer, 2008, pp. 35–51, (WAFR ‘06).
- E. Plaku, L. Kavraki, and M. Vardi, “Motion planning with dynamics by a synergistic combination of layers of planning,” IEEE Trans. Robot., vol. 26, no. 3, pp. 469–482, June 2010.
- S. Bhattacharya, M. Likhachev, and V. Kumar, “Topological constraints in search-based robot path planning,” Autonomous Robots, vol. 33, no. 3, 2012.
- H. Doraiswamy and V. Natarajan, “Efficient algorithms for computing reeb graphs,” Comput. Geom. Theory Appl., vol. 42, no. 6-7, pp. 606–616, Aug. 2009. [Online]. Available: http://dx.doi.org/10.1016/j.comgeo.2008.12.003
- “PPL, Parasol Planning Library,” https://gitlab.engr.illinois.edu/parasol-group/parasol/open-ppl.
- E. Larsen, S. Gottschalk, M. Lin, and D. Manocha, “Fast proximity queries with swept sphere volumes,” University of N. Carolina, Chapel Hill, CA, Technical Report TR99-018, 1999.
- “The Protein Data Bank,” http://www.rcsb.org/pdb/.
- E. F. Pettersen, T. D. Goddard, C. C. Huang, G. S. Couch, D. M. Greenblatt, E. C. Meng, and T. E. Ferrin, “Ucsf chimera: A visualization system for exploratory research and analysis,” Journal of Computational Chemistry, vol. 25, no. 13, pp. 1605–16 012, 2004.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.