To access the full text documents, please follow this link:

Sampling C-obstacles border using a filtered deterministic sequence
Rosell Gratacòs, Jan; Pérez, Alexander
Universitat Politècnica de Catalunya. Institut d'Organització i Control de Sistemes Industrials
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.
Àrees temàtiques de la UPC::Informàtica::Robòtica
Path planning
Planificación de la trayectoria
Deterministic sampling
Mostratge determinista
Muestreo determinista
Planificació de la trajectòria
Attribution-NonCommercial-NoDerivs 2.5 Spain

Show full item record

Related documents

Other documents of the same author

Rosell Gratacòs, Jan; Suárez Feijóo, Raúl; Rosales Gallegos, Carlos; Pérez, Alexander
Rosell Gratacòs, Jan; Cruz Llopis, Luis Javier de la; Pérez, Alexander; Suárez Feijóo, Raúl
Rosell Gratacòs, Jan; Suárez Feijóo, Raúl; Pérez, Alexander; Rosales Gallegos, Carlos
Rosell Gratacòs, Jan; Vázquez Hurtado, Carlos; Pérez, Alexander