Uses imitation learning from oracles to train an edge-evaluation policy for lazy graph search, outperforming heuristics on 2D and 7D motion planning problems when test instances are similar to training.
Heuris- tic search on graphs with existence priors for expensive- to-evaluate edges
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Leveraging Experience in Lazy Search
Uses imitation learning from oracles to train an edge-evaluation policy for lazy graph search, outperforming heuristics on 2D and 7D motion planning problems when test instances are similar to training.