{"type":"ScholarlyArticle","title":"A Native Qualitative Numeric Planning Solver Based on AND/OR Graph Search","authors":[{"name":"Hemeng Zeng","slug":"hemeng-zeng","given":"Hemeng","family":"Zeng","affiliation":"Dept. of Computer Science , Sun Yat-sen University , Guangzhou 510006 , China"},{"name":"Yikun Liang","slug":"yikun-liang","given":"Yikun","family":"Liang","affiliation":"Dept. of Computer Science , Sun Yat-sen University , Guangzhou 510006 , China"},{"name":"Yongmei Liu","slug":"yongmei-liu","given":"Yongmei","family":"Liu","affiliation":"Dept. of Computer Science , Sun Yat-sen University , Guangzhou 510006 , China"}],"abstract":"Qualitative numeric planning (QNP) is classical planning extended with non-negative real variables that can be increased or decreased by some arbitrary amount. Existing approaches for solving QNP problems are exclusively based on compilation to fully observable nondeterministic planning (FOND) problems or FOND+ problems, i.e., FOND problems with explicit fairness assumptions. However, the FOND-compilation approaches suffer from some limitations, such as difficulties to generate all strong cyclic solutions for FOND problems or introducing a great many extra variables and actions. In this paper, we propose a simpler characterization of QNP solutions and a new approach to solve QNP problems based on directly searching for a solution, which is a closed and terminating subgraph that contains a goal node, in the AND/OR graphs induced by QNP problems. Moreover, we introduce a pruning strategy based on termination tests on subgraphs. We implemented a native solver DSET based on the proposed approach and compared the performance of it with that of the two compilation-based approaches. Experimental results show that DSET is faster than the FOND-compilation approach by one order of magnitude, and comparable with the FOND+-compilation approach.","doi":"10.24963/ijcai.2022/651","url":"https://ijcai.org/proceedings/2022/651","pdf":"https://ijcai.org/proceedings/2022/0651.pdf","markdown":"https://ijcai.org/proceedings/2022/651.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/651","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Planning and Scheduling","track":"Main Track","number":651,"pages":{"first":4693,"last":4700},"keywords":["Planning and Scheduling: Planning under Uncertainty","Planning and Scheduling: Planning Algorithms"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986865","length_sec":72,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985008","length_sec":299,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Bercher and Mattmüller, 2009] Pascal Bercher and Robert Mattmüller. Solving non-deterministic planning problems with pattern database heuristics. In KI 2009: Advances in Artificial Intelligence, pages 57-64, 2009.","title":"Solving non-deterministic planning problems with pattern database heuristics","authors":"Mattmüller Bercher, Pascal Bercher, Robert Mattmüller","year":"2009","venue":"KI 2009: Advances in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bonet and Geffner, 2018] Blai Bonet and Hector Geffner. Features, projections, and representation change for gener- alized planning. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pages 4667-4673, 2018.","title":"Features, projections, and representation change for generalized planning","authors":"Geffner Bonet, Blai Bonet, Hector Geffner","year":"2018","venue":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2018/649"},{"position":3,"raw":"[Bonet and Geffner, 2020] Blai Bonet and Hector Geffner. Qualitative numeric planning: Reductions and complexity. J. Artif. Intell. Res., 69:923-961, 2020.","title":"Qualitative numeric planning: Reductions and complexity","authors":"Geffner ; ] Blai Bonet, Hector Bonet, Geffner","year":"2020","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bonet et al., 2019] Blai Bonet, Guillem Francès, and Hector Geffner. Learning features and abstract actions for com- puting generalized plans. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), pages 2703- 2710, 2019.","title":"Learning features and abstract actions for computing generalized plans","authors":"Blai Bonet, Guillem Francès, Hector Geffner","year":"2019","venue":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brewka et al., 2011] Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92-103, 2011.","title":"Answer set programming at a glance","authors":"Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski","year":"2011","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Geffner and Geffner, 2018] Tomas Geffner and Hector Geffner. Compact policies for fully observable non- deterministic planning as SAT. In Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS), pages 88-96, 2018.","title":"Compact policies for fully observable nondeterministic planning as SAT","authors":"Geffner Geffner, Tomas Geffner, Hector Geffner","year":"2018","venue":"Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Hansen and Zilberstein, 2001] Eric A. Hansen and Shlomo Zilberstein. LAO*: A heuristic search algorithm that finds solutions with loops. Artif. Intell., 129(1-2):35-62, 2001.","title":"LAO*: A heuristic search algorithm that finds solutions with loops","authors":"Eric A Hansen, Shlomo Zilberstein","year":"2001","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Illanes and McIlraith, 2019] León Illanes and Sheila A. McIlraith. Generalized planning via abstraction: Arbi- trary numbers of objects. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), pages 7610- 7618, 2019.","title":"Generalized planning via abstraction: Arbitrary numbers of objects","authors":"Mcilraith Illanes, León Illanes, Sheila A Mcilraith","year":"2019","venue":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Levesque, 2005] Hector J. Levesque. Planning with loops. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), pages 509-515, 2005.","title":"Planning with loops","authors":"Hector J Levesque","year":"2005","venue":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Mattmüller et al., 2010] Robert Mattmüller, Manuela Or- tlieb, Malte Helmert, and Pascal Bercher. Pattern database heuristics for fully observable nondeterministic planning. In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS), pages 105- 112, 2010.","title":"Pattern database heuristics for fully observable nondeterministic planning","authors":"Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher","year":"2010","venue":"Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Muise et al., 2012] Christian J. Muise, Sheila A. McIlraith, and J. Christopher Beck. Improved non-deterministic planning by exploiting state relevance. In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS), 2012.","title":"Improved non-deterministic planning by exploiting state relevance","authors":"Christian J Muise, Sheila A Mcilraith, J Christopher Beck","year":"2012","venue":"Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Nilsson, 1982] Nils J. Nilsson. Principles of Artificial Intel- ligence. Springer, 1982.","title":"Principles of Artificial Intelligence","authors":"Nils J Nilsson","year":"1982","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Rodriguez et al., 2021] Ivan D. Rodriguez, Blai Bonet, Se- bastian Sardiña, and Hector Geffner. Flexible FOND plan- ning with explicit fairness assumptions. In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS), pages 290-298, 2021.","title":"Flexible FOND planning with explicit fairness assumptions","authors":"Ivan D Rodriguez, Blai Bonet, Sebastian Sardiña, Hector Geffner","year":"2021","venue":"Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Srivastava et al., 2011] Siddharth Srivastava, Shlomo Zil- berstein, Neil Immerman, and Hector Geffner. Qualita- tive numeric planning. In Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI), pages 1010- 1016, 2011.","title":"Qualitative numeric planning","authors":"Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner","year":"2011","venue":"Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}