Broadly-Exploring, Local-Policy Trees for Long-Horizon Task Planning
Abstract:
Long-horizon planning in realistic environments requires the ability to reason over sequential tasks in high-dimensional state spaces with complex dynamics. Classical motion planning algorithms, such as rapidly-exploring random trees, are capable of efficiently exploring large state spaces and computing long-horizon, sequential plans. H...More
Code:
Data:
Full Text
Tags
Comments