{"type":"ScholarlyArticle","title":"Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning","authors":[{"name":"Marcel Steinmetz","slug":"marcel-steinmetz","given":"Marcel","family":"Steinmetz","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":"A key technique for proving unsolvability in classical planning are dead-end detectors \\Delta: effectively testable criteria sufficient for unsolvability, pruning (some) unsolvable states during search. Related to this, a recent proposal is the identification of traps prior to search, compact representations of non-goal state sets T that cannot be escaped. Here, we create new synergy across these ideas. We define a generalized concept of traps, relative to a given dead-end detector \\Delta, where T can be escaped, but only into dead-end states detected by \\Delta. We show how to learn compact representations of such T during search, extending the reach of \\Delta. Our experiments show that this can be quite beneficial. It improves coverage for many unsolvable benchmark planning domains and dead-end detectors \\Delta, in particular on resource-constrained domains where it outperforms the state of the art.","doi":"10.24963/ijcai.2017/614","url":"https://ijcai.org/proceedings/2017/614","pdf":"https://ijcai.org/proceedings/2017/0614.pdf","markdown":"https://ijcai.org/proceedings/2017/614.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/614","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, IIIA-CSIC","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":614,"pages":{"first":4398,"last":4404},"keywords":["Combinatorial & Heuristic Search: Heuristic Search","Planning and Scheduling: Search in Planning and Scheduling","Planning and Scheduling: Planning Algorithms"],"videos":[],"references":[{"position":1,"raw":"[Bacchus, 2001] Fahiem Bacchus. The AIPS'00 planning competi- tion. AI Magazine, 22(3):47-56, 2001.","title":"Fahiem Bacchus. The AIPS'00 planning competition","authors":"Bacchus","year":"2001","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bäckström et al., 2013] Christer Bäckström, Peter Jonsson, and Simon Ståhlberg. Fast detection of unsolvable planning instances using local consistency. Proc. SOCS'13, 29-37.","title":"Fast detection of unsolvable planning instances using local consistency","authors":"Christer Bäckström, Peter Jonsson, Simon Ståhlberg","year":null,"venue":"Proc. SOCS'","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Blum and Furst, 1997] Avrim L. Blum and Merrick L. Furst. Fast planning through planning graph analysis. AI, 90(1-2):279-298, 1997.","title":"Fast planning through planning graph analysis","authors":"L Avrim, Merrick L Blum, Furst","year":"1997","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bradley, 2011] Aaron R. Bradley. Sat-based model checking with- out unrolling. Proc. VMCAI'11, 70-87.","title":"Sat-based model checking without unrolling","authors":"Aaron R Bradley","year":null,"venue":"Proc. VMCAI'11","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Coles et al., 2012] Amanda Jane Coles, Andrew Coles, Angel García Olaya, Sergio Jiménez, Carlos Linares López, Scott San- ner, and Sungwook Yoon. A survey of the seventh international planning competition. AI Magazine, 33(1), 2012.","title":"A survey of the seventh international planning competition","authors":"Amanda Jane Coles, Andrew Coles, Angel García Olaya, Sergio Jiménez, Carlos Linares López, Scott Sanner, Sungwook Yoon","year":"2012","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Coles et al., 2013] Amanda Jane Coles, Andrew Coles, Maria Fox, and Derek Long. A hybrid LP-RPG heuristic for modelling nu- meric resource flows in planning. JAIR, 46:343-412, 2013.","title":"A hybrid LP-RPG heuristic for modelling numeric resource flows in planning","authors":"Amanda Jane Coles, Andrew Coles, Maria Fox, Derek Long","year":"2013","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Domshlak and Mirkis, 2015] Carmel Domshlak and Vitaly Mirkis. Deterministic oversubscription planning as heuristic search: Ab- stractions and reformulations. JAIR, 52:97-169, 2015.","title":"Carmel Domshlak and Vitaly Mirkis. Deterministic oversubscription planning as heuristic search: Abstractions and reformulations","authors":"Mirkis Domshlak","year":"2015","venue":"JAIR","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. AI, 221:73-114, 2015.","title":"Red-black planning: A new systematic approach to partial delete relaxation","authors":"Domshlak","year":"2015","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Edelkamp et al., 2004] Stefan Edelkamp, Alberto Lluch-Lafuente, and Stefan Leue. Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology Transfer, 5(2-3):247-267, 2004.","title":"Directed explicit-state model checking in the validation of communication protocols","authors":"Stefan Edelkamp, Alberto Lluch-Lafuente, Stefan Leue","year":"2004","venue":"International Journal on Software Tools for Technology Transfer","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Edelkamp, 2001] Stefan Edelkamp. Planning with pattern databases. Proc. ECP'01, 13-24.","title":"Stefan Edelkamp. Planning with pattern databases","authors":"Edelkamp","year":"2001","venue":"Proc. ECP'01","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gerevini et al., 2009] Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, and Yannis Dimopoulos. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. AI, 173(5-6):619- 668, 2009.","title":"Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners","authors":"Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, Yannis Dimopoulos","year":"2009","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gnad et al., 2016] Daniel Gnad, Marcel Steinmetz, and Jörg Hoff- mann. Django: Unchaining the power of red-black planning. UIPC 2016 planner abstracts, 19-23.","title":"Django: Unchaining the power of red-black planning","authors":"Daniel Gnad, Marcel Steinmetz, Jörg Hoffmann","year":null,"venue":"UIPC 2016 planner abstracts","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Haslum and Geffner, 2000] Patrik Haslum and Hector Geffner. Admissible heuristics for optimal planning. Proc. AIPS'00, 140- 149.","title":"Admissible heuristics for optimal planning","authors":"Geffner Haslum, Patrik Haslum, Hector Geffner","year":"2000","venue":"Proc. AIPS'","doi":null,"url":null,"internal_url":null},{"position":14,"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. JACM, 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":"JACM","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward planning sys- tem. JAIR, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert, Helmert","year":"2006","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hoffmann and Edelkamp, 2005] Jörg Hoffmann and Stefan Edelkamp. The deterministic part of ipc-4: An overview. JAIR, 24:519-579, 2005.","title":"The deterministic part of ipc-4: An overview","authors":"Edelkamp Hoffmann, Jörg Hoffmann, Stefan Edelkamp","year":"2005","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hoffmann et al., 2014] Jörg Hoffmann, Peter Kissmann, and Álvaro Torralba. \"Distance\"? Who Cares? Tailoring merge-and- shrink heuristics to detect unsolvability. Proc. ECAI'14.","title":"Distance\"? Who Cares? Tailoring merge-andshrink heuristics to detect unsolvability","authors":"Hoffmann","year":"2014","venue":"Proc. ECAI'14","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kambhampati, 2000] Subbarao Kambhampati. Planning graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in graphplan. JAIR, 12:1-34, 2000.","title":"Planning graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in graphplan","authors":"Subbarao Kambhampati","year":"2000","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kolobov et al., 2012] Andrey Kolobov, Mausam, and Daniel S. Weld. Discovering hidden structure in factored MDPs. AI, 189:19-47, 2012.","title":"Discovering hidden structure in factored MDPs","authors":"Andrey Kolobov, Daniel S Mausam, Weld","year":"2012","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kupferschmid et al., 2006] Sebastian Kupferschmid, Jörg Hoff- mann, Henning Dierks, and Gerd Behrmann. Adapting an AI planning heuristic for directed model checking. Proc. SPIN 2006, 35-52.","title":"Adapting an AI planning heuristic for directed model checking","authors":"Sebastian Kupferschmid, Jörg Hoffmann, Henning Dierks, Gerd Behrmann","year":"2006","venue":"Proc. SPIN","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kupferschmid et al., 2008] Sebastian Kupferschmid, Jörg Hoff- mann, and Kim G. Larsen. Fast directed model checking via Russian doll abstraction. Proc. TACAS'08, 203-217.","title":"Fast directed model checking via Russian doll abstraction","authors":"Sebastian Kupferschmid, Jörg Hoffmann, Kim G Larsen","year":null,"venue":"Proc. TACAS'","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Laborie and Ghallab, 1995] P. Laborie and M. Ghallab. Planning with sharable resource constraints. Proc. IJCAI'95, 1643-1649.","title":"Planning with sharable resource constraints","authors":"P Laborie, M Ghallab","year":null,"venue":"Proc. IJCAI'95","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lipovetzky et al., 2016] Nir Lipovetzky, Christian J. Muise, and Hector Geffner. Traps, invariants, and dead-ends. Proc. ICAPS'16, 211-215.","title":"Traps, invariants, and dead-ends","authors":"Nir Lipovetzky, Christian J Muise, Hector Geffner","year":null,"venue":"Proc. ICAPS'","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Long and Fox, 1999] Derek Long and Maria Fox. Efficient imple- mentation of the plan graph in stan. JAIR, 10:87-115, 1999.","title":"Efficient implementation of the plan graph in stan","authors":"Derek Long, Maria Fox","year":"1999","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Long and Fox, 2003] Derek Long and Maria Fox. The 3rd inter- national planning competition: Results and analysis. JAIR, 20:1- 59, 2003.","title":"The 3rd international planning competition: Results and analysis","authors":"Derek Long, Maria Fox","year":"2003","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Nakhost et al., 2012] Hootan Nakhost, Jörg Hoffmann, and Martin Müller. Resource-constrained planning: A Monte Carlo random walk approach. Proc. ICAPS'12, 181-189.","title":"Resource-constrained planning: A Monte Carlo random walk approach","authors":"Hootan Nakhost, Jörg Hoffmann, Martin Müller","year":null,"venue":"Proc. ICAPS'","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Pommerening and Seipp, 2016] Florian Pommerening and Jendrik Seipp. Fast downward dead-end pattern database. UIPC 2016 planner abstracts, 2-2.","title":"Florian Pommerening and Jendrik Seipp. Fast downward dead-end pattern database","authors":"Seipp Pommerening","year":"2016","venue":"UIPC 2016 planner abstracts","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Pommerening et al., 2014] Florian Pommerening, Gabriele Röger, Malte Helmert, and Blai Bonet. LP-based heuristics for cost- optimal planning. Proc. ICAPS'14.","title":"LP-based heuristics for costoptimal planning","authors":"Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet","year":null,"venue":"Proc. ICAPS'14","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Pommerening et al., 2015] Florian Pommerening, Malte Helmert, Gabriele Röger, and Jendrik Seipp. From non-negative to general operator cost partitioning. Proc. AAAI'15, 3335-3341.","title":"From non-negative to general operator cost partitioning","authors":"Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp","year":null,"venue":"Proc. AAAI'15","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Seipp et al., 2016] Jendrik Seipp, Florian Pommerening, Silvan Sievers, and Martin Wehrle. Fast downward aidos. UIPC 2016 planner abstracts, 28-38.","title":"Fast downward aidos","authors":"Seipp","year":"2016","venue":"UIPC 2016 planner abstracts","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Smith, 2004] David E. Smith. Choosing objectives in over- subscription planning. Proc. ICAPS'04, 393-401.","title":"Choosing objectives in oversubscription planning","authors":"David E Smith","year":null,"venue":"Proc. ICAPS'","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Steinmetz and Hoffmann, 2016a] Marcel Steinmetz and Jörg Hoffmann. Clone: A critical-path driven clause learner. UIPC 2016 planner abstracts, 24-27.","title":"Clone: A critical-path driven clause learner","authors":"Hoffmann Steinmetz, Marcel Steinmetz, Jörg Hoffmann","year":"2016","venue":"UIPC 2016 planner abstracts","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Steinmetz and Hoffmann, 2016b] Marcel Steinmetz and Jörg Hoffmann. Towards clause-learning state space search: Learning to recognize dead-ends. Proc. AAAI'16.","title":"Towards clause-learning state space search: Learning to recognize dead-ends","authors":"Hoffmann Steinmetz, Marcel Steinmetz, Jörg Hoffmann","year":"2016","venue":"Proc. AAAI'16","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Steinmetz and Hoffmann, 2017] Marcel Steinmetz and Jörg Hoff- mann. State space search nogood learning: Online refinement of critical-path dead-end detectors in planning. AI, 2017. In press.","title":"State space search nogood learning: Online refinement of critical-path dead-end detectors in planning","authors":"Hoffmann Steinmetz, Marcel Steinmetz, Jörg Hoffmann","year":"2017","venue":"AI","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Suda, 2014] Martin Suda. Property directed reachability for auto- mated planning. JAIR, 50:265-319, 2014.","title":"Property directed reachability for automated planning","authors":"Martin Suda","year":"2014","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Torralba and Alcázar, 2013] Álvaro Torralba and Vidal Alcázar. Constrained symbolic search: On mutexes, BDD minimization and more. Proc. SOCS'13, 175-183.","title":"Constrained symbolic search: On mutexes, BDD minimization and more","authors":"Alcázar Torralba, Álvaro Torralba, Vidal Alcázar","year":"2013","venue":"Proc. SOCS'","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Torralba et al., 2016] Álvaro Torralba, Jörg Hoffmann, and Peter Kissmann. MS-Unsat and SimulationDominance: Merge-and- shrink and dominance pruning for proving unsolvability. UIPC 2016 planner abstracts, 12-15.","title":"MS-Unsat and SimulationDominance: Merge-andshrink and dominance pruning for proving unsolvability","authors":"Álvaro Torralba, Jörg Hoffmann, Peter Kissmann","year":null,"venue":"UIPC 2016 planner abstracts","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Torralba, 2016] Álvaro Torralba. Sympa: Symbolic perimeter ab- stractions for proving unsolvability. UIPC 2016 planner ab- stracts, 8-11.","title":"Sympa: Symbolic perimeter abstractions for proving unsolvability","authors":"Álvaro Torralba, Torralba","year":"2016","venue":"UIPC 2016 planner abstracts","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}