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. 2002.06589
  4. Cited By
Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced
  Graph-Search Techniques

Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques

16 February 2020
Marlin P. Strub
Jonathan Gammell
ArXivPDFHTML

Papers citing "Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques"

8 / 8 papers shown
Title
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
98
0
0
04 Mar 2025
Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path
  Planning through Adaptive Heuristics
Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics
Marlin P. Strub
Jonathan Gammell
45
81
0
16 Feb 2020
Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime
  Search
Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search
Jonathan Gammell
Timothy D. Barfoot
S. Srinivasa
54
153
0
06 Jul 2017
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
18
160
0
20 Jun 2017
Deterministic Sampling-Based Motion Planning: Optimality, Complexity,
  and Performance
Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance
Lucas Janson
Brian Ichter
Marco Pavone
34
150
0
30 Apr 2015
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
52
445
0
22 May 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
45
527
0
15 Jun 2013
Sampling-based Algorithms for Optimal Motion Planning
Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
69
4,660
0
05 May 2011
1