Deterministic sampling methods for spheres and SO(3)

Anna Yershova, Steven M. LaValle

Research output: Contribution to journalConference article

Abstract

This paper addresses the problem of generating uniform deterministic samples over the spheres and the three-dimensional rotation group, SO(3). The target applications include motion planning, optimization, and verification problems in robotics and in related areas, such as graphics, control theory and computational biology. We introduce an infinite sequence of samples that is shown to achieve: 1) low-dispersion, which aids in the development of resolution complete algorithms, 2) lattice structure, which allows easy neighbor identification that is comparable to what is obtained for a grid in ℝd, and 3) incremental quality, which is similar to that obtained by random sampling. The sequence is demonstrated in a sampling-based motion planning algorithm.

Original languageEnglish (US)
Pages (from-to)3974-3980
Number of pages7
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume2004
Issue number4
StatePublished - Jul 5 2004
EventProceedings- 2004 IEEE International Conference on Robotics and Automation - New Orleans, LA, United States
Duration: Apr 26 2004May 1 2004

Fingerprint

Motion planning
Sampling
Control theory
Robotics

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

Deterministic sampling methods for spheres and SO(3). / Yershova, Anna; LaValle, Steven M.

In: Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2004, No. 4, 05.07.2004, p. 3974-3980.

Research output: Contribution to journalConference article

@article{4ebcc41d2eef4f9f9b106ae116ec33a6,
title = "Deterministic sampling methods for spheres and SO(3)",
abstract = "This paper addresses the problem of generating uniform deterministic samples over the spheres and the three-dimensional rotation group, SO(3). The target applications include motion planning, optimization, and verification problems in robotics and in related areas, such as graphics, control theory and computational biology. We introduce an infinite sequence of samples that is shown to achieve: 1) low-dispersion, which aids in the development of resolution complete algorithms, 2) lattice structure, which allows easy neighbor identification that is comparable to what is obtained for a grid in ℝd, and 3) incremental quality, which is similar to that obtained by random sampling. The sequence is demonstrated in a sampling-based motion planning algorithm.",
author = "Anna Yershova and LaValle, {Steven M.}",
year = "2004",
month = "7",
day = "5",
language = "English (US)",
volume = "2004",
pages = "3974--3980",
journal = "Proceedings - IEEE International Conference on Robotics and Automation",
issn = "1050-4729",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Deterministic sampling methods for spheres and SO(3)

AU - Yershova, Anna

AU - LaValle, Steven M.

PY - 2004/7/5

Y1 - 2004/7/5

N2 - This paper addresses the problem of generating uniform deterministic samples over the spheres and the three-dimensional rotation group, SO(3). The target applications include motion planning, optimization, and verification problems in robotics and in related areas, such as graphics, control theory and computational biology. We introduce an infinite sequence of samples that is shown to achieve: 1) low-dispersion, which aids in the development of resolution complete algorithms, 2) lattice structure, which allows easy neighbor identification that is comparable to what is obtained for a grid in ℝd, and 3) incremental quality, which is similar to that obtained by random sampling. The sequence is demonstrated in a sampling-based motion planning algorithm.

AB - This paper addresses the problem of generating uniform deterministic samples over the spheres and the three-dimensional rotation group, SO(3). The target applications include motion planning, optimization, and verification problems in robotics and in related areas, such as graphics, control theory and computational biology. We introduce an infinite sequence of samples that is shown to achieve: 1) low-dispersion, which aids in the development of resolution complete algorithms, 2) lattice structure, which allows easy neighbor identification that is comparable to what is obtained for a grid in ℝd, and 3) incremental quality, which is similar to that obtained by random sampling. The sequence is demonstrated in a sampling-based motion planning algorithm.

UR - http://www.scopus.com/inward/record.url?scp=3042672034&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042672034&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:3042672034

VL - 2004

SP - 3974

EP - 3980

JO - Proceedings - IEEE International Conference on Robotics and Automation

JF - Proceedings - IEEE International Conference on Robotics and Automation

SN - 1050-4729

IS - 4

ER -