Learning Local Heuristics in Heuristic Search

NSH 3305

Abstract: Motion planning is a fundamental problem in robotics; how can we move robots efficiently and safely? Motion planning can be solved using several paradigms with their own strengths and weaknesses. This talk dives into Heuristic Graph Search and its application to motion planning by converting it to a problem of finding a start-goal path [...]