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. 2003.03543
  4. Cited By
Experimental Comparison of Global Motion Planning Algorithms for Wheeled
  Mobile Robots

Experimental Comparison of Global Motion Planning Algorithms for Wheeled Mobile Robots

7 March 2020
Eric Heiden
Luigi Palmieri
Kai O. Arras
Gaurav Sukhatme
Sven Koenig
ArXivPDFHTML

Papers citing "Experimental Comparison of Global Motion Planning Algorithms for Wheeled Mobile Robots"

11 / 11 papers shown
Title
PathBench: A Benchmarking Platform for Classical and Learned Path
  Planning Algorithms
PathBench: A Benchmarking Platform for Classical and Learned Path Planning Algorithms
Alexandru Toma
Hao-Ya Hsueh
H. Jaafar
Riku Murai
Paul H. J. Kelly
Sajad Saeedi
32
20
0
04 May 2021
Informed Sampling for Asymptotically Optimal Path Planning (Consolidated
  Version)
Informed Sampling for Asymptotically Optimal Path Planning (Consolidated Version)
Jonathan Gammell
Timothy D. Barfoot
S. Srinivasa
23
160
0
20 Jun 2017
A Survey of Motion Planning and Control Techniques for Self-driving
  Urban Vehicles
A Survey of Motion Planning and Control Techniques for Self-driving Urban Vehicles
B. Paden
Michal Cap
Sze Zheng Yong
Dmitry S. Yershov
Emilio Frazzoli
46
2,017
0
25 Apr 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
23
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
39
150
0
30 Apr 2015
An Extensible Benchmarking Infrastructure for Motion Planning Algorithms
An Extensible Benchmarking Infrastructure for Motion Planning Algorithms
Mark Moll
I. Sucan
Lydia E. Kavraki
38
114
0
20 Dec 2014
Asymptotically Optimal Sampling-based Kinodynamic Planning
Asymptotically Optimal Sampling-based Kinodynamic Planning
Yanbo Li
Zakary Littlefield
Kostas E. Bekris
52
264
0
10 Jul 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
55
445
0
22 May 2014
Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct
  Sampling of an Admissible Ellipsoidal Heuristic
Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic
Jonathan Gammell
S. Srinivasa
Timothy D. Barfoot
48
831
0
08 Apr 2014
Theta*: Any-Angle Path Planning on Grids
Theta*: Any-Angle Path Planning on Grids
K. Daniel
A. Nash
Sven Koenig
Ariel Felner
53
751
0
16 Jan 2014
Sampling-based Algorithms for Optimal Motion Planning
Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
75
4,660
0
05 May 2011
1