Stephen R. Lindemann, Anna Yershova, Steven M. LaValle  Home/Search
Context Related
| uiuc.edu/~yershova/wafr200...paper5.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiuc.edu/~yershova/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 ... (Update)
Cited by: More
Low-Discrepancy Curves and Efficient Coverage of Space - Ramamoorthy, Rajagopal.. (2006) (Correct)
Planning Algorithms - LaValle (2004) (Correct)
Active bibliography (related documents): More All
1.3: Deterministic Sampling Methods for Spheres and SO(3) - Yershova, LaValle (2004) (Correct)
0.8: From Dynamic Programming to RRTs: Algorithmic Design of Feasible.. - LaValle (2002) (Correct)
0.4: Sampling Techniques for Probabilistic Roadmap Planners - Geraerts, Overmars (2003) (Correct)
Similar documents based on text: More All
0.2: A Randomized Kinematics-Based Approach to.. - LaValle, Finn.. (2000) (Correct)
0.2: A Framework for Planning Feedback Motion Strategies Based on a .. - Yang, LaValle (2000) (Correct)
0.2: Efficient Nearest Neighbor Searching for Motion Planning - Atramentov, LaValle (2002) (Correct)
Related documents from co-citation: More All
3: the relationship between classical grid search and probabilistic roadmaps - LaValle, Branicky - 2002
2: Spanning-tree based coverage of continuous areas by a mobile robot (context) - Gabriely, Rimon - 2001
2: Incremental lowdiscrepancy lattice methods for motion planning - Lindemann, LaValle - 2003
BibTeX entry: (Update)
S. R. Lindemann, A. Yershova, and S. M. LaValle. Incremental grid sampling strategies in robotics. In Proc. Workshop on Algorithmic Foundations of Robotics, pages 297--312, 2004. http://citeseer.ist.psu.edu/lindemann04incremental.html More
@misc{ lindemann04incremental,
author = "S. Lindemann and A. Yershova and S. LaValle",
title = "Incremental grid sampling strategies in robotics",
text = "S. R. Lindemann, A. Yershova, and S. M. LaValle. Incremental grid sampling
strategies in robotics. In Proc. Workshop on Algorithmic Foundations of
Robotics, pages 297--312, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/lindemann04incremental.html" }
Citations (may not include all citations):309 Random Number Generation and Quasi-Monte-Carlo Methods (context) - Niederreiter - 1992
241 Probabilistic roadmaps for path planning in high-dimensional.. - Kavraki, Svestka et al. - 1996
128 Animating rotation with quaternion curves (context) - Shoemake - 1985
85 Lattice Methods for Multiple Integration (context) - Sloan, Joe - 1990
24 The approximate computation of multiple integrals (context) - Korobov - 1959
22 Stratified sampling of spherical triangles - Arvo - 1995
21 the relationship between classical grid search and probabili.. - LaValle, Branicky - 2002
21 the relationship between classical grid search and probabili.. - LaValle, Branicky et al. - 2004
19 Geometric Discrepancy (context) - Matousek - 1999
15 Uber die Gleichverteilung von Zahlen mod Eins (context) - Weyl - 1916
10 Incremental low-discrepancy lattice methods for motion plann.. - Lindemann, LaValle - 2003
10 and algebraic geometry (context) - Niederreiter, Xing et al. - 1998
9 Monte-Carlo methods for solving multivariable problems (context) - Hammersley - 1960
9 ciency of certain quasi-random sequences of points in evalua.. (context) - Halton - 1960
8 Uniform random rotations (context) - Shoemake - 1992
7 Extensible lattice sequences for quasi-Monte Carlo quadratur.. - Hickernell, Hong et al. - 2000
6 Planning Algorithms - LaValle
3 Deterministic sampling methods for spheres and SO - Yershova, LaValle - 2004
3 An historical overview of lattice point sets (context) - Wang, Hickernell - 2002
3 Slice discrepancy and irregularities of distribution on sphe.. (context) - Blumlinger - 1991
3 Spherical dispersion with applications to polygonal approxim.. - Rote, Tichy - 1995
2 Translated from Russian (context) - Sukharev, of et al. - 1971
Documents on the same site (http://msl.cs.uiuc.edu/~yershova/): More
Efficient Nearest Neighbor Searching for Motion Planning - Atramentov, LaValle (2002) (Correct)
Multi-Relational Decision Tree Algorithm - Implementation and.. - Atramentov (2003) (Correct)
A Multi-Relational Decision Tree Learning Algorithm -.. - Atramentov, Leiva.. (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC