{"type":"ScholarlyArticle","title":"Completeness-Preserving Dominance Techniques for Satisficing Planning","authors":[{"name":"Álvaro Torralba","slug":"alvaro-torralba","given":"Álvaro","family":"Torralba","affiliation":"Saarland University , Saarland Informatics Campus , Saarbrücken , Germany"}],"abstract":"Dominance pruning methods have recently been introduced for optimal planning. They compare states based on their goal distance to prune those that can be proven to be worse than others. In this paper, we introduce dominance techniques for satisficing planning. We extend the definition of dominance, showing that being closer to the goal is not a prerequisite for dominance in the satisficing setting. We develop a new method to automatically find dominance relations in which a state dominates another if it has achieved more serializable sub-goals. We take advantage of dominance relations in different ways; while in optimal planning their usage focused on dominance pruning and action selection, we also use it to guide enforced hill-climbing search, resulting in a complete algorithm.","doi":"10.24963/ijcai.2018/673","url":"https://ijcai.org/proceedings/2018/673","pdf":"https://ijcai.org/proceedings/2018/0673.pdf","markdown":"https://ijcai.org/proceedings/2018/673.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/673","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":673,"pages":{"first":4844,"last":4851},"keywords":["Planning and Scheduling: Search in Planning and Scheduling","Planning and Scheduling: Planning Algorithms","Planning and Scheduling: Planning and Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Bäckström and Klein, 1991] Christer Bäckström and Inger Klein. Planning in polynomial time: The SAS-PUBS class. Computa- tional Intelligence, 7(4), 1991.","title":"Planning in polynomial time: The SAS-PUBS class","authors":"Klein Bäckström, Christer Bäckström, Inger Klein","year":"1991","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bäckström and Nebel, 1995] Christer Bäckström and Bernhard Nebel. Complexity results for SAS + planning. Computational Intelligence, 11(4):625-655, 1995.","title":"Complexity results for SAS + planning","authors":"Nebel Bäckström, Christer Bäckström, Bernhard Nebel","year":"1995","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Barrett and Weld, 1993] Anthony Barrett and Daniel S. Weld. Characterizing subgoal interactions for planning. pages 1388- 1393, 1993.","title":"Characterizing subgoal interactions for planning","authors":"Anthony Barrett, Daniel S Weld","year":"1993","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/1993/192"},{"position":4,"raw":"[Brafman and Domshlak, 2003] Ronen Brafman and Carmel Domshlak. Structure and complexity in planning with unary op- erators. Journal of Artificial Intelligence Research, 18:315-349, 2003.","title":"Structure and complexity in planning with unary operators","authors":"Domshlak Brafman","year":"2003","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chen and Giménez, 2007] Hubie Chen and Omer Giménez. Act local, think global: Width notions for tractable planning. In Mark Boddy, Maria Fox, and Sylvie Thiebaux, editors, Proc. of the 17th International Conference on Automated Planning and Scheduling (ICAPS'07), pages 73-80, 2007.","title":"Act local, think global: Width notions for tractable planning","authors":"Chen, Giménez ; ] Hubie Chen, Omer Giménez","year":"2007","venue":"Proc. of the 17th International Conference on Automated Planning and Scheduling (ICAPS'07)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chen and Giménez, 2010] Hubie Chen and Omer Giménez. Causal graphs and structurally restricted planning. Journal of Computer and System Sciences, 76(7):579-592, 2010.","title":"Causal graphs and structurally restricted planning","authors":"Chen, Giménez ; ] Hubie Chen, Omer Giménez","year":"2010","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chen et al., 2004] Y. Chen, C. Hsu, and B. Wah. SGPlan: Subgoal partitioning and resolution in planning. In Stefan Edelkamp, Jörg Hoffmann, Michael Littman, and Håkan Younes, editors, Proc. of the 4th International Planning Competition, 2004.","title":"SGPlan: Subgoal partitioning and resolution in planning","authors":"Y Chen, C Hsu, B Wah","year":"2004","venue":"Proc. of the 4th International Planning Competition","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Domshlak et al., 2015] Carmel Domshlak, Jörg Hoffmann, and Michael Katz. Red-black planning: A new systematic approach to partial delete relaxation. Artificial Intelligence, 221:73-114, 2015.","title":"Red-black planning: A new systematic approach to partial delete relaxation","authors":"Domshlak","year":"2015","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fickert and Hoffmann, 2017] Maximilian Fickert and Jörg Hoff- mann. Complete local search: Boosting hill-climbing through online heuristic-function refinement. In Proc. of the 27th In- ternational Conference on Automated Planning and Scheduling (ICAPS'17), 2017.","title":"Complete local search: Boosting hill-climbing through online heuristic-function refinement","authors":"Hoffmann Fickert","year":"2017","venue":"Proc. of the 27th International Conference on Automated Planning and Scheduling (ICAPS'17)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Giménez and Jonsson, 2008] Omer Giménez and Anders Jonsson. The complexity of planning problems with simple causal graphs. Journal of Artificial Intelligence Research, 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":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Hall et al., 2013] David Hall, Alon Cohen, David Burkett, and Dan Klein. Faster optimal planning with partial-order pruning. In Daniel Borrajo, Simone Fratini, Subbarao Kambhampati, and Angelo Oddi, editors, Proc. of the 23rd International Conference on Automated Planning and Scheduling (ICAPS'13), 2013.","title":"Faster optimal planning with partial-order pruning","authors":"David Hall, Alon Cohen, David Burkett, Dan Klein","year":"2013","venue":"Proc. of the 23rd International Conference on Automated Planning and Scheduling (ICAPS'13)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Helmert et al., 2014] Malte Helmert, Patrik Haslum, Jörg Hoff- mann, and Raz Nissim. Merge & shrink abstraction: A method for generating lower bounds in factored state spaces. Journal of the Association for Computing Machinery, 61(3), 2014.","title":"Merge & shrink abstraction: A method for generating lower bounds in factored state spaces","authors":"Malte Helmert, Patrik Haslum, Jörg Hoffmann, Raz Nissim","year":"2014","venue":"Journal of the Association for Computing Machinery","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward planning sys- tem. Journal of Artificial Intelligence Research, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert, Helmert","year":"2006","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hoffmann and Nebel, 2001] Jörg Hoffmann and Bernhard Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 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":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Hoffmann et al., 2004] Jörg Hoffmann, Julie Porteous, and Laura Sebastia. Ordered landmarks in planning. Journal of Artificial Intelligence Research, 22:215-278, 2004.","title":"Ordered landmarks in planning","authors":"Hoffmann","year":"2004","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hoffmann, 2005] Jörg Hoffmann. Where 'ignoring delete lists' works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research, 24:685-758, 2005.","title":"Where 'ignoring delete lists' works: Local search topology in planning benchmarks","authors":"Jörg Hoffmann, Hoffmann","year":"2005","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Jonsson and Bäckström, 1998] Peter Jonsson and Christer Bäck- ström. State-variable planning under structural restrictions: Al- gorithms and complexity. Artificial Intelligence, 100(1-2):125- 176, 1998.","title":"Peter Jonsson and Christer Bäckström. State-variable planning under structural restrictions: Algorithms and complexity","authors":"Bäckström Jonsson","year":"1998","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Katz and Domshlak, 2008] Michael Katz and Carmel Domshlak. New islands of tractability of cost-optimal planning. Journal of Artificial Intelligence Research, 32:203-288, 2008.","title":"New islands of tractability of cost-optimal planning","authors":"Domshlak Katz, Michael Katz, Carmel Domshlak","year":"2008","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Katz and Hoffmann, 2014] Michael Katz and Jörg Hoffmann. Mercury planner: Pushing the limits of partial delete relaxation. In IPC 2014 planner abstracts, pages 43-47, 2014.","title":"Mercury planner: Pushing the limits of partial delete relaxation","authors":"Hoffmann Katz, Michael Katz, Jörg Hoffmann","year":"2014","venue":"IPC 2014 planner abstracts","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Korf, 1987] Richard E. Korf. Planning as search: A quantitative approach. Artificial Intelligence, 33(1):65-88, 1987.","title":"Planning as search: A quantitative approach","authors":"Richard E Korf","year":"1987","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lipovetzky and Geffner, 2012] Nir Lipovetzky and Hector Geffner. Width and serialization of classical planning problems. In Luc De Raedt, editor, Proc. of the 20th European Conference on Artificial Intelligence (ECAI'12), pages 540-545, 2012.","title":"Width and serialization of classical planning problems","authors":"Geffner Lipovetzky, Nir Lipovetzky, Hector Geffner","year":"2012","venue":"Proc. of the 20th European Conference on Artificial Intelligence (ECAI'12)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Pommerening et al., 2015] Florian Pommerening, Malte Helmert, Gabriele Röger, and Jendrik Seipp. From non-negative to general operator cost partitioning. In Blai Bonet and Sven Koenig, edi- tors, Proc. of the 29th AAAI Conference on Artificial Intelligence (AAAI'15), pages 3335-3341, 2015.","title":"From non-negative to general operator cost partitioning","authors":"Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp","year":"2015","venue":"Proc. of the 29th AAAI Conference on Artificial Intelligence (AAAI'15)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Porteous et al., 2001] Julie Porteous, Laura Sebastia, and Jörg Hoffmann. On the extraction, ordering, and usage of landmarks in planning. In A. Cesta and D. Borrajo, editors, Proc. of the 6th European Conference on Planning (ECP'01), pages 37-48, 2001.","title":"On the extraction, ordering, and usage of landmarks in planning","authors":"Julie Porteous, Laura Sebastia, Jörg Hoffmann","year":"2001","venue":"Proc. of the 6th European Conference on Planning (ECP'01)","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Richter and Westphal, 2010] Silvia Richter and Matthias West- phal. The LAMA planner: Guiding cost-based anytime plan- ning with landmarks. Journal of Artificial Intelligence Research, 39:127-177, 2010.","title":"The LAMA planner: Guiding cost-based anytime planning with landmarks","authors":"Westphal Richter","year":"2010","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Richter et al., 2011] Silvia Richter, Matthias Westphal, and Malte Helmert. LAMA 2008 and 2011 (planner abstract). In IPC 2011 planner abstracts, pages 50-54, 2011.","title":"IPC 2011 planner abstracts","authors":"Silvia Richter, Matthias Westphal, Malte Helmert","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Röger and Helmert, 2010] Gabriele Röger and Malte Helmert. The more, the merrier: Combining heuristic estimators for sat- isficing planning. In Ronen I. Brafman, Hector Geffner, Jörg Hoffmann, and Henry A. Kautz, editors, Proc. of the 20th In- ternational Conference on Automated Planning and Scheduling (ICAPS'10), pages 246-249, 2010.","title":"The more, the merrier: Combining heuristic estimators for satisficing planning","authors":"Gabriele Röger, Malte Helmert","year":"2010","venue":"Proc. of the 20th International Conference on Automated Planning and Scheduling (ICAPS'10)","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Seipp et al., 2016] Jendrik Seipp, Florian Pommerening, Gabriele Röger, and Malte Helmert. Correlation complexity of classical planning domains. In Subbarao Kambhampati, editor, Proc. of the 25th International Joint Conference on Artificial Intelligence (IJCAI'16), pages 3242-3250, 2016.","title":"Correlation complexity of classical planning domains","authors":"Seipp","year":"2016","venue":"Proc. of the 25th International Joint Conference on Artificial Intelligence (IJCAI'16)","doi":null,"url":null,"internal_url":"/proceedings/2016/459"},{"position":28,"raw":"[Torralba and Hoffmann, 2015] Álvaro Torralba and Jörg Hoff- mann. Simulation-based admissible dominance pruning. In Qiang Yang, editor, Proc. of the 24th International Joint Con- ference on Artificial Intelligence (IJCAI'15), pages 1689-1695, 2015.","title":"Simulation-based admissible dominance pruning","authors":"Hoffmann Torralba, Álvaro Torralba, Jörg Hoffmann","year":"2015","venue":"Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI'15)","doi":null,"url":null,"internal_url":"/proceedings/2015/241"},{"position":29,"raw":"[Torralba, 2017] Álvaro Torralba. From qualitative to quantitative dominance pruning for optimal planning. In Carles Sierra, edi- tor, Proc. of the 26th International Joint Conference on Artificial Intelligence (IJCAI'17), pages 4426-4432, 2017.","title":"From qualitative to quantitative dominance pruning for optimal planning","authors":"Álvaro Torralba, Torralba","year":"2017","venue":"Carles Sierra, editor, Proc. of the 26th International Joint Conference on Artificial Intelligence (IJCAI'17)","doi":null,"url":null,"internal_url":"/proceedings/2017/618"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}