Proceedings

Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning

Download BibTeX Cite

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence. Main track. Pages 5621-5627.

https://doi.org/10.24963/ijcai.2019/780

Abstract

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.

Jendrik Seipp. 2019. Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19. IJCAI, 5621–5627. https://doi.org/10.24963/ijcai.2019/780
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards