Papers
Topics
Authors
Recent
2000 character limit reached

Bridging the Gap between Structural and Semantic Similarity in Diverse Planning (2310.01520v1)

Published 2 Oct 2023 in cs.AI

Abstract: Diverse planning is the problem of finding multiple plans for a given problem specification, which is at the core of many real-world applications. For example, diverse planning is a critical piece for the efficiency of plan recognition systems when dealing with noisy and missing observations. Providing diverse solutions can also benefit situations where constraints are too expensive or impossible to model. Current diverse planners operate by generating multiple plans and then applying a selection procedure to extract diverse solutions using a similarity metric. Generally, current similarity metrics only consider the structural properties of the given plans. We argue that this approach is a limitation that sometimes prevents such metrics from capturing why two plans differ. In this work, we propose two new domain-independent metrics which are able to capture relevant information on the difference between two given plans from a domain-dependent viewpoint. We showcase their utility in various situations where the currently used metrics fail to capture the similarity between plans, failing to capture some structural symmetries.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. 2017. Plan reordering and parallel execution—a parameterized complexity view. In Thirty-First AAAI Conference on Artificial Intelligence.
  2. 2022. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artificial Intelligence 303:103644.
  3. 2005. Course of action generation for cyber security using classical planning. In ICAPS, 12–21.
  4. Bryce, D. 2014. Landmark-based plan distance measures for diverse planning. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 24, 56–64.
  5. 1987. Diversity or discrimination?-asian americans in college. The Public Interest 87:49.
  6. 2011. Generating diverse plans using quantitative and qualitative plan distance metrics. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 25, 946–951.
  7. Erol, K. 1995. Hierarchical task network planning: formalization, analysis, and implementation. University of Maryland, College Park.
  8. 1977. Selecting subsets of maximum diversity, ms. Technical report, IS Report.
  9. 1991. Cutting stock problems and solution procedures. European Journal of Operational Research 54(2):141–150.
  10. 2005. Finding diverse and similar solutions in constraint programming. In AAAI, volume 5, 372–377.
  11. 2020. Reshaping diverse planning. In Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020), 9892–9899. AAAI Press.
  12. 2022. Who needs these operators anyway: Top quality planning with operator subset criteria. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 32, 179–183.
  13. 2018. A novel iterative approach to top-k planning. In Twenty-Eighth International Conference on Automated Planning and Scheduling.
  14. 1993. Analyzing and modeling the maximum diversity problem by zero-one programming. Decision Sciences 24(6):1171–1185.
  15. 2003. The 3rd international planning competition: Results and analysis. J. Artif. Intell. Res. 20:1–59.
  16. 1991. Systematic Nonlinear Planning. In Dean, T. L., and McKeown, K. R., eds., Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, USA, July 14-19, 1991, Volume 2, 634–639. AAAI Press / The MIT Press.
  17. McConnell, S. 1988. The new battle over immigration. Fortune 117(10):89.
  18. 1999. Generating qualitatively different plans through metatheoretic biases. In AAAI/IAAI, 570–576.
  19. 2012. Generating diverse plans to handle unknown and partially known user preferences. Artificial Intelligence 190:1–31.
  20. 2014. New algorithms for the top-k planning problem. In Proceedings of the scheduling and planning applications workshop (spark) at the 24th international conference on automated planning and scheduling (icaps), 10–16.
  21. 2014. Evaluating diversity in classical planning. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 24, 253–261.
  22. 2016. Mathematical programming models for optimizing partial-order plan flexibility. In Proceedings of the Twenty-second European Conference on Artificial Intelligence, 1044–1052.
  23. 2016. Finding diverse high-quality plans for hypothesis generation. In ECAI 2016. IOS Press. 1581–1582.
  24. 2018. An ai planning solution to scenario generation for enterprise risk management. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 32.
  25. 2013. Hypothesis exploration for malware detection using planning. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 27, 883–889.
  26. 2020. Symbolic top-k planning. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, 9967–9974.
  27. 2007. Domain independent approaches for finding diverse plans. In IJCAI, 2016–2022.
  28. Weld, D. S. 1994. An introduction to least commitment planning. AI Mag. 15(4):27–61.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.