research
∙
05/08/2023
A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations
Anytime search algorithms are useful for planning problems where a solut...
share
research
∙
01/24/2023
GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations
Parallel search algorithms have been shown to improve planning speed by ...
research
∙
03/02/2022
ePA*SE: Edge-based Parallel A* for Slow Evaluations
Parallel search algorithms harness the multithreading capability of mode...
research
∙
07/06/2021
MPLP: Massively Parallelized Lazy Planning
Lazy search algorithms have been developed to efficiently solve planning...
research
∙
11/17/2020
Sim-to-Real Task Planning and Execution from Perception via Reactivity and Recovery
Zero-shot execution of unseen robotic tasks is an important problem in r...
research
∙
08/25/2019
