{"type":"ScholarlyArticle","title":"Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search","authors":[{"name":"Daniel Gnad","slug":"daniel-gnad","given":"Daniel","family":"Gnad","affiliation":"Saarland University , Saarland Informatics Campus , Saarbrücken , Germany"},{"name":"Valerie Poser","slug":"valerie-poser","given":"Valerie","family":"Poser","affiliation":"Saarland University , Saarland Informatics Campus , Saarbrücken , Germany"},{"name":"Jörg Hoffmann","slug":"jorg-hoffmann","given":"Jörg","family":"Hoffmann","affiliation":"Saarland University , Saarland Informatics Campus , Saarbrücken , Germany"}],"abstract":"Star-topology decoupling is a recent search reduction method for forward state space search. The idea basically is to automatically identify a star factoring, then search only over the center component in the star, avoiding interleavings across leaf components. The framework can handle complex star topologies, yet prior work on decoupled search considered only factoring strategies identifying fork and inverted-fork topologies. Here, we introduce factoring strategies able to detect general star topologies, thereby extending the reach of decoupled search to new factorings and to new domains, sometimes resulting in significant performance improvements. Furthermore, we introduce a predictive portfolio method that reliably selects the most suitable factoring for a given planning task, leading to superior overall performance.","doi":"10.24963/ijcai.2017/602","url":"https://ijcai.org/proceedings/2017/602","pdf":"https://ijcai.org/proceedings/2017/0602.pdf","markdown":"https://ijcai.org/proceedings/2017/602.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/602","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Planning and Scheduling","track":"Main track","number":602,"pages":{"first":4310,"last":4316},"keywords":["Planning and Scheduling: Planning Algorithms","Combinatorial & Heuristic Search: Heuristic Search","Planning and Scheduling: Planning and Scheduling","Planning and Scheduling: Search in Planning and Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Aghighi et al., 2015] Meysam Aghighi, Peter Jonsson, and Simon Ståhlberg. Tractable cost-optimal planning over re- stricted polytree causal graphs. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI'15), pages 3225-3231. AAAI Press, January 2015.","title":"Tractable cost-optimal planning over restricted polytree causal graphs","authors":"Meysam Aghighi, Peter Jonsson, Simon Ståhlberg","year":"2015","venue":"Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI'15)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Amir and Engelhardt, 2003] Eyal Amir and Barbara Engel- hardt. Factored planning. In Proceedings of the 18th IJCAI, pages 929-935, Acapulco, Mexico, August 2003.","title":"Eyal Amir and Barbara","authors":"Engelhardt ; Amir, Engelhardt","year":"2003","venue":"Proceedings of the 18th IJCAI","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Morgan Kaufmann. [Bäckström and Nebel, 1995] Christer Bäckström and Bern- hard Nebel. Complexity results for SAS + planning. Com- putational Intelligence, 11(4):625-655, 1995.","title":"Christer Bäckström and Bernhard Nebel","authors":"Morgan Kaufmann, . [ Bäckström, Nebel","year":"1995","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Brafman and Domshlak, 2003] Ronen Brafman and Carmel Domshlak. Structure and complexity in planning with unary operators. JAIR, 18:315-349, 2003.","title":"Structure and complexity in planning with unary operators","authors":"Domshlak Brafman, Ronen Brafman, Carmel Domshlak","year":"2003","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brafman and Domshlak, 2013] Ronen Brafman and Carmel Domshlak. On the complexity of planning for agent teams and its implications for single agent planning. AI, 198:52- 71, 2013.","title":"On the complexity of planning for agent teams and its implications for single agent planning","authors":"Domshlak Brafman, Ronen Brafman, Carmel Domshlak","year":"2013","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cenamor et al., 2016] Isabel Cenamor, Tomás de la Rosa, and Fernando Fernández. The ibacop planning system: Instance-based configured portfolios. JAIR, 56:657-691, 2016.","title":"The ibacop planning system: Instance-based configured portfolios","authors":"Isabel Cenamor, Tomás De La Rosa, Fernando Fernández","year":"2016","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Fabre et al., 2010] Eric Fabre, Loïg Jezequel, Patrik Haslum, and Sylvie Thiébaux. Cost-optimal factored planning: Promises and pitfalls. In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS'10), pages 65-72. AAAI Press, 2010.","title":"Cost-optimal factored planning: Promises and pitfalls","authors":"Fabre","year":"2010","venue":"Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS'10)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fawcett et al., 2014] Chris Fawcett, Mauro Vallati, Frank Hutter, Jörg Hoffmann, Holger Hoos, and Kevin Leyton- Brown. Improved features for runtime prediction of domain-independent planners. In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS'14). AAAI Press, 2014.","title":"Improved features for runtime prediction of domain-independent planners","authors":"Chris Fawcett, Mauro Vallati, Frank Hutter, Jörg Hoffmann, Holger Hoos, Kevin Leyton-Brown","year":"2014","venue":"Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS'14)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fomin et al., 2009] Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch. A measure & conquer approach for the analysis of exact algorithms. JACM, 56(5), 2009.","title":"A measure & conquer approach for the analysis of exact algorithms","authors":"V Fedor, Fabrizio Fomin, Dieter Grandoni, Kratsch","year":"2009","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gerevini et al., 2009] Alfonso Gerevini, Alessandro Saetti, and Mauro Vallati. An automatically configurable portfolio-based planner with macro-actions: PbP. In Pro- ceedings of the 19th International Conference on Auto- mated Planning and Scheduling (ICAPS'09), pages 350- 353. AAAI Press, 2009.","title":"An automatically configurable portfolio-based planner with macro-actions: PbP","authors":"Alfonso Gerevini, Alessandro Saetti, Mauro Vallati","year":"2009","venue":"Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS'09)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gnad and Hoffmann, 2015] Daniel Gnad and Jörg Hoff- mann. Beating LM-cut with h max (sometimes): Fork- decoupled state space search. In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS'15), pages 88-96. AAAI Press, 2015.","title":"Beating LM-cut with h max (sometimes): Forkdecoupled state space search","authors":"Daniel Gnad, Jörg Hoffmann","year":"2015","venue":"Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS'15)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gnad et al., 2015] Daniel Gnad, Jörg Hoffmann, and Carmel Domshlak. From fork decoupling to star-topology decoupling. In Proceedings of the 8th Annual Symposium on Combinatorial Search (SOCS'15), pages 53-61. AAAI Press, 2015.","title":"From fork decoupling to star-topology decoupling","authors":"Daniel Gnad, Jörg Hoffmann, Carmel Domshlak","year":"2015","venue":"Proceedings of the 8th Annual Symposium on Combinatorial Search (SOCS'15)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Helmert and Domshlak, 2009] Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway? In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS'09), pages 162-169. AAAI Press, 2009.","title":"Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway?","authors":"Domshlak Helmert","year":"2009","venue":"Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS'09)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Helmert et al., 2011] Malte Helmert, Gabriele Röger, Jen- drik Seipp, Erez Karpas, Jörg Hoffmann, Emil Keyder, Raz Nissim, Silvia Richter, and Matthias Westphal. Fast Downward Stone Soup. In IPC 2011 planner abstracts, pages 38-45, 2011.","title":"Fast Downward Stone Soup","authors":"Malte Helmert, Gabriele Röger, Jendrik Seipp, Erez Karpas, Jörg Hoffmann, Emil Keyder, Raz Nissim, Silvia Richter, Matthias Westphal","year":"2011","venue":"IPC 2011 planner abstracts","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward plan- ning system. JAIR, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert","year":"2006","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hoffmann and Nebel, 2001] Jörg Hoffmann and Bernhard Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.","title":"The FF planning system: Fast plan generation through heuristic search","authors":"Nebel Hoffmann, Jörg Hoffmann, Bernhard Nebel","year":"2001","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hoffmann, 2011] Jörg Hoffmann. Analyzing search topol- ogy without running any search: On the connection be- tween causal graphs and h + . JAIR, 41:155-229, 2011.","title":"Analyzing search topology without running any search: On the connection between causal graphs and h +","authors":"Jörg Hoffmann, Hoffmann","year":"2011","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Howe et al., 1999] Adele Howe, Eric Dahlman, Chistopher Hansen, Anneliese Von Mayrhauser, and Michael Scheetz. Exploiting competitive planner performance. In Pro- ceedings of the 5th European Conference on Planning (ECP'99), pages 62-72. Springer-Verlag, 1999.","title":"Exploiting competitive planner performance","authors":"Howe","year":"1999","venue":"Proceedings of the 5th European Conference on Planning (ECP'99)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Jonsson and Bäckström, 1995] Peter Jonsson and Christer Bäckström. Incremental planning. In European Workshop on Planning, 1995.","title":"Incremental planning","authors":"Jonsson, Bäckström, Peter Jonsson, Christer Bäckström","year":"1995","venue":"European Workshop on Planning","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Katz and Domshlak, 2008] Michael Katz and Carmel Domshlak. Structural patterns heuristics via fork de- composition. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS'08), pages 182-189. AAAI Press, 2008.","title":"Structural patterns heuristics via fork decomposition","authors":"Michael Katz, Carmel Domshlak","year":"2008","venue":"Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS'08)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Katz and Keyder, 2012] Michael Katz and Emil Keyder. Structural patterns beyond forks: Extending the com- plexity boundaries of classical planning. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI'12), pages 1779-1785, Toronto, ON, Canada, July 2012. AAAI Press.","title":"Structural patterns beyond forks: Extending the complexity boundaries of classical planning","authors":"Michael Katz, Emil Keyder","year":"2012","venue":"Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI'12)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kelareva et al., 2007] Elena Kelareva, Olivier Buffet, Jinbo Huang, and Sylvie Thiébaux. Factored planning using decomposition trees. In Proceedings of the 20th IJCAI, pages 1942-1947, Hyderabad, India, January 2007.","title":"Factored planning using decomposition trees","authors":"Elena Kelareva, Olivier Buffet, Jinbo Huang, Sylvie Thiébaux","year":"2007","venue":"Proceedings of the 20th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/313"},{"position":23,"raw":"Mor- gan Kaufmann. [Knoblock, 1994]","title":"Knoblock","authors":"Morgan Kaufmann","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"Craig Knoblock. Automatically generat- ing abstractions for planning. AI, 68(2):243-302, 1994.","title":"Automatically generating abstractions for planning","authors":"Craig Knoblock","year":"1994","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Roberts and Howe, 2009] Mark Roberts and Adele Howe. Learning from planner performance. AI, 173(5-6):536- 561, 2009.","title":"Learning from planner performance","authors":"Howe Roberts, Mark Roberts, Adele Howe","year":"2009","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Seipp et al., 2015] Jendrik Seipp, Silvan Sievers, Malte Helmert, and Frank Hutter. Automatic configuration of sequential planning portfolios. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI'15), pages 3364-3370. AAAI Press, January 2015.","title":"Automatic configuration of sequential planning portfolios","authors":"Seipp","year":"2015","venue":"Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI'15)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}