ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1709.06290
  4. Cited By
The Critical Radius in Sampling-based Motion Planning

The Critical Radius in Sampling-based Motion Planning

19 September 2017
Kiril Solovey
Michal Kleinbort
ArXivPDFHTML

Papers citing "The Critical Radius in Sampling-based Motion Planning"

22 / 22 papers shown
Title
dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion
  Planning
dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning
Rahul Shome
Kiril Solovey
Andrew Dobson
Dan Halperin
Kostas E. Bekris
40
99
0
03 Mar 2019
Probabilistic completeness of RRT for geometric and kinodynamic planning
  with forward propagation
Probabilistic completeness of RRT for geometric and kinodynamic planning with forward propagation
Michal Kleinbort
Kiril Solovey
Zakary Littlefield
Kostas E. Bekris
Dan Halperin
30
82
0
19 Sep 2018
Safe Motion Planning in Unknown Environments: Optimality Benchmarks and
  Tractable Policies
Safe Motion Planning in Unknown Environments: Optimality Benchmarks and Tractable Policies
Lucas Janson
Tommy Hu
Marco Pavone
47
41
0
16 Apr 2018
Minimizing Task Space Frechet Error via Efficient Incremental Graph
  Search
Minimizing Task Space Frechet Error via Efficient Incremental Graph Search
Rachel Holladay
Oren Salzman
S. Srinivasa
23
27
0
18 Oct 2017
Scalable Asymptotically-Optimal Multi-Robot Motion Planning
Scalable Asymptotically-Optimal Multi-Robot Motion Planning
Andrew Dobson
Kiril Solovey
Rahul Shome
Dan Halperin
Kostas E. Bekris
60
32
0
29 Jun 2017
Efficient sampling-based bottleneck pathfinding over cost maps
Efficient sampling-based bottleneck pathfinding over cost maps
Kiril Solovey
Dan Halperin
OT
66
7
0
31 Jul 2016
Collision detection or nearest-neighbor search? On the computational
  bottleneck in sampling-based motion planning
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning
Michal Kleinbort
Oren Salzman
Dan Halperin
89
40
0
16 Jul 2016
Sampling-based bottleneck pathfinding with applications to Frechet
  matching
Sampling-based bottleneck pathfinding with applications to Frechet matching
Kiril Solovey
Dan Halperin
OT
40
11
0
10 Jul 2016
New perspective on sampling-based motion planning via random geometric
  graphs
New perspective on sampling-based motion planning via random geometric graphs
Kiril Solovey
Oren Salzman
Dan Halperin
3DV
31
42
0
17 Feb 2016
An Asymptotically-Optimal Sampling-Based Algorithm for Bi-directional
  Motion Planning
An Asymptotically-Optimal Sampling-Based Algorithm for Bi-directional Motion Planning
Joseph A. Starek
Javier V. Gómez
Edward Schmerling
Lucas Janson
L. Moreno
Marco Pavone
30
45
0
27 Jul 2015
Deterministic Sampling-Based Motion Planning: Optimality, Complexity,
  and Performance
Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance
Lucas Janson
Brian Ichter
Marco Pavone
57
151
0
30 Apr 2015
Motion Planning for Unlabeled Discs with Optimality Guarantees
Motion Planning for Unlabeled Discs with Optimality Guarantees
Kiril Solovey
Jingjin Yu
Or Zamir
Dan Halperin
26
70
0
20 Apr 2015
Asymptotically Optimal Sampling-based Kinodynamic Planning
Asymptotically Optimal Sampling-based Kinodynamic Planning
Yanbo Li
Zakary Littlefield
Kostas E. Bekris
63
266
0
10 Jul 2014
Optimal Sampling-Based Motion Planning under Differential Constraints:
  the Drift Case with Linear Affine Dynamics
Optimal Sampling-Based Motion Planning under Differential Constraints: the Drift Case with Linear Affine Dynamics
Edward Schmerling
Lucas Janson
Marco Pavone
72
52
0
28 May 2014
Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the
  Heuristically Guided Search of Implicit Random Geometric Graphs
Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs
Jonathan Gammell
S. Srinivasa
Timothy D. Barfoot
74
449
0
22 May 2014
Optimal Sampling-Based Motion Planning under Differential Constraints:
  the Driftless Case
Optimal Sampling-Based Motion Planning under Differential Constraints: the Driftless Case
Edward Schmerling
Lucas Janson
Marco Pavone
63
80
0
11 Mar 2014
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple
  Polygons
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons
Aviv Adler
Mark de Berg
Dan Halperin
Kiril Solovey
60
68
0
04 Dec 2013
Asymptotically near-optimal RRT for fast, high-quality, motion planning
Asymptotically near-optimal RRT for fast, high-quality, motion planning
Oren Salzman
Dan Halperin
62
180
0
01 Aug 2013
Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal
  Motion Planning in Many Dimensions
Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
Lucas Janson
Edward Schmerling
Ashley Clark
Marco Pavone
61
528
0
15 Jun 2013
Finding a needle in an exponential haystack: Discrete RRT for
  exploration of implicit roadmaps in multi-robot motion planning
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
Kiril Solovey
Oren Salzman
Dan Halperin
60
171
0
13 May 2013
Sparsification of Motion-Planning Roadmaps by Edge Contraction
Sparsification of Motion-Planning Roadmaps by Edge Contraction
Doron Shaharabani
Oren Salzman
P. Agarwal
Dan Halperin
78
48
0
20 Sep 2012
Sampling-based Algorithms for Optimal Motion Planning
Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
97
4,689
0
05 May 2011
1