Abstract
Previous works have already demonstrated that deterministic sampling can be competitive with respect to probabilistic sampling in sampling-based path planners. Nevertheless, the definition of a general sampling sequence for any d-dimensional configuration space satisfying the requirements needed for path planning is not a trivial issue. This paper makes a proposal of a simple and yet efficient deterministic sampling sequence based on the recursive use, over a multi-grid cell decomposition, of the ordering of the 2d descendant cells of any parent cell. This ordering is generated by the digital construction method using a d×d matrix T d . A general expression of this matrix (i.e. for any d) is introduced and its performance analyzed in terms of the mutual distance. The paper ends with a performance evaluation of the use of the proposed deterministic sampling sequence in different well known path planners.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Branicky, M.S., LaValle, S.M., Olson, K., Yang, L.: Quasi-randomized path planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 1481–1487 (2001)
Hsu, D., Jiang, T., Reif, J., Sun, Z.: The bridge test for sampling narrow passages with probabilistic roadmap planners. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 4420–4426 (2003)
Kavraki, L.E., Svestka, P., Latombe, J.-C., Overmars, M.K.: Probabilistic roadmaps for path planning in high - dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566–580 (1996) August
Kuffner, J.: Effective sampling and distance metrics for 3D rigid body path planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 3993–3998 (2004)
Kuffner, J.J., LaValle, S.M.: RRT-connect: an efficient approach to single-query path planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 995–1001 (2000)
LaValle, S.M., Branicky, M.S., Lindemann, S.R.: On the relationship between classical grid search and probabilistic roadmaps. Int. J. Rob. Res. 23(7–8), 673–692 (2004)
Leven, P., Hutchinson, S.: Using manipulability to bias sampling during the construction of probabilistic roadmaps. IEEE Trans. Robot. Autom. 19(6), 1020–1026 (2003)
Lindemann, S.R., Yershova, A., LaValle, S.M.: Incremental grid sampling strategies in robotics. In: Proceedings of the Sixth International Workshop on the Algorithmic Foundations of Robotics (2004)
Rosell, J., Heisse, M.: An efficient deterministic sequence for sampling-based motion planners. In: Proceedings of the IEEE International Symposium on Assembly and Task Planning (2005)
Rosell, J., Vázquez, C., Pérez, A.: C-space decomposition using deterministic sampling and distances. In: Accepted to the IEEE/RSJ International Conference on Intelligent Robots and Systems (2007)
Sanchez, G., Latombe, J.C.: A single-query bi-directional probabilistic roadmap planner with lazy collision checking. In: Proceedings of the 9th International Symposium on Robotics Research (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by the CICYT projects DPI2004-03104 and DPI2005-00112. M. Roa is supported by Alβan (European Union Programme of High Level Scholarships for Latin America) under Scholarship No. E04D039103CO.
Rights and permissions
About this article
Cite this article
Rosell, J., Roa, M., Pérez, A. et al. A General Deterministic Sequence for Sampling d-Dimensional Configuration Spaces. J Intell Robot Syst 50, 361–373 (2007). https://doi.org/10.1007/s10846-007-9170-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10846-007-9170-9