Learning Heuristic Search via Imitation

by   Mohak Bhardwaj, et al.

Robotic motion planning problems are typically solved by constructing a search tree of valid maneuvers from a start to a goal configuration. Limited onboard computation and real-time planning constraints impose a limit on how large this search tree can grow. Heuristics play a crucial role in such situations by guiding the search towards potentially good directions and consequently minimizing search effort. Moreover, it must infer such directions in an efficient manner using only the information uncovered by the search up until that time. However, state of the art methods do not address the problem of computing a heuristic that explicitly minimizes search effort. In this paper, we do so by training a heuristic policy that maps the partial information from the search to decide which node of the search tree to expand. Unfortunately, naively training such policies leads to slow convergence and poor local minima. We present SaIL, an efficient algorithm that trains heuristic policies by imitating "clairvoyant oracles" - oracles that have full information about the world and demonstrate decisions that minimize search effort. We leverage the fact that such oracles can be efficiently computed using dynamic programming and derive performance guarantees for the learnt heuristic. We validate the approach on a spectrum of environments which show that SaIL consistently outperforms state of the art algorithms. Our approach paves the way forward for learning heuristics that demonstrate an anytime nature - finding feasible solutions quickly and incrementally refining it over time.


page 2

page 7


Data-driven Planning via Imitation Learning

Robot planning is the process of selecting a sequence of actions that op...

Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles

Lazy search algorithms can efficiently solve problems where edge evaluat...

Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem

One of the key challenges for operations researchers solving real-world ...

Leveraging Experience in Lazy Search

Lazy graph search algorithms are efficient at solving motion planning pr...

Bidirectional Sampling Based Search Without Two Point Boundary Value Solution

Bidirectional path and motion planning approaches decrease planning time...

Effort Informed Roadmaps (EIRM*): Efficient Asymptotically Optimal Multiquery Planning by Actively Reusing Validation Effort

Multiquery planning algorithms find paths between various different star...

Rational Deployment of CSP Heuristics

Heuristics are crucial tools in decreasing search effort in varied field...

Please sign up or login with your details

Forgot password? Click here to reset