Abstract
Probabilistic roadmaps are commonly used in robot path planning. Most sampling-based path planners often produce poor-quality roadmaps as they focus on improving the speed of constructing roadmaps without paying much attention to the quality. Poor-quality roadmaps can cause problems such as poor-quality paths, time-consuming path searching and failures in the searching. This paper presents a K-order surrounding roadmap (KSR) path planner which constructs a roadmap in an incremental manner. The planner creates a tree while answering a query, selects the part of the tree according to quality measures and adds the part to an existing roadmap which is obtained in the same way when answering the previous queries. The KSR path planner is able to construct high-quality roadmaps in terms of good coverage, high connectivity, provision of alternative paths and small size. Comparison between the KSR path planner and Reconfigurable Random Forest (RRF), an existing incremental path planner, as well as traditional probabilistic roadmap (PRM) path planner shows that the roadmaps constructed using the KSR path planner have higher quality that those that are built by the other planners.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bohlin, R., Kavraki, L.E.: Path planning using lazy PRM. IEEE Int. Conf. Robot. Autom. 1, 521–528 (2000)
Geraerts, R., Overmars, M.H.: Creating High-quality roadmaps for motion planning in virtual environments. IEEE/RSJ Int. Conf. Intell. Robot. Syst. 4355–4361 (2006)
Isto, P.: A parallel motion planner for systems with many degrees of freedom. Int. Conf. Adv. Robot. 339–344 (2001)
Isto, P.: Constructing probabilistic roadmaps with powerful local planning and path optimization. IEEE Int. Conf. Robot. Autom. 3, 2323–2328 (2002)
Jaillet, L., Simeon, T.: Path deformation roadmaps. In: International Workshop on Algorithmic Foundations of Robotics (2006)
Kallman, M., Mataric, M.: Motion planning using dynamic roadmaps. IEEE Int. Conf. Robot. Autom. 5, 4399–4404 (2004)
Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12, 566–580 (1996)
Kamphuis, A., Mooijekind, M., Nieuwenhuisen, D., Overmars, M.H.: Automatic construction of high quality roadmaps for path planning in games. In: International Conference of Computer Games on Artifical Intelligence, Design and Education, pp. 285–292 (2004)
Kuffner, J.J., LaValle, S.M.: RRT-connect: an efficient approach to single-query path planning. IEEE Int. Conf. Robot. Autom. 2, 995–1001 (2000)
LaValle, S.M.: Rapidly-Exploring Random Trees: A New Tool for Path Planning. Technical Report 98-11, Computer Science Department, Iowa State University, October 1998 (1996)
Li, T.Y., Shie, Y.C.: An incremental learning approach to motion planning with roadmap management. IEEE Int. Conf. Robot. Autom. 4, 4311–3416 (2002)
Schmitzberger, E., Bouchet, J.L., Dufaut, M., Wolf, D., Husson, R.: Capture of homotopy classes with probabilistic roadmap. IEEE Int. Conf. Intell. Robot. Syst. 3, 2317–2322 (2002)
Simeon, T., Laumond, J.P., Nissoux, C.: Visibility based probabilistic roadmaps for motion planning. Adv. Robot. J. 14(6), 177–494 (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, Y., Li, D., Maple, C. et al. K-Order Surrounding Roadmaps Path Planner for Robot Path Planning. J Intell Robot Syst 75, 493–516 (2014). https://doi.org/10.1007/s10846-013-9861-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10846-013-9861-3