Sampling C-obstacles border using a filtered deterministic sequence
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/2256
Tipus de documentReport de recerca
Data publicació2008-09
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 2.5 Espanya
Abstract
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.
Altres identificadorsIOC-DT-P-2008-10
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
IOC-DT-P-2008-10.pdf | 1,129Mb | Visualitza/Obre |