A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs

24 December 2020

Papers citing "A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs"

9 / 9 papers shown

Title
Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques Marlin P. Strub Jonathan Gammell 44 74 0 16 Feb 2020
MAMS-A: Multi-Agent Multi-Scale A J. Lim Panagiotis Tsiotras 28 5 0 08 Oct 2019
Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles Aditya Mandalika Sanjiban Choudhury Oren Salzman S. Srinivasa 53 58 0 04 Apr 2019
Safe Motion Planning in Unknown Environments: Optimality Benchmarks and Tractable Policies Lucas Janson Tommy Hu Marco Pavone 58 41 0 16 Apr 2018
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 36 71 0 10 Mar 2016
FMAP: Distributed Cooperative Multi-Agent Planning Alejandro Torreño Eva Onaindia Óscar Sapena 39 100 0 28 Jan 2015
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 76 450 0 22 May 2014
Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions Lucas Janson Edward Schmerling Ashley Clark Marco Pavone 67 529 0 15 Jun 2013
Sampling-based Algorithms for Optimal Motion Planning S. Karaman Emilio Frazzoli 102 4,697 0 05 May 2011