Sampling C-obstacles border using a filtered deterministic sequence
This paper is focused on the sampling process for path planners based on probabilistic roadmaps. The paper first analyzes three sampling sources: the random sequence and two deterministic sequences, Halton and sd(k), and compares them in terms of dispersion, computational efficiency (including the f...
| Autores: | , |
|---|---|
| Formato: | informe técnico |
| Fecha de publicación: | 2008 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/2256 |
| Acesso em linha: | https://hdl.handle.net/2117/2256 |
| Access Level: | acceso abierto |
| Palavra-chave: | Robotics Path planning Planificación de la trayectoria Deterministic sampling Mostratge determinista Muestreo determinista Planificació de la trajectòria Robòtica Àrees temàtiques de la UPC::Informàtica::Robòtica |
| Resumo: | This paper is focused on the sampling process for path planners based on probabilistic roadmaps. The paper first analyzes three sampling sources: the random sequence and two deterministic sequences, Halton and sd(k), and compares them in terms of dispersion, computational efficiency (including the finding of nearest neighbors), and sampling probabilities. Then, based on this analysis and on the recognized success of the Gaussian sampling strategy, the paper proposes a new efficient sampling strategy based on deterministic sampling that also samples more densely near the C-obstacles. The proposal is evaluated and compared with the original Gaussian strategy in both 2D and 3D configuration spaces, giving promising results. |
|---|