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. 1405.5848
  4. Cited By
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

22 May 2014
Jonathan Gammell
S. Srinivasa
Timothy D. Barfoot
ArXivPDFHTML

Papers citing "Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs"

12 / 12 papers shown
Title
One Demo Is All It Takes: Planning Domain Derivation with LLMs from A Single Demonstration
One Demo Is All It Takes: Planning Domain Derivation with LLMs from A Single Demonstration
Jinbang Huang
Yixin Xiao
Zhanguang Zhang
Mark Coates
Jianye Hao
Yingxue Zhang
LM&Ro
LRM
28
0
0
23 May 2025
Real-Time Verification of Embodied Reasoning for Generative Skill Acquisition
Real-Time Verification of Embodied Reasoning for Generative Skill Acquisition
Bo Yue
Shuqi Guo
Kaiyu Hu
Chujiao Wang
Benyou Wang
Kui Jia
Guiliang Liu
LRM
69
0
0
16 May 2025
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
ArticuBot: Learning Universal Articulated Object Manipulation Policy via Large Scale Simulation
ArticuBot: Learning Universal Articulated Object Manipulation Policy via Large Scale Simulation
Yufei Wang
Ziyu Wang
Mino Nakura
Pratik Bhowal
Chia-Liang Kuo
Yi-Ting Chen
Zackory M. Erickson
David Held
101
0
0
04 Mar 2025
CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planning
CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planning
Hirokazu Ishida
Naoki Hiraoka
K. Okada
Masayuki Inaba
96
1
0
24 Feb 2025
Generalizable Motion Planning via Operator Learning
Generalizable Motion Planning via Operator Learning
Sharath Matada
Luke Bhan
Yuanyuan Shi
Nikolay Atanasov
67
0
0
23 Oct 2024
Goal-conditioned dual-action imitation learning for dexterous dual-arm robot manipulation
Goal-conditioned dual-action imitation learning for dexterous dual-arm robot manipulation
Heecheol Kim
Yoshiyuki Ohmura
Yasuo Kuniyoshi
53
27
0
18 Mar 2022
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
19
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
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
45
831
0
08 Apr 2014
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
51
527
0
15 Jun 2013
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