conference paper · International Conference on Control, Automation, Robotics and Vision (ICARCV) · 2006
The Gaussian PRM Sampling for Dynamic Configuration Spaces
Cited by 15Abstract and details only
Abstract
Probabilistic roadmap planners (PRMs) are widely used in high dimensional motion planning problems. However, they are less effective in solving narrow passages because feasible configurations in a thin space can rarely be sampled by random. Although some approaches have been proposed, they are either involved in complicated geometrical computations or requiring much information of obstacles. Moreover, if the configuration spaces are dynamic instead of fixed, some solutions may be failure in some unexpected situations. In this work, we provide a novel approach to replace the randomized sampler with the Gaussian PRM sampler. For dynamic configuration spaces, we also invite a machine learning technique to dynamically classify the pre-built samplers for different spaces
Cite this paper
Lin, Y.-T. (2006). The Gaussian PRM Sampling for Dynamic Configuration Spaces. International Conference on Control, Automation, Robotics and Vision (ICARCV), 1–5. https://doi.org/10.1109/icarcv.2006.345422
Lin, Yu-Te. “The Gaussian PRM Sampling for Dynamic Configuration Spaces.” International Conference on Control, Automation, Robotics and Vision (ICARCV), 2006, pp. 1–5, https://doi.org/10.1109/icarcv.2006.345422.
Lin, Yu-Te. 2006. “The Gaussian PRM Sampling for Dynamic Configuration Spaces.” International Conference on Control, Automation, Robotics and Vision (ICARCV): 1–5. https://doi.org/10.1109/icarcv.2006.345422.
Lin, Y.-T. (2006) ‘The Gaussian PRM Sampling for Dynamic Configuration Spaces’, International Conference on Control, Automation, Robotics and Vision (ICARCV), pp. 1–5. Available at: https://doi.org/10.1109/icarcv.2006.345422.
@article{lin2006gaussian,
title = {{The Gaussian PRM Sampling for Dynamic Configuration Spaces}},
author = {Lin, Yu-Te},
journal = {International Conference on Control, Automation, Robotics and Vision (ICARCV)},
pages = {1--5},
year = {2006},
doi = {10.1109/icarcv.2006.345422}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
The Gaussian sampling strategy for probabilistic roadmap planners
V. Boor, Mark H. Overmars, A. Frank van der Stappen · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · 2003
Cited by 548
Gaussian sampling for probabilistic roadmap planners
V. Boor, Mark H. Overmars, A. Frank van der Stappen · Utrecht University Repository (Utrecht University) · 2001
Cited by 9Open access
A deterministic sampling approach to robot motion planning
Alonso Sánchez · Mexican International Conference on Computer Science · 2004
Cited by 2
Probabilistic roadmaps: An incremental sampling approach to approximate the connectivity of robot configuration spaces
Jean‐Claude Latombe · IEEE International Conference on Cognitive Informatics · 2008
Cited by 0