{"type":"ScholarlyArticle","title":"On the Compilability of Bounded Numeric Planning","authors":[{"name":"Nicola Gigante","slug":"nicola-gigante","given":"Nicola","family":"Gigante","affiliation":"Free University of Bozen- Bolzano , Italy"},{"name":"Enrico Scala","slug":"enrico-scala","given":"Enrico","family":"Scala","affiliation":"University of Brescia , Italy"}],"abstract":"Bounded numeric planning, where each numeric variable domain is bounded, is PSPACE-complete, but such a complexity result does not capture how hard it really is, since the same holds even for the practically much easier STRIPS fragment. A finer way to compare the difficulty of planning formalisms is through the notion of compilability, which has been however extensively studied only for classical planning by Nebel. This paper extends  Nebel's framework to the setting of bounded numeric planning. First, we identify a variety of numeric fragments differing on the degree of the polynomials involved and the availability of features such as conditional effects and Boolean conditions; then we study the compilability of these fragments to each other and to the classical fragments. Surprisingly, numeric and classical planning with conditional effects and Boolean conditions can be compiled both ways preserving plan size exactly, while the same does not hold when targeting pure STRIPS. Our study reveals also that numeric fragments cluster into two equivalence classes separated by the availability of incomplete initial state specifications, a feature allowing to specify uncertainty in the initial state.","doi":"10.24963/ijcai.2023/593","url":"https://ijcai.org/proceedings/2023/593","pdf":"https://ijcai.org/proceedings/2023/0593.pdf","markdown":"https://ijcai.org/proceedings/2023/593.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/593","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Planning and Scheduling","track":"Main Track","number":593,"pages":{"first":5341,"last":5349},"keywords":["Planning and Scheduling: PS: Theoretical foundations of planning","Knowledge Representation and Reasoning: KRR: Knowledge compilation"],"videos":[],"references":[{"position":1,"raw":"[Bertolucci et al., 2019] Riccardo Bertolucci, Alessio Cap- itanelli, Marco Maratea, Fulvio Mastrogiovanni, and Mauro Vallati. Automated planning encodings for the ma- nipulation of articulated objects in 3d with gravity. In Pro- ceedings of AI*IA, pages 135-150, 2019.","title":"Automated planning encodings for the manipulation of articulated objects in 3d with gravity","authors":"Riccardo Bertolucci, Alessio Capitanelli, Marco Maratea, Fulvio Mastrogiovanni, Mauro Vallati","year":"2019","venue":"Proceedings of AI*IA","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bozzelli et al., 2020] Laura Bozzelli, Alberto Molinari, An- gelo Montanari, Adriano Peron, and Gerhard J. Woegin- ger. Timeline-based planning over dense temporal do- mains. Theor. Comput. Sci., 813:305-326, 2020.","title":"Woeginger. Timeline-based planning over dense temporal domains","authors":"Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J","year":"2020","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Buss et al., 1992] Samuel R. Buss, Stephen A. Cook, A. Gupta, and V. Ramachandran. An optimal paral- lel algorithm for formula evaluation. SIAM J. Comput., 21(4):755-780, 1992.","title":"An optimal parallel algorithm for formula evaluation","authors":"R Samuel, Stephen A Buss, A Cook, V Gupta, Ramachandran","year":"1992","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bylander, 1994] Tom Bylander. The computational com- plexity of propositional STRIPS planning. Artif. Intell., 69(1-2):165-204, 1994.","title":"The computational complexity of propositional STRIPS planning","authors":"Tom Bylander","year":"1994","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Della Monica et al., 2020] Dario Della Monica, Nicola Gi- gante, Salvatore La Torre, and Angelo Montanari. Com- plexity of qualitative timeline-based planning. In Pro- ceedings of the 27th International Symposium on Tempo- ral Representation and Reasoning, volume 178 of LIPIcs, pages 16:1-16:13, 2020.","title":"Complexity of qualitative timeline-based planning","authors":"Dario Della, Monica, Nicola Gigante, Salvatore La Torre, Angelo Montanari","year":"2020","venue":"Proceedings of the 27th International Symposium on Temporal Representation and Reasoning","doi":null,"url":null,"internal_url":null},{"position":6,"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., 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","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gigante et al., 2020] Nicola Gigante, Andrea Micheli, An- gelo Montanari, and Enrico Scala. Decidability and com- plexity of action-based temporal planning over dense time. In Proceedings of The Thirty-Fourth AAAI Conference on Artificial Intelligence, pages 9859-9866. AAAI Press, 2020.","title":"Decidability and complexity of action-based temporal planning over dense time","authors":"Nicola Gigante, Andrea Micheli, Angelo Montanari, Enrico Scala","year":"2020","venue":"Proceedings of The Thirty-Fourth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Haslum and Jonsson, 1999] Patrik Haslum and Peter Jons- son. Some results on the complexity of planning with in- complete information. In Susanne Biundo and Maria Fox, editors, Proceedings of the 5th European Conference on Planning, volume 1809 of Lecture Notes in Computer Sci- ence, pages 308-318. Springer, 1999.","title":"Some results on the complexity of planning with incomplete information","authors":"Jonsson Haslum, Patrik Haslum, Peter Jonsson","year":"1999","venue":"Proceedings of the 5th European Conference on Planning","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Haslum et al., 2019] Patrik Haslum, Nir Lipovetzky, Daniele Magazzeni, and Christian Muise. An Introduction to the Planning Domain Definition Language. Synthesis Lectures on Artificial Intelligence and Machine Learning.","title":"An Introduction to the Planning Domain Definition Language","authors":"Haslum","year":"2019","venue":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Helmert, 2002] Malte Helmert. Decidability and undecid- ability results for planning with numerical state variables. In Proc,. of International Conference on Artificial Intelli- gence Planning and Scheduling (AIPS 2002), pages 44- 53, 2002.","title":"Decidability and undecidability results for planning with numerical state variables","authors":"Malte Helmert, Helmert","year":"2002","venue":"Proc,. of International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Hoffmann, 2003] Jörg Hoffmann. The metric-ff planning system: Translating \"ignoring delete lists\" to numeric state variables. J. Artif. Intell. Res., 20:291-341, 2003.","title":"The metric-ff planning system: Translating \"ignoring delete lists\" to numeric state variables","authors":"Jörg Hoffmann, Hoffmann","year":"2003","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Jung, 1985] Hermann Jung. Depth efficient transformations of arithmetic into boolean circuits. In Lothar Budach, edi- tor, Fundamentals of Computation Theory, FCT '85, Cot- tbus, GDR, September 9-13, 1985, volume 199 of Lec- ture Notes in Computer Science, pages 167-174. Springer, 1985.","title":"Depth efficient transformations of arithmetic into boolean circuits","authors":"Hermann Jung","year":"1985","venue":"Lothar Budach, editor, Fundamentals of Computation Theory, FCT '85","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kiam et al., 2020] Jane Jean Kiam, Enrico Scala, Miquel Ramírez Javega, and Axel Schulte. An ai- based planning framework for HAPS in a time-varying environment. In ICAPS, pages 412-420. AAAI Press, 2020.","title":"An aibased planning framework for HAPS in a time-varying environment","authors":"Jane Jean Kiam, Enrico Scala, Miquel Ramírez Javega, Axel Schulte","year":"2020","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kuroiwa et al., 2021] Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, and J. Christopher Beck. Lm-cut and operator counting heuristics for opti- mal numeric planning with simple conditions. In Susanne Biundo, Minh Do, Robert Goldman, Michael Katz, Qiang Yang, and Hankz Hankui Zhuo, editors, Proceedings of the Thirty-First International Conference on Automated Plan- ning and Scheduling, pages 210-218. AAAI Press, 2021.","title":"Lm-cut and operator counting heuristics for optimal numeric planning with simple conditions","authors":"Kuroiwa","year":"2021","venue":"Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Nebel, 2000] Bernhard Nebel. On the compilability and ex- pressive power of propositional planning formalisms. J. Artif. Intell. Res., 12:271-315, 2000.","title":"On the compilability and expressive power of propositional planning formalisms","authors":"Bernhard Nebel","year":"2000","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[O'Donnell, 2014] Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014.","title":"Analysis of Boolean Functions","authors":"O' Ryan, Donnell","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Parkinson et al., 2012] Simon Parkinson, Andrew Longstaff, Andrew Crampton, and Peter Gregory. The application of automated planning to machine tool calibration. In ICAPS. AAAI, 2012.","title":"The application of automated planning to machine tool calibration","authors":"Simon Parkinson, Andrew Longstaff, Andrew Crampton, Peter Gregory","year":"2012","venue":"ICAPS. AAAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Percassi et al., 2021] Francesco Percassi, Enrico Scala, and Mauro Vallati. Translations from discretised PDDL+ to numeric planning. In ICAPS, pages 252-261. AAAI Press, 2021.","title":"Translations from discretised PDDL+ to numeric planning","authors":"Francesco Percassi, Enrico Scala, Mauro Vallati","year":"2021","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Piacentini et al., 2018] Chiara Piacentini, Margarita P. Cas- tro, André Augusto Ciré, and J. Christopher Beck. Linear and integer programming-based heuristics for cost-optimal numeric planning. In AAAI, pages 6254-6261. AAAI Press, 2018.","title":"Linear and integer programming-based heuristics for cost-optimal numeric planning","authors":"Chiara Piacentini, Margarita P Castro, André, Augusto Ciré, J Christopher Beck","year":"2018","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Rintanen, 2007] Jussi Rintanen. Complexity of concur- rent temporal planning. In Mark S. Boddy, Maria Fox, and Sylvie Thiébaux, editors, Proceedings of the Seven- teenth International Conference on Automated Planning and Scheduling, pages 280-287. AAAI, 2007.","title":"Complexity of concurrent temporal planning","authors":"Jussi Rintanen","year":"2007","venue":"Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Scala et al., 2016] Enrico Scala, Patrik Haslum, Sylvie Thiébaux, and Miquel Ramírez. Interval-based relaxation for general numeric planning. In Proceedings of ECAI, volume 285, pages 655-663, 2016.","title":"Interval-based relaxation for general numeric planning","authors":"Enrico Scala, Patrik Haslum, Sylvie Thiébaux, Miquel Ramírez","year":"2016","venue":"Proceedings of ECAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Scala et al., 2020] Enrico Scala, Patrik Haslum, Sylvie Thiébaux, and Miquel Ramírez. Subgoaling techniques for satisficing and optimal numeric planning. J. Artif. In- tell. Res., 68:691-752, 2020.","title":"Subgoaling techniques for satisficing and optimal numeric planning","authors":"Enrico Scala, Patrik Haslum, Sylvie Thiébaux, Miquel Ramírez","year":"2020","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Vallati et al., 2016] Mauro Vallati, Daniele Magazzeni, Bart De Schutter, Lukás Chrpa, and Thomas Leo Mc- Cluskey. Efficient macroscopic urban traffic models for reducing congestion: A PDDL+ planning approach. In Proceedings of AAAI, pages 3188-3194, 2016.","title":"Efficient macroscopic urban traffic models for reducing congestion: A PDDL+ planning approach","authors":"Mauro Vallati, Daniele Magazzeni, Bart De Schutter, Lukás Chrpa, Thomas Leo Mc-Cluskey","year":"2016","venue":"Proceedings of AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Vollmer, 1999] Heribert Vollmer. Introduction to Circuit Complexity -A Uniform Approach. Texts in Theoretical Computer Science. An EATCS Series. Springer, 1999.","title":"Introduction to Circuit Complexity -A Uniform Approach","authors":"Heribert Vollmer","year":"1999","venue":"Texts in Theoretical Computer Science. An EATCS Series","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[von zur Gathen and Seroussi, 1991] Joachim von zur Ga- then and Gadiel Seroussi. Boolean circuits versus arith- metic circuits. Inf. Comput., 91(1):142-154, 1991.","title":"Joachim von zur Gathen and Gadiel Seroussi. Boolean circuits versus arithmetic circuits","authors":"Seroussi Von Zur Gathen","year":"1991","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Wegener, 1987] Ingo Wegener. The complexity of Boolean functions. Wiley-Teubner, 1987.","title":"The complexity of Boolean functions","authors":"Ingo Wegener","year":"1987","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}