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.06599
  4. Cited By
Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path
  Planning through Adaptive Heuristics

Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics

16 February 2020
Marlin P. Strub
Jonathan Gammell
ArXivPDFHTML

Papers citing "Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics"

12 / 12 papers shown
Title
Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced
  Graph-Search Techniques
Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques
Marlin P. Strub
Jonathan Gammell
9
74
0
16 Feb 2020
Sampling-based optimal kinodynamic planning with motion primitives
Sampling-based optimal kinodynamic planning with motion primitives
Basak Sakcak
L. Bascetta
G. Ferretti
Maria Prandini
11
52
0
07 Sep 2018
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with
  Expensive-to-Evaluate Edges
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Aditya Mandalika
Oren Salzman
S. Srinivasa
29
50
0
13 Mar 2018
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
49
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
16
160
0
20 Jun 2017
Collision detection or nearest-neighbor search? On the computational
  bottleneck in sampling-based motion planning
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning
Michal Kleinbort
Oren Salzman
Dan Halperin
82
40
0
16 Jul 2016
A Unifying Formalism for Shortest Path Problems with Expensive Edge
  Evaluations via Lazy Best-First Search over Paths with Edge Selectors
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors
Christopher M. Dellin
S. Srinivasa
16
70
0
10 Mar 2016
Deterministic Sampling-Based Motion Planning: Optimality, Complexity,
  and Performance
Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance
Lucas Janson
Brian Ichter
Marco Pavone
24
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
34
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
32
527
0
15 Jun 2013
Additive Pattern Database Heuristics
Additive Pattern Database Heuristics
Ariel Felner
Sarit Hanan
R. Korf
43
215
0
30 Jun 2011
Sampling-based Algorithms for Optimal Motion Planning
Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
56
4,660
0
05 May 2011
1