Incremental Grid Sampling Strategies in Robotics

Stephen R. Lindemann, Anna Yershova, Steven M. LaValle

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We present algorithms for generating deterministic sample sequences using incremental grid-based sampling. Our algorithms are designed to generate dense sample sequences over spaces common in robotics, such as the unit cube, SO(3), and SE(3). Our sampling techniques provide the advantageous properties of uniformity, lattice structure, and incremental quality. In addition, the inherent structure of grid-based sequences not only enables them to be used in the place of other sampling techniques in existing algorithms, but also permits the development of new algorithms aimed at exploiting this structure.

Original languageEnglish (US)
Title of host publicationAlgorithmic Foundations of Robotics VI
EditorsMichael Erdmann, Mark Overmars, A. Frank van der Stappen, Hsu Hsu
Pages313-328
Number of pages16
StatePublished - Dec 1 2005

Publication series

NameSpringer Tracts in Advanced Robotics
Volume17
ISSN (Print)1610-7438
ISSN (Electronic)1610-742X

Fingerprint

Robotics
Sampling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Lindemann, S. R., Yershova, A., & LaValle, S. M. (2005). Incremental Grid Sampling Strategies in Robotics. In M. Erdmann, M. Overmars, A. F. van der Stappen, & H. Hsu (Eds.), Algorithmic Foundations of Robotics VI (pp. 313-328). (Springer Tracts in Advanced Robotics; Vol. 17).

Incremental Grid Sampling Strategies in Robotics. / Lindemann, Stephen R.; Yershova, Anna; LaValle, Steven M.

Algorithmic Foundations of Robotics VI. ed. / Michael Erdmann; Mark Overmars; A. Frank van der Stappen; Hsu Hsu. 2005. p. 313-328 (Springer Tracts in Advanced Robotics; Vol. 17).

Research output: Chapter in Book/Report/Conference proceedingChapter

Lindemann, SR, Yershova, A & LaValle, SM 2005, Incremental Grid Sampling Strategies in Robotics. in M Erdmann, M Overmars, AF van der Stappen & H Hsu (eds), Algorithmic Foundations of Robotics VI. Springer Tracts in Advanced Robotics, vol. 17, pp. 313-328.
Lindemann SR, Yershova A, LaValle SM. Incremental Grid Sampling Strategies in Robotics. In Erdmann M, Overmars M, van der Stappen AF, Hsu H, editors, Algorithmic Foundations of Robotics VI. 2005. p. 313-328. (Springer Tracts in Advanced Robotics).
Lindemann, Stephen R. ; Yershova, Anna ; LaValle, Steven M. / Incremental Grid Sampling Strategies in Robotics. Algorithmic Foundations of Robotics VI. editor / Michael Erdmann ; Mark Overmars ; A. Frank van der Stappen ; Hsu Hsu. 2005. pp. 313-328 (Springer Tracts in Advanced Robotics).
@inbook{13e838bc20824995ac89cf0eed7884c6,
title = "Incremental Grid Sampling Strategies in Robotics",
abstract = "We present algorithms for generating deterministic sample sequences using incremental grid-based sampling. Our algorithms are designed to generate dense sample sequences over spaces common in robotics, such as the unit cube, SO(3), and SE(3). Our sampling techniques provide the advantageous properties of uniformity, lattice structure, and incremental quality. In addition, the inherent structure of grid-based sequences not only enables them to be used in the place of other sampling techniques in existing algorithms, but also permits the development of new algorithms aimed at exploiting this structure.",
author = "Lindemann, {Stephen R.} and Anna Yershova and LaValle, {Steven M.}",
year = "2005",
month = "12",
day = "1",
language = "English (US)",
isbn = "9783540257288",
series = "Springer Tracts in Advanced Robotics",
pages = "313--328",
editor = "Michael Erdmann and Mark Overmars and {van der Stappen}, {A. Frank} and Hsu Hsu",
booktitle = "Algorithmic Foundations of Robotics VI",

}

TY - CHAP

T1 - Incremental Grid Sampling Strategies in Robotics

AU - Lindemann, Stephen R.

AU - Yershova, Anna

AU - LaValle, Steven M.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - We present algorithms for generating deterministic sample sequences using incremental grid-based sampling. Our algorithms are designed to generate dense sample sequences over spaces common in robotics, such as the unit cube, SO(3), and SE(3). Our sampling techniques provide the advantageous properties of uniformity, lattice structure, and incremental quality. In addition, the inherent structure of grid-based sequences not only enables them to be used in the place of other sampling techniques in existing algorithms, but also permits the development of new algorithms aimed at exploiting this structure.

AB - We present algorithms for generating deterministic sample sequences using incremental grid-based sampling. Our algorithms are designed to generate dense sample sequences over spaces common in robotics, such as the unit cube, SO(3), and SE(3). Our sampling techniques provide the advantageous properties of uniformity, lattice structure, and incremental quality. In addition, the inherent structure of grid-based sequences not only enables them to be used in the place of other sampling techniques in existing algorithms, but also permits the development of new algorithms aimed at exploiting this structure.

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

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

M3 - Chapter

AN - SCOPUS:84864444695

SN - 9783540257288

T3 - Springer Tracts in Advanced Robotics

SP - 313

EP - 328

BT - Algorithmic Foundations of Robotics VI

A2 - Erdmann, Michael

A2 - Overmars, Mark

A2 - van der Stappen, A. Frank

A2 - Hsu, Hsu

ER -