Incremental low-discrepancy lattice methods for motion planning

No abstract is available for this paper.

• Publication year

  2003

• Venue

  IEEE International Conference on Robotics and Automation

• Publication date

  2003-11-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ROBOT.2003.1242039
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• What is This? Downloaded from

  2004cited by this paper
• A Comparative Study of Probabilistic Roadmap Planners

  2002cited by this paper
• Quasi-randomized path planning

  2001cited by this paper
• A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking

  2001cited by this paper
• Path planning in practice; lazy evaluation on a multi-resolution grid

  2001cited by this paper
• A framework for using the workspace medial axis in PRM planners

  2000cited by this paper
• Path planning using lazy PRM

  2000cited by this paper
• Visibility-based probabilistic roadmaps for motion planning

  2000cited by this paper
• MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space

  1999cited by this paper
• The Gaussian sampling strategy for probabilistic roadmap planners

  1999cited by this paper
• On sensor-based roadmap: a framework for motion planning for a manipulator arm in unknown environments

  1998cited by this paper
• Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces

  1996cited by this paper
• A randomized roadmap method for path and manipulation planning

  1996influential reference
• Random number generation and Quasi-Monte Carlo methods

  1992influential reference
• Gross motion planning—a survey

  1992cited by this paper
• Optimal strategies of the search for an extremum

  1971cited by this paper
• On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals

  1960cited by this paper
• Über die Gleichverteilung von Zahlen mod. Eins

  1916cited by this paper

• Towards Practical Finite Sample Bounds for Motion Planning in TAMP

  2024cites this paper
• Multi‐AUV motion planning for archeological site mapping and photogrammetric reconstruction

  2019cites this paper
• Bayesian Local Sampling-Based Planning

  2019cites this paper
• Subsampling bias and the best-discrepancy systematic cross validation

  2019cites this paper
• Rapidly exploring Random Tree* with a sampling method based on Sukharev grids and convex vertices of safety hulls of obstacles

  2019cites this paper
• A Certified-Complete Bimanual Manipulation Planner

  2017cites this paper
• Efficient Sampling Algorithm for Optimization Under Uncertainty

  2016cites this paper
• Embedded domain-specific language and runtime system for progressive spatiotemporal data analysis and visualization

  2016cites this paper
• Selection of input primitives for the generalized label correcting method

  2016cites this paper
• Quasi-random Numbers Improve the CMA-ES on the BBOB Testbed

  2015cites this paper
• Selection of Optimal Path Planning Algorithm for Autonomous Robots in Structured Environment

  2014cites this paper
• On Low Discrepancy Samplings in Product Spaces of Motion Groups

  2014cites this paper
• Improving Probabilistic Roadmap Methods for Fast Motion Planning ; Reitinsuunnittelun nopeuttaminen reittikarttamenetelmiä parantamalla

  2014cites this paper
• A Low Dispersion Probabilistic Roadmaps (LD-PRM) Algorithm for Fast and Efficient Sampling-Based Motion Planning

  2013influential citation
• BFA(Backtrack Free path planning Algorithm)の3次元作業空間向け実装と多腕マニピュレータへの応用

  2011cites this paper
• Motion planning for steep hill climbing

  2011cites this paper
• A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize

  2011cites this paper
• Hard real-time motion planning for autonomous vehicles

  2011cites this paper
• Application of Sampling Based Model Predictive Control to an Autonomous Underwater Vehicle

  2010cites this paper
• Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibration

  2010influential citation
• Nonlinear Model Predictive Control using sampling and goal-directed optimization

  2010cites this paper
• Motion planning for an autonomous Underwater Vehicle via Sampling Based Model Predictive Control

  2010cites this paper
• Robust Optimizers for Nonlinear Programming in Approximate Dynamic Programming

  2009cites this paper
• Motion Planning for Haptic Guidance

  2008cites this paper
• Evaluation of a New Backtrack Free Path Planning Algorithm for Manipulators

  2008cites this paper
• Planejamento probabilístico de rotas no espaço de configuração e sua aplicação em robótica móvel

  2008cites this paper
• Sampling Based Model Predictive Control with Application to Autonomous Vehicle Guidance

  2008cites this paper
• Smooth Feedback Planning

  2008cites this paper
• Implementation of a new backtrack free path planning algorithm for manipulators

  2008cites this paper
• Sampling and Searching Methods for Practical Motion Planning Algorithms

  2008influential citation
• Efficient, incremental coverage of space with a continuous curve

  2008cites this paper
• Non linear programming for stochastic dynamic programming

  2007cites this paper
• WORKSPACE-BASED SAMPLING FOR PROBABILISTIC PATH PLANNING

  2007cites this paper
• Planification de Mouvement Pour la Manipulation Dextre d'Objets Rigides. (Motion Planning for Dexterous Manipulation)

  2007cites this paper
• Nonlinear programming in approximate dynamic programming - bang-bang solutions, stock-management and unsmooth penalties

  2007cites this paper
• Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1

  2007cites this paper
• Active learning in regression, with application to stochastic dynamic programming

  2007cites this paper
• Planning Algorithms: Sampling-Based Motion Planning

  2006cites this paper
• Planning algorithms

  2006cites this paper
• On the Probabilistic Foundations of Probabilistic Roadmap Planning

  2006influential citation
• Improvements to the Pseudospectral Electronic Structure Method and Experimental Protein Model Initiation

  2006cites this paper
• Low-Discrepancy Curves and Efficient Coverage of Space

  2006cites this paper
• Current Issues in Sampling-Based Motion Planning

  2005cites this paper
• Narrow passage sampling for probabilistic roadmap planning

  2005cites this paper
• Finding Grasping Configurations of a Dexterous Hand and an Industrial Robot

  2005cites this paper
• A Study of Polynomial Curvature Clothoid Paths for Motion Planning for Car-like Robots

  2005cites this paper
• Path planning using Harmonic Functions and Probabilistic Cell Decomposition

  2005cites this paper
• Nonlinear Trajectory Optimization with Path Constraints Applied to Spacecraft Reconfiguration Maneuvers

  2005influential citation
• Nonlinear trajectory optimization with path constraints applied to spacecraft reconfiguration maneuvers

  2005influential citation
• On the Probabilistic Foundations of Probabilistic Roadmap Planning

  2005cites this paper
• PDRRTs: integrating graph-based and cell-based planning

  2004cites this paper
• Incremental Grid Sampling Strategies in Robotics

  2004influential citation
• Deterministic sampling methods for spheres and SO(3)

  2004influential citation
• The sampling-based neighborhood graph: an approach to computing and executing feedback motion strategies

  2004cites this paper
• An Adaptative Deterministc Sequence for Sampling-based Motion Planners

  2004cites this paper
• Steps toward derandomizing RRTs

  2004cites this paper
• Towards Derandomizing PRM Planners

  2004cites this paper
• Incrementally reducing dispersion by increasing Voronoi bias in RRTs

  2004cites this paper
• From Dynamic Programming to RRTs: Algorithmic Design of Feasible Trajectories

  2003cites this paper
• A deterministic sampling approach to robot motion planning

  2003cites this paper
• A deterministic sampling approach to robot motion planning

  2003cites this paper
• Motion Planning Algorithms for General Closed-Chain Mechanisms

  2003cites this paper
• Adaptive probabilistic roadmap construction with multi-heuristic local planning

  2003cites this paper