Simplifying Automated Pattern Selection for Planning with Symbolic Pattern Databases

Author(s):  
Ionut Moraru ◽  
Stefan Edelkamp ◽  
Santiago Franco ◽  
Moises Martinez
Author(s):  
Jendrik Seipp

Pattern databases are the foundation of some of the strongest admissible heuristics for optimal classical planning. Experiments showed that the most informative way of combining information from multiple pattern databases is to use saturated cost partitioning. Previous work selected patterns and computed saturated cost partitionings over the resulting pattern database heuristics in two separate steps. We introduce a new method that uses saturated cost partitioning to select patterns and show that it outperforms all existing pattern selection algorithms.


Author(s):  
Jiayi Wang ◽  
Iordanis Chatzinikolaidis ◽  
Carlos Mastalli ◽  
Wouter Wolfslag ◽  
Guiyang Xin ◽  
...  

Author(s):  
Yoshinobu Higami ◽  
Hiroshi Furutani ◽  
Takao Sakai ◽  
Shuichi Kameyama ◽  
Hiroshi Takahashi

2017 ◽  
Author(s):  
Stephen Thompson ◽  
Yannic Meuer ◽  
Eddie Edwards ◽  
João Ramalhinho ◽  
Maria Ruxandra Robu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document