{"type":"ScholarlyArticle","title":"Novel Structural Parameters for Acyclic Planning Using Tree Embeddings","authors":[{"name":"Christer Bäckström","slug":"christer-backstrom","given":"Christer","family":"Bäckström","affiliation":"Department of Computer and Information Science , Linköping University , Sweden"},{"name":"Peter Jonsson","slug":"peter-jonsson","given":"Peter","family":"Jonsson","affiliation":"Department of Computer and Information Science , Linköping University , Sweden"},{"name":"Sebastian Ordyniak","slug":"sebastian-ordyniak","given":"Sebastian","family":"Ordyniak","affiliation":"Algorithms group , University of Sheffield , UK"}],"abstract":"We introduce two novel structural parameters for acyclic planning (planning restricted to instances with acyclic causal graphs): up-depth and down-depth.  We show that cost-optimal acyclic planning restricted to instances with bounded domain size and bounded up- or down-depth can be solved in polynomial time.  For example, many of the tractable subclasses based on polytrees are covered by our result.  We analyze the parameterized complexity of planning with bounded up- and down-depth: in a certain sense, down-depth has better computational properties than up-depth.  Finally, we show that computing up- and down-depth are fixed-parameter tractable problems, just as many other structural parameters that are used in computer science.  We view our results as a natural step towards understanding the complexity of acyclic planning with bounded treewidth and other parameters.","doi":"10.24963/ijcai.2018/647","url":"https://ijcai.org/proceedings/2018/647","pdf":"https://ijcai.org/proceedings/2018/0647.pdf","markdown":"https://ijcai.org/proceedings/2018/647.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/647","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Planning and Scheduling","track":"Main track","number":647,"pages":{"first":4653,"last":4659},"keywords":["Planning and Scheduling: Planning Algorithms","Planning and Scheduling: Theoretical Foundations of Planning"],"videos":[],"references":[{"position":1,"raw":"[Aghighi et al., 2015] Meysam Aghighi, Peter Jonsson, and Simon Ståhlberg. Tractable cost-optimal planning over restricted polytree causal graphs. In Proc. Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-2015), pages 3225-3231, 2015.","title":"Tractable cost-optimal planning over restricted polytree causal graphs","authors":"Meysam Aghighi, Peter Jonsson, Simon Ståhlberg","year":"2015","venue":"Proc. Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-2015)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bacchus and Yang, 1994] Fahiem Bacchus and Qiang Yang. Downward refinement and the efficiency of hierarchical problem solving. Artif. Intell., 71(1):43-100, 1994.","title":"Fahiem Bacchus and Qiang Yang. Downward refinement and the efficiency of hierarchical problem solving","authors":"Yang Bacchus","year":"1994","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bäckström, 2014] Christer Bäckström. Parameterising the complexity of planning by the number of paths in the domain-transition graphs. In 21st European Conference on Artificial Intelligence (ECAI 2014), pages 33-38, 2014.","title":"Parameterising the complexity of planning by the number of paths in the domain-transition graphs","authors":"Christer Bäckström","year":"2014","venue":"21st European Conference on Artificial Intelligence (ECAI 2014)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bliem et al., 2016] Bernhard Bliem, Sebastian Ordyniak, and Stefan Woltran. Clique-width and directed width mea- sures for answer-set programming. In Proc. 22nd European Conference on Artificial Intelligence (ECAI 2016), pages 1105-1113, 2016.","title":"Clique-width and directed width measures for answer-set programming","authors":"Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran","year":"2016","venue":"Proc. 22nd European Conference on Artificial Intelligence (ECAI 2016)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bliem et al., 2017] Bernhard Bliem, Marius Moldovan, Michael Morak, and Stefan Woltran. The impact of treewidth on ASP grounding and solving. In Proc. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 852-858, 2017.","title":"The impact of treewidth on ASP grounding and solving","authors":"Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran","year":"2017","venue":"Proc. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)","doi":null,"url":null,"internal_url":"/proceedings/2017/118"},{"position":6,"raw":"[Bodlaender et al., 1998] Hans L. Bodlaender, Jitender S. De- ogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, and Zsolt Tuza. Rankings of graphs. SIAM J. Discrete Math., 11(1):168-181, 1998.","title":"Rankings of graphs","authors":"L Hans, Jitender S Bodlaender, Klaus Deogun, Ton Jansen, Dieter Kloks, Haiko Kratsch, Zsolt Müller, Tuza","year":"1998","venue":"SIAM J. Discrete Math","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brafman and Domshlak, 2003] R. Brafman and C. Domsh- lak. Structure and complexity in planning with unary oper- ators. J. Artif. Intell. Res. (JAIR), 18:315-349, 2003.","title":"Structure and complexity in planning with unary operators","authors":"R Brafman, C Domshlak","year":"2003","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Brafman and Domshlak, 2006] Ronen I. Brafman and Carmel Domshlak. Factored planning: How, when, and when not. In Proc. AAAI 2006, pages 809-814. AAAI Press, 2006.","title":"Factored planning: How, when, and when not","authors":"Ronen I Brafman, Carmel Domshlak","year":"2006","venue":"Proc. AAAI 2006","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Courcelle, 1990] Bruno Courcelle. The monadic second- order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput., 85(1):12-75, 1990.","title":"The monadic secondorder logic of graphs. i. recognizable sets of finite graphs","authors":"Bruno Courcelle","year":"1990","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Diestel, 2012] Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012.","title":"Graph Theory","authors":"Reinhard Diestel","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Domshlak and Nazarenko, 2013] Carmel Domshlak and An- ton Nazarenko. The complexity of optimal monotonic planning: The bad, the good, and the causal graph. J. Artif. Intell. Res., 48:783-812, 2013.","title":"Carmel Domshlak and Anton Nazarenko. The complexity of optimal monotonic planning: The bad, the good, and the causal graph","authors":"Nazarenko Domshlak","year":"2013","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Downey and Fellows, 2013] Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"Rodney G Downey, Michael R Fellows","year":"2013","venue":"Texts in Computer Science","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ganian et al., 2017] Robert Ganian, M. S. Ramanujan, and Stefan Szeider. Combining treewidth and backdoors for CSP. In Proc. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), pages 36:1-36:17, 2017.","title":"Combining treewidth and backdoors for CSP","authors":"M S Robert Ganian, Stefan Ramanujan, Szeider","year":"2017","venue":"Proc. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gaspers and Szeider, 2013] Serge Gaspers and Stefan Szei- der. Strong backdoors to bounded treewidth SAT. In 54th Annual IEEE Symposium on Foundations of Computer Sci- ence, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489-498. IEEE Computer Society, 2013.","title":"Strong backdoors to bounded treewidth SAT","authors":"Serge Gaspers, Stefan Szeider","year":"2013","venue":"54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Giménez and Jonsson, 2008] Omer Giménez and Anders Jonsson. The complexity of planning problems with simple causal graphs. J. Artif. Intell. Res., 31:319-351, 2008.","title":"The complexity of planning problems with simple causal graphs","authors":"Jonsson Giménez, Omer Giménez, Anders Jonsson","year":"2008","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gottlob et al., 2010] Georg Gottlob, Reinhard Pichler, and Fang Wei. Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell., 174(1):105-132, 2010.","title":"Bounded treewidth as a key to tractability of knowledge representation and reasoning","authors":"Gottlob","year":"2010","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Helmert, 2006] Malte Helmert. The fast downward planning system. J. Artif. Intell. Res., 26:191-246, 2006.","title":"The fast downward planning system","authors":"Malte Helmert","year":"2006","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Jonsson and Bäckström, 1998] Peter Jonsson and Christer Bäckström. Tractable plan existence does not imply tractable plan generation. Annals of Mathematics and Arti- ficial Intelligence, 22(3-4):281-296, 1998.","title":"Tractable plan existence does not imply tractable plan generation","authors":"Jonsson, Bäckström, Peter Jonsson, Christer Bäckström","year":"1998","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Jonsson et al., 2014] Anders Jonsson, Peter Jonsson, and Tomas Lööw. Limitations of acyclic causal graphs for planning. Artif. Intell., 210:36-55, 2014.","title":"Limitations of acyclic causal graphs for planning","authors":"Anders Jonsson, Peter Jonsson, Tomas Lööw","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Katz and Domshlak, 2010] Michael Katz and Carmel Domshlak. Implicit abstraction heuristics. J. Artif. Intell. Res., 39:51-126, 2010.","title":"Implicit abstraction heuristics","authors":"Michael Katz, Carmel Domshlak","year":"2010","venue":"J. Artif. Intell. Res","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 complexity boundaries of classical planning. In Proc. Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-2012), 2012.","title":"Structural patterns beyond forks: Extending the complexity boundaries of classical planning","authors":"Michael Katz, Emil Keyder","year":"2012","venue":"Proc. Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-2012)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Knoblock, 1994] Craig A. Knoblock. Automatically generat- ing abstractions for planning. Artif. Intell., 68(2):243-302, 1994.","title":"Automatically generating abstractions for planning","authors":"Craig A Knoblock","year":"1994","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Nesetril and de Mendez, 2012] Jaroslav Nesetril and Patrice Ossona de Mendez. Sparsity -Graphs, Struc- tures, and Algorithms, volume 28 of Algorithms and combinatorics. Springer, 2012.","title":"Jaroslav Nesetril and Patrice Ossona de Mendez","authors":"De Nesetril, Mendez","year":"2012","venue":"Sparsity -Graphs, Structures, and Algorithms","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Paulusma et al., 2016] Daniël Paulusma, Friedrich Slivovsky, and Stefan Szeider. Model counting for CNF formulas of bounded modular treewidth. Algorith- mica, 76(1):168-194, 2016.","title":"Model counting for CNF formulas of bounded modular treewidth","authors":"Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider","year":"2016","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Ståhlberg, 2017] Simon Ståhlberg. Methods for Detecting Unsolvable Planning Instances using Variable Projection. PhD thesis, Linköping University, Sweden, 2017.","title":"Methods for Detecting Unsolvable Planning Instances using Variable Projection","authors":"Simon Ståhlberg","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Williams and Nayak, 1997] B. C. Williams and P. Pan- durang Nayak. A reactive planner for a model-based ex- ecutive. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pages 1178-1185, 1997.","title":"A reactive planner for a model-based executive","authors":"B C Williams, P Pandurang Nayak","year":"1997","venue":"Proceedings of the 15th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/1997/170"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}