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. 2205.06940
  4. Cited By
BiAIT*: Symmetrical Bidirectional Optimal Path Planning with Adaptive
  Heuristic
v1v2 (latest)

BiAIT*: Symmetrical Bidirectional Optimal Path Planning with Adaptive Heuristic

14 May 2022
Chenming Li
Han Ma
Peng Xu
Jiankun Wang
Max Meng
ArXiv (abs)PDFHTML

Papers citing "BiAIT*: Symmetrical Bidirectional Optimal Path Planning with Adaptive Heuristic"

9 / 9 papers shown
Title
AIT* and EIT*: Asymmetric bidirectional sampling-based path planning
AIT* and EIT*: Asymmetric bidirectional sampling-based path planning
Marlin P. Strub
Jonathan Gammell
64
52
0
02 Nov 2021
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
60
82
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
61
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
69
163
0
20 Jun 2017
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
78
450
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
66
844
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
70
529
0
15 Jun 2013
Sampling-based Algorithms for Optimal Motion Planning
Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
107
4,700
0
05 May 2011
Incremental Sampling-based Algorithms for Optimal Motion Planning
Incremental Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
163
807
0
03 May 2010
1