Incremental low-discrepancy lattice methods for motion planning

Stephen R. Lindemann, Steven M Lavalle

Research output: Contribution to journalConference article

Abstract

We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the incremental and self-avoiding tendencies of pseudo-random sequences, ii) the lattice structure provided by multiresolution grids, and iii) low-discrepancy and low-dispersion measures of uniformity provided by quasi-random sequences. The resulting sequences can be considered as multiresolution grids in which points may be added one at a time, while satisfying the sampling qualities at each iteration. An efficient, recursive algorithm for generating the sequences is presented and implemented. Early experiments show promising performance by using the samples in search algorithms to solve motion planning problems.

Original languageEnglish (US)
Pages (from-to)2920-2927
Number of pages8
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume3
StatePublished - Dec 9 2003
Event2003 IEEE International Conference on Robotics and Automation - Taipei, Taiwan, Province of China
Duration: Sep 14 2003Sep 19 2003

Fingerprint

Motion planning
Sampling
Experiments

ASJC Scopus subject areas

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

Cite this

Incremental low-discrepancy lattice methods for motion planning. / Lindemann, Stephen R.; Lavalle, Steven M.

In: Proceedings - IEEE International Conference on Robotics and Automation, Vol. 3, 09.12.2003, p. 2920-2927.

Research output: Contribution to journalConference article

@article{31aed25dc0db4934a78cbdf649b1c39a,
title = "Incremental low-discrepancy lattice methods for motion planning",
abstract = "We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the incremental and self-avoiding tendencies of pseudo-random sequences, ii) the lattice structure provided by multiresolution grids, and iii) low-discrepancy and low-dispersion measures of uniformity provided by quasi-random sequences. The resulting sequences can be considered as multiresolution grids in which points may be added one at a time, while satisfying the sampling qualities at each iteration. An efficient, recursive algorithm for generating the sequences is presented and implemented. Early experiments show promising performance by using the samples in search algorithms to solve motion planning problems.",
author = "Lindemann, {Stephen R.} and Lavalle, {Steven M}",
year = "2003",
month = "12",
day = "9",
language = "English (US)",
volume = "3",
pages = "2920--2927",
journal = "Proceedings - IEEE International Conference on Robotics and Automation",
issn = "1050-4729",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Incremental low-discrepancy lattice methods for motion planning

AU - Lindemann, Stephen R.

AU - Lavalle, Steven M

PY - 2003/12/9

Y1 - 2003/12/9

N2 - We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the incremental and self-avoiding tendencies of pseudo-random sequences, ii) the lattice structure provided by multiresolution grids, and iii) low-discrepancy and low-dispersion measures of uniformity provided by quasi-random sequences. The resulting sequences can be considered as multiresolution grids in which points may be added one at a time, while satisfying the sampling qualities at each iteration. An efficient, recursive algorithm for generating the sequences is presented and implemented. Early experiments show promising performance by using the samples in search algorithms to solve motion planning problems.

AB - We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the incremental and self-avoiding tendencies of pseudo-random sequences, ii) the lattice structure provided by multiresolution grids, and iii) low-discrepancy and low-dispersion measures of uniformity provided by quasi-random sequences. The resulting sequences can be considered as multiresolution grids in which points may be added one at a time, while satisfying the sampling qualities at each iteration. An efficient, recursive algorithm for generating the sequences is presented and implemented. Early experiments show promising performance by using the samples in search algorithms to solve motion planning problems.

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

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

M3 - Conference article

AN - SCOPUS:0344033888

VL - 3

SP - 2920

EP - 2927

JO - Proceedings - IEEE International Conference on Robotics and Automation

JF - Proceedings - IEEE International Conference on Robotics and Automation

SN - 1050-4729

ER -