{"type":"ScholarlyArticle","title":"Landmarks for Numeric Planning Problems","authors":[{"name":"Enrico Scala","slug":"enrico-scala","given":"Enrico","family":"Scala","affiliation":"* The Australian National University , Canberra (AUS)"},{"name":"Patrik Haslum","slug":"patrik-haslum","given":"Patrik","family":"Haslum","affiliation":"* The Australian National University , Canberra (AUS)"},{"name":"Daniele Magazzeni","slug":"daniele-magazzeni","given":"Daniele","family":"Magazzeni","affiliation":"* The Australian National University , Canberra (AUS); * * King's College London , London , WC2R 2LS"},{"name":"Sylvie Thiébaux","slug":"sylvie-thiebaux","given":"Sylvie","family":"Thiébaux","affiliation":"* The Australian National University , Canberra (AUS)"}],"abstract":"The paper generalises the notion of landmarks for reasoning about planning problems involving propositional and numeric variables. Intuitively, numeric landmarks are regions in the metric space defined by the problem whose crossing is necessary for its resolution. The paper proposes a relaxation-based method for their automated extraction directly from the problem structure, and shows how to exploit them to infer what we call disjunctive and additive hybrid action landmarks. The justification of such a disjunctive representation results from the intertwined propositional and numeric structure of the problem. The paper exercises their use in two novel admissible LP-Based numeric heuristics, and reports experiments on cost-optimal numeric planning problems. Results show the heuristics are more informed and effective than previous work for problems involving a higher number of (sub)goals.","doi":"10.24963/ijcai.2017/612","url":"https://ijcai.org/proceedings/2017/612","pdf":"https://ijcai.org/proceedings/2017/0612.pdf","markdown":"https://ijcai.org/proceedings/2017/612.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/612","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":612,"pages":{"first":4384,"last":4390},"keywords":["Planning and Scheduling: Temporal and Hybrid planning","Planning and Scheduling: Search in Planning and Scheduling","Planning and Scheduling: Planning and Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Balas, 1998] Egon Balas. Disjunctive programming: Prop- erties of the convex hull of feasible points. Discrete Ap- plied Mathematics, 89(1-3):3-44, 1998.","title":"Disjunctive programming: Properties of the convex hull of feasible points","authors":"Egon Balas, Balas","year":"1998","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Coles and Coles, 2011] Amanda Jane Coles and Andrew Coles. LPRPG-P: relaxed plan heuristics for planning with preferences. In Proceedings of ICAPS, 2011.","title":"LPRPG-P: relaxed plan heuristics for planning with preferences","authors":"Amanda, Jane Coles, Andrew Coles","year":"2011","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Coles et al., 2010] A. J. Coles, A. I. Coles, M. Fox, and D. Long. Forward-chaining partial-order planning. In Pro- ceedings of ICAPS, 2010.","title":"Forward-chaining partial-order planning","authors":"A J Coles, A I Coles, M Fox, D Long","year":"2010","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Della Penna et al., 2009] Giuseppe Della Penna, Daniele Magazzeni, Fabio Mercorio, and Benedetto Intrigila. Up- murphi: A tool for universal planning on PDDL+ prob- lems. In Proceedings of ICAPS, 2009.","title":"Upmurphi: A tool for universal planning on PDDL+ problems","authors":"Giuseppe Della Penna, Daniele Magazzeni, Fabio Mercorio, Benedetto Intrigila","year":"2009","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Elkawkagy et al., 2012] Mohamed Elkawkagy, Pascal Bercher, Bernd Schattenberg, and Susanne Biundo. Improving hierarchical planning performance by the use of landmarks. In Proceedings of AAAI, 2012.","title":"Improving hierarchical planning performance by the use of landmarks","authors":"Mohamed Elkawkagy, Pascal Bercher, Bernd Schattenberg, Susanne Biundo","year":"2012","venue":"Proceedings of AAAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Eyerich et al., 2012] Patrick Eyerich, Robert Mattmüller, and Gabriele Röger. Using the context-enhanced additive heuristic for temporal and numeric planning. In Towards Service Robots for Everyday Environments -Recent Ad- vances in Designing Service Robots for Complex Tasks in Everyday Environments, pages 49-64. 2012.","title":"Using the context-enhanced additive heuristic for temporal and numeric planning","authors":"Patrick Eyerich, Robert Mattmüller, Gabriele Röger","year":"2012","venue":"Towards Service Robots for Everyday Environments -Recent Advances in Designing Service Robots for Complex Tasks in Everyday Environments","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Fox and Long, 2003] Maria Fox and Derek Long. PDDL2.1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. (JAIR), 20:61-124, 2003.","title":"PDDL2.1: an extension to PDDL for expressing temporal planning domains","authors":"Maria Fox, Derek Long","year":"2003","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fox and Long, 2006] Maria Fox and Derek Long. Mod- elling mixed discrete-continuous domains for planning. J. Artif. Intell. Res. (JAIR), 27:235-297, 2006.","title":"Modelling mixed discrete-continuous domains for planning","authors":"Maria Fox, Derek Long","year":"2006","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fox et al., 2011] Maria Fox, Derek Long, and Daniele Mag- azzeni. Automatic construction of efficient multiple bat- tery usage policies. In Proceedings of ICAPS, 2011.","title":"Automatic construction of efficient multiple battery usage policies","authors":"Maria Fox, Derek Long, Daniele Magazzeni","year":"2011","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":"/proceedings/2011/436"},{"position":10,"raw":"[Francès and Geffner, 2015] Guillem Francès and Hector Geffner. Modeling and computation in planning: Better heuristics from more expressive languages. In Proceed- ings of ICAPS, 2015.","title":"Guillem Francès and Hector Geffner. Modeling and computation in planning: Better heuristics from more expressive languages","authors":"Geffner Francès","year":"2015","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gerevini et al., 2008] Alfonso Gerevini, Ivan Saetti, and Alessandro Serina. An approach to efficient planning with numerical fluents and multi-criteria plan quality. Artificial Intelligence, 172(8-9):899-944, 2008.","title":"An approach to efficient planning with numerical fluents and multi-criteria plan quality","authors":"Alfonso Gerevini, Ivan Saetti, Alessandro Serina","year":"2008","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Getoor et al., 1997] Lise Getoor, Greger Ottosson, Markus P. J. Fromherz, and Björn Carlson. Effective redundant constraints for online scheduling. In Proceedings of IAAI, 1997.","title":"Effective redundant constraints for online scheduling","authors":"Lise Getoor, Greger Ottosson, Markus P J Fromherz, Björn Carlson","year":"1997","venue":"Proceedings of IAAI","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ghallab et al., 2004] Malik Ghallab, Dana S. Nau, and Paolo Traverso. Automated planning -theory and prac- tice. Elsevier, 2004.","title":"Automated planning -theory and practice","authors":"Malik Ghallab, Dana S Nau, Paolo Traverso","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Haslum et al., 2012] Patrik Haslum, John K. Slaney, and Sylvie Thiébaux. Minimal landmarks for optimal delete- free planning. In Proceedings of ICAPS, 2012.","title":"Minimal landmarks for optimal deletefree planning","authors":"Patrik Haslum, John K Slaney, Sylvie Thiébaux","year":"2012","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Helmert and Domshlak, 2009] Malte Helmert and Carmel Domshlak. Landmarks, critical paths and abstractions: What's the difference anyway? In Proceedings of ICAPS, 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 ICAPS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Helmert, 2002] Malte Helmert. Decidability and undecid- ability results for planning with numerical state variables. In On the Role of Ground Actions in Refinement Planning., pages 44-53, 2002.","title":"Decidability and undecidability results for planning with numerical state variables","authors":"Malte Helmert, Helmert","year":"2002","venue":"On the Role of Ground Actions in Refinement Planning","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hoffmann et al., 2004] Jörg Hoffmann, Julie Porteous, and Laura Sebastia. Ordered landmarks in planning. J. Artif. Intell. Res.(JAIR), 22:215-278, 2004.","title":"Ordered landmarks in planning","authors":"Jörg Hoffmann, Julie Porteous, Laura Sebastia","year":"2004","venue":"J. Artif. Intell. Res.(JAIR)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Hoffmann, 2003] Jörg Hoffmann. The metric-ff planning system: Translating \"ignoring delete lists\" to numeric state variables. J. Artif. Intell. Res. (JAIR), 20:291-341, 2003.","title":"The metric-ff planning system: Translating \"ignoring delete lists\" to numeric state variables","authors":"Jörg Hoffmann","year":"2003","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Karpas and Domshlak, 2009] Erez Karpas and Carmel Domshlak. Cost-optimal planning with landmarks. In Proceedings of IJCAI, 2009.","title":"Cost-optimal planning with landmarks","authors":"Erez Karpas, Carmel Domshlak","year":"2009","venue":"Proceedings of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2009/288"},{"position":20,"raw":"[Karpas et al., 2015] Erez Karpas, David Wang, Brian C Williams, Patrik Haslum, et al. Temporal landmarks: What must happen, and when. In Proceedings of ICAPS, 2015.","title":"Temporal landmarks: What must happen, and when","authors":"Erez Karpas, David Wang, Brian C Williams, Patrik Haslum","year":"2015","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Keyder et al., 2010] Emil Keyder, Silvia Richter, and Malte Helmert. Sound and complete landmarks for and/or graphs. In Proceedings of ECAI, 2010.","title":"Sound and complete landmarks for and/or graphs","authors":"Emil Keyder, Silvia Richter, Malte Helmert","year":"2010","venue":"Proceedings of ECAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Keyder et al., 2014] Emil Ragip Keyder, Jörg Hoffmann, and Patrik Haslum. Improving delete relaxation heuris- tics through explicitly represented conjunctions. J. Artif. Intell. Res.(JAIR), 50:487-533, 2014.","title":"Improving delete relaxation heuristics through explicitly represented conjunctions","authors":"Keyder","year":"2014","venue":"J. Artif. Intell. Res.(JAIR)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Löhr et al., 2012] Johannes Löhr, Patrick Eyerich, Thomas Keller, and Bernhard Nebel. A planning based framework for controlling hybrid systems. In Proceedings of ICAPS, 2012.","title":"A planning based framework for controlling hybrid systems","authors":"Johannes Löhr, Patrick Eyerich, Thomas Keller, Bernhard Nebel","year":"2012","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Pommerening et al., 2014] Florian Pommerening, Gabriele Röger, Malte Helmert, and Blai Bonet. Lp-based heuristics for cost-optimal planning. In Proceedings of ICAPS, 2014.","title":"Lp-based heuristics for cost-optimal planning","authors":"Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet","year":"2014","venue":"Proceedings of ICAPS","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Scala et al., 2016a] Enrico Scala, Patrik Haslum, and Sylvie Thiébaux. Heuristics for numeric planning via subgoaling. In Proceedings of IJCAI, 2016.","title":"Heuristics for numeric planning via subgoaling","authors":"Scala","year":"2016","venue":"Proceedings of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/457"},{"position":26,"raw":"[Scala et al., 2016b] Enrico Scala, Patrik Haslum, Sylvie Thiébaux, and Miquel Ramírez. Interval-based relaxation for general numeric planning. In Proceedings of ECAI, 2016.","title":"Interval-based relaxation for general numeric planning","authors":"Scala","year":"2016","venue":"Proceedings of ECAI","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Scala et al., 2016c] Enrico Scala, Miquel Ramírez, Patrik Haslum, and Sylvie Thiébaux. Numeric planning with dis- junctive global constraints via SMT. In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12-17, 2016., pages 276-284, 2016.","title":"Numeric planning with disjunctive global constraints via SMT","authors":"Scala","year":"2016","venue":"Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}