Unifying and Certifying Top-Quality Planning (2403.03176v1)
Abstract: The growing utilization of planning tools in practical scenarios has sparked an interest in generating multiple high-quality plans. Consequently, a range of computational problems under the general umbrella of top-quality planning were introduced over a short time period, each with its own definition. In this work, we show that the existing definitions can be unified into one, based on a dominance relation. The different computational problems, therefore, simply correspond to different dominance relations. Given the unified definition, we can now certify the top-quality of the solutions, leveraging existing certification of unsolvability and optimality. We show that task transformations found in the existing literature can be employed for the efficient certification of various top-quality planning problems and propose a novel transformation to efficiently certify loopless top-quality planning.
- Complexity Results for SAS+{}^{+}start_FLOATSUPERSCRIPT + end_FLOATSUPERSCRIPT Planning. Computational Intelligence, 11(4): 625–655.
- Unsolvability Certificates for Classical Planning. In Barbulescu, L.; Frank, J.; Mausam; and Smith, S. F., eds., Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), 88–97. AAAI Press.
- K* and Partial Order Reduction for Top-quality Planning. In Barták, R.; Ruml, W.; and Salzman, O., eds., Proceedings of the 16th Annual Symposium on Combinatorial Search (SoCS 2023). AAAI Press.
- K* Search Over Orbit Space for Top-k Planning. In Elkind, E., ed., Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023). IJCAI.
- Reshaping Diverse Planning. In Conitzer, V.; and Sha, F., eds., Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020), 9892–9899. AAAI Press.
- Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria. In Thiébaux, S.; and Yeoh, W., eds., Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022). AAAI Press.
- Top-Quality Planning: Finding Practically Useful Sets of Best Plans. In Conitzer, V.; and Sha, F., eds., Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020), 9900–9907. AAAI Press.
- A Novel Iterative Approach to Top-k Planning. In de Weerdt, M.; Koenig, S.; Röger, G.; and Spaan, M., eds., Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018), 132–140. AAAI Press.
- On K* Search for Top-k Planning. In Barták, R.; Ruml, W.; and Salzman, O., eds., Proceedings of the 16th Annual Symposium on Combinatorial Search (SoCS 2023). AAAI Press.
- Optimality Certificates for Classical Planning. In Koenig, S.; Stern, R.; and Vallati, M., eds., Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (ICAPS 2023). AAAI Press.
- Finding Diverse High-Quality Plans for Hypothesis Generation. In Kaminka, G. A.; Fox, M.; Bouquet, P.; Hüllermeier, E.; Dignum, V.; Dignum, F.; and van Harmelen, F., eds., Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), 1581–1582. IOS Press.
- Symbolic Top-k Planning. In Conitzer, V.; and Sha, F., eds., Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020), 9967–9974. AAAI Press.
- Loopless Top-K Planning. In Thiébaux, S.; and Yeoh, W., eds., Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022), 380–384. AAAI Press.