en-de
en-es
en-fr
en-pt
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
Learning Inadmissible Heuristics during Search
Published on Jul 21, 20114069 Views
Suboptimal search algorithms offer shorter solving times by sacrificing guaranteed solution optimality. While optimal search algorithms like A* and IDA* require admissible heuristics, suboptimal searc
Related categories
Chapter list
Learning Inadmissible Heuristics During Search00:00
Heuristics Guide Search - 100:11
Heuristics Guide Search - 200:25
Heuristics Guide Search - 300:36
Heuristics Guide Search - 401:42
Motivation For Our Approach02:06
Outline - 102:46
Learning03:08
Observing Error Between Parent and Best Child - 103:11
Observing Error Between Parent and Best Child - 203:51
Observing Error Between Parent and Best Child - 304:14
Observing Error Between Parent and Best Child - 404:58
Observing Error Between Parent and Best Child - 505:42
Path Based Corrections - 106:50
Path Based Corrections - 207:15
Path Based Corrections - 308:10
Path Based Corrections - 408:35
Summary09:17
Performance10:09
Outline - 210:17
Greedy Best First Search - 110:44
Greedy Best First Search - 212:48
Greedy Best First Search - 313:48
Outline - 314:47
Bounded Suboptimal Search: Skeptical Search - 115:10
Bounded Suboptimal Search: Skeptical Search - 215:39
Performance In Bounded Suboptimal Search - 117:11
Performance In Bounded Suboptimal Search - 218:04
Performance In Bounded Suboptimal Search - 318:40
In the Paper19:00
Summary19:54
The University of New Hampshire20:46