26/10/2020

Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement

Jendrik Seipp, Samuel von Allmen, Malte Helmert

Keywords: classical planning, abstractions, abstraction refinement, admissible heuristics

Abstract Paper Similar Papers

Abstract: Counterexample-guided Cartesian abstraction refinement has been shown to yield informative heuristics for optimal classical planning. The algorithm iteratively finds an abstract solution and uses it to decide how to refine the abstraction. Since the abstraction grows in each step, finding solutions is the main bottleneck of the refinement loop. We cast the refinements as an incremental search problem and show that this drastically reduces the time for computing abstractions.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at ICAPS 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 19:13 
 0
 0
 0
 0
 11:54 
 0
 0
 0
 0
 5:48 
 0
 0
 0
 0
 4:49 
 0
 0
 0
 0
 3:11 
 0
 0
 0
 0
 5:53 
 0
 0
 0
 0
 3:05 
 0
 0
 0
 0
 14:51 
 0
 0
 0
 0
 7:40 
 0
 0
 0
 0
 16:01 
 0
 0
 0
 0
 12:13 
 0
 0
 0
 0
 14:59 
 0
 0
 0
 0
 5:08 
 0
 0
 0
 0
 5:17 
 0
 0
 0
 0
 11:17 
 0
 0
 0
 0
 17:42 
 0
 0
 0
 0
 12:14 
 0
 0
 0
 0
 15:03 
 0
 0
 0
 0
 4:42 
 0
 0
 0
 0
 10:08 
 0
 0
 0
 1
 5:54 
 0
 0
 0
 0
 5:10 
 0
 0
 0
 0
 15:05 
 0
 0
 0
 0
 5:18 
 0
 0
 0
 0
 11:18 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 13:04 
 0
 0
 0
 0
 5:22 
 0
 0
 0
 0
 3:28 
 0
 0
 0
 0
 12:07 
 0
 0
 0
 0
 14:20 
 0
 0
 0
 0
 3:20 
 0
 0
 0
 0
 15:08 
 0
 0
 0
 0
 3:24 
 0
 0
 0
 0
 7:50 
 0
 0
 0
 0
 3:02 
 0
 0
 0
 0
 14:47 
 0
 0
 0
 0
 3:04 
 0
 0
 0
 0
 9:45