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. 1407.2896
  4. Cited By
Asymptotically Optimal Sampling-based Kinodynamic Planning

Asymptotically Optimal Sampling-based Kinodynamic Planning

10 July 2014
Yanbo Li
Zakary Littlefield
Kostas E. Bekris
ArXivPDFHTML

Papers citing "Asymptotically Optimal Sampling-based Kinodynamic Planning"

12 / 12 papers shown
Title
Asymptotically Optimal Path Planning With an Approximation of the Omniscient Set
Asymptotically Optimal Path Planning With an Approximation of the Omniscient Set
Jonáš Kříž
Vojtěch Vonásek
85
0
0
20 Mar 2025
Multi-layer Motion Planning with Kinodynamic and Spatio-Temporal Constraints
Multi-layer Motion Planning with Kinodynamic and Spatio-Temporal Constraints
Jeel Chatrola
Abhiroop Ajith
Kevin Leahy
Constantinos Chamzas
57
0
0
10 Mar 2025
Control Strategies for Pursuit-Evasion Under Occlusion Using Visibility and Safety Barrier Functions
Control Strategies for Pursuit-Evasion Under Occlusion Using Visibility and Safety Barrier Functions
Minnan Zhou
Mustafa Shaikh
Vatsalya Chaubey
Patrick Haggerty
Shumon Koga
Dimitra Panagou
Nikolay Atanasov
72
1
0
02 Nov 2024
Safe and Dynamically-Feasible Motion Planning using Control Lyapunov and Barrier Functions
Safe and Dynamically-Feasible Motion Planning using Control Lyapunov and Barrier Functions
Pol Mestres
Carlos Nieto-Granda
Jorge Cortés
86
1
0
10 Oct 2024
Experimental Comparison of Global Motion Planning Algorithms for Wheeled
  Mobile Robots
Experimental Comparison of Global Motion Planning Algorithms for Wheeled Mobile Robots
Eric Heiden
Luigi Palmieri
Kai O. Arras
Gaurav Sukhatme
Sven Koenig
27
4
0
07 Mar 2020
Kinodynamic Motion Planning: A Novel Type Of Nonlinear, Passive Damping
  Forces And Advantages
Kinodynamic Motion Planning: A Novel Type Of Nonlinear, Passive Damping Forces And Advantages
A. Masoud
22
294
0
29 Jun 2016
Analysis of Asymptotically Optimal Sampling-based Motion Planning
  Algorithms for Lipschitz Continuous Dynamical Systems
Analysis of Asymptotically Optimal Sampling-based Motion Planning Algorithms for Lipschitz Continuous Dynamical Systems
G. Papadopoulos
H. Kurniawati
N. Patrikalakis
35
19
0
12 May 2014
An Efficiently Solvable Quadratic Program for Stabilizing Dynamic
  Locomotion
An Efficiently Solvable Quadratic Program for Stabilizing Dynamic Locomotion
S. Kuindersma
Frank Permenter
Russ Tedrake
51
243
0
07 Nov 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
54
527
0
15 Jun 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
64
48
0
20 Sep 2012
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
Incremental Sampling-based Algorithms for Optimal Motion Planning
Incremental Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
112
804
0
03 May 2010
1