Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Boundaries of Tractability in Hierarchical Task Network Planning (2401.14174v1)

Published 25 Jan 2024 in cs.CC and cs.AI

Abstract: We study the complexity-theoretic boundaries of tractability for three classical problems in the context of Hierarchical Task Network Planning: the validation of a provided plan, whether an executable plan exists, and whether a given state can be reached by some plan. We show that all three problems can be solved in polynomial time on primitive task networks of constant partial order width (and a generalization thereof), whereas for the latter two problems this holds only under a provably necessary restriction to the state space. Next, we obtain an algorithmic meta-theorem along with corresponding lower bounds to identify tight conditions under which general polynomial-time solvability results can be lifted from primitive to general task networks. Finally, we enrich our investigation by analyzing the parameterized complexity of the three considered problems, and show that (1) fixed-parameter tractability for all three problems can be achieved by replacing the partial order width with the vertex cover number of the network as the parameter, and (2) other classical graph-theoretic parameters of the network (including treewidth, treedepth, and the aforementioned partial order width) do not yield fixed-parameter tractability for any of the three problems.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (84)
  1. Tight bounds for HTN planning with task insertion. In Proc. of the 24th International Joint Conference on Artificial Intelligence, pages 1502–1508, 2015.
  2. The complexity of planning revisited - A parameterized analysis. In Proc. of the 26th AAAI Conference on Artificial Intelligence, pages 1735–1741, 2012.
  3. Parameterized complexity and kernel bounds for hard planning problems. In Proc. of the 8th International Conference on Algorithms and Complexity, volume 7878 of LNCS, pages 13–24. Springer, 2013.
  4. Bounding and computing obstacle numbers of graphs. In Proc. of the 30th Annual European Symposium on Algorithms, volume 244 of LIPIcs, pages 11:1–11:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
  5. How to find a good explanation for clustering? Artif. Intel., 322:103948, 2023.
  6. On the verification of totally-ordered HTN plans. In Proc. of the 33rd IEEE International Conference on Tools with Artificial Intelligence, pages 263–267, 2021.
  7. On the complexity of HTN plan verification and its implications for plan recognition. In Proc. of the 25th International Conference on Automated Planning and Scheduling, volume 25, pages 25–33, 2015.
  8. Finding optimal solutions in HTN planning - A SAT-based approach. In Proc. of the 28th International Joint Conference on Artificial Intelligence, pages 5500–5508, 2019.
  9. A multivariate complexity analysis of the material consumption scheduling problem. J. Sched., 26:369–382, 2023.
  10. A survey on hierarchical planning – one abstract idea, many concrete realizations. In Proc. of the 28th International Joint Conference on Artificial Intelligence, pages 6267–6275, 2019.
  11. Parameterized algorithms for book embedding problems. J. Graph Algorithms Appl., 24(4):603–620, 2020.
  12. Hierarchical task networks as domain-specific language for planning surgical interventions. In Proc. of the 13th International Conference on Intelligent Autonomous Systems, volume 302 of Advances in Intelligent Systems and Computing, pages 1095–1105. Springer, 2014.
  13. The parameterized complexity of network microaggregation. In Proc. of the 37th AAAI Conference on Artificial Intelligence, pages 6262–6270, 2023.
  14. Complexity of efficient and envy-free resource allocation: Few agents, resources, or utility levels. In Proc. of the 25th International Joint Conference on Artificial Intelligence, pages 102–108, 2016.
  15. Tom Bylander. The computational complexity of propositional STRIPS planning. Artif. Intel., 69(1-2):165–204, 1994.
  16. Complexity results for SAS+{}^{+}start_FLOATSUPERSCRIPT + end_FLOATSUPERSCRIPT planning. Computational Intelligence, 11(4):625–655, 1995.
  17. A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci., 81(7):1311–1332, 2015.
  18. David Chapman. Planning for conjunctive goals. Artif. Intel., 32(3):333–377, 1987.
  19. Fully observable nondeterministic HTN planning – Formalisation and complexity results. In Proc. of the 31st International Conference on Automated Planning and Scheduling, volume 31, pages 74–84, 2021.
  20. Parameterized Algorithms. Springer, Cham, 2015.
  21. On simplified NP-complete variants of monotone 3-SAT. Discr. Appl. Math., 292:45–58, 2021.
  22. The complexity of envy-free graph cutting. In Proc. of the 31st International Joint Conference on Artificial Intelligence, pages 237–243, 2022.
  23. Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in math. Springer, 2012.
  24. Robert P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Math., 51(1):161–166, 1950.
  25. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.
  26. The parameterized complexity of clustering incomplete data. In Proc. of the 35th AAAI Conference on Artificial Intelligence, pages 7296–7304, 2021.
  27. Parameterized complexity of envy-free resource allocation in social networks. Artif. Intel., 315:103826, 2023.
  28. HTN planning: Complexity and expressivity. In Proc. of the 12th National Conference on Artificial Intelligence, volume 2, pages 1123–1128, 1994.
  29. Complexity results for HTN planning. Annals of Mathematics and Artificial Intelligence, 18:69–93, 1996.
  30. On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci., 298(2):317–324, 2003.
  31. On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci., 410(1):53–61, 2009.
  32. Strips: A new approach to the application of theorem proving to problem solving. Artif. Intel., 2(3):189–208, 1971.
  33. An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica, 7(1):49–65, 1987.
  34. Modification-fair cluster editing. In Proc. of the 36th AAAI Conference on Artificial Intelligence, pages 6631–6638, 2022.
  35. The complexity of Bayesian network learning: Revisiting the superstructure. In Advances in Neural Information Processing Systems 34 (NeurIPS 2021), pages 430–442, 2021.
  36. Are there any good digraph width measures? J. Comb. Theory, Ser. B, 116:250–286, 2016.
  37. The complexity landscape of resource-constrained scheduling. In Proc. of the 29th International Joint Conference on Artificial Intelligence, pages 1741–1747, 2020.
  38. On the parameterized complexity of clustering incomplete data into subspaces of small rank. In Proc. of the 34th AAAI Conference on Artificial Intelligence, pages 3906–3913, 2020.
  39. The complexity of object association in multiple object tracking. In Proc. of the 35th AAAI Conference on Artificial Intelligence, pages 1388–1396, 2021.
  40. The complexity of k-means clustering when little is known. In Proc. of the 39th International Conference on Machine Learning, volume 162 of PMLR, pages 6960–6987, 2022.
  41. Miguel García-Remesal. Using hierarchical task network planning techniques to create custom web search services over multiple biomedical databases. In Proc. of the 12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, volume 5178 of LNCS, pages 42–49. Springer, 2008.
  42. Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, N.Y., 1979.
  43. On the decidability of HTN planning with task insertion. In Proc. of the 22nd International Joint Conference on Artificial Intelligence, pages 1955–1961, 2011.
  44. HTN planning: Overview, comparison, and beyond. Artif. Intel., 222:124–156, 2015.
  45. Careflow planning: From time-annotated clinical guidelines to temporal hierarchical task networks. In Proc. of the 13th Conference on Artificial Intelligence in Medicine in Europe, volume 6747 of LNCS, pages 265–275. Springer, 2011.
  46. From business process models to hierarchical task network planning domains. Knowl. Eng. Rev., 28(2):175–193, 2013.
  47. Automated generation of patient-tailored electronic care pathways by translating computer-interpretable guidelines into hierarchical task networks. Artif. Intel. Medicine, 57(2):91–109, 2013.
  48. Learning Bayesian networks under sparsity constraints: A parameterized complexity analysis. J. Artif. Intel. Res., 74:1225–1267, 2022.
  49. Efficient Bayesian network structure learning via parameterized local search on topological orderings. In Proc. of the 35th AAAI Conference on Artificial Intelligence, pages 12328–12335, 2021.
  50. On the parameterized complexity of polytree learning. In Proc. of the 30th International Joint Conference on Artificial Intelligence, pages 4221–4227, 2021.
  51. Hollow heaps. ACM Transactions on Algorithms, 13(3):42:1–42:27, 2017.
  52. Autonomously constructing hierarchical task networks for planning and human-robot collaboration. In Proc. of the IEEE International Conference on Robotics and Automation, pages 5469–5476, 2016.
  53. Equitable scheduling on a single machine. J. Sched., 26:209–225, 2023.
  54. Learning hierarchical task networks for nondeterministic planning domains. In Proc. of the 21st International Joint Conference on Artificial Intelligence, pages 1708–1714, 2009.
  55. On guiding search in HTN planning with classical planning heuristics. In Proc. of the 28th International Joint Conference on Artificial Intelligence, pages 6171–6175, 2019.
  56. Landmark generation in HTN planning. In Proc. of the 35th AAAI Conference on Artificial Intelligence, volume 35, pages 11826–11834, 2021.
  57. Compiling HTN plan verification problems into HTN planning problems. In Proc. of the 32nd International Conference on Automated Planning and Scheduling, pages 145–150, 2022.
  58. Ravi Kannan. Minkowski’s convex body theorem and integer programming. Math. of Operations Research, 12(3):415––440, 1987.
  59. Parameterized algorithms for colored clustering. In Proc. of the 37th AAAI Conference on Artificial Intelligence, pages 4400–4408, 2023.
  60. Dynamic collaborative business process formulation via ontologised hierarchical task network (HTN) planning. In Proc. of the IEEE International Conference on Web Services, pages 959–967, 2009.
  61. Business-owl (BOWL) - A hierarchical task network ontology for dynamic business process decomposition and formulation. IEEE Trans. Serv. Comput., 5(2):246–259, 2012.
  62. Parameterized complexity of optimal planning: A detailed map. In Proc. of the 23rd International Joint Conference on Artificial Intelligence, pages 954–961, 2013.
  63. A hierarchical task-network planner based on symbolic model checking. In Proc. of the 15th International Conference on Automated Planning and Scheduling, pages 300–309, 2005.
  64. H. W. Lenstra. Integer programming with a fixed number of variables. Math. of Operations Research, 8(4):538––548, 1983.
  65. Learning probabilistic hierarchical task networks to capture user preferences. In Proc. of the 21st International Joint Conference on Artificial Intelligence, pages 1754–1759, 2009.
  66. Was fixing this really that hard? On the complexity of correcting HTN domains. In Proc. of the 37th AAAI Conference on Artificial Intelligence, volume 37, pages 12032–12040, 2023.
  67. Hierarchical task network-based emergency task planning with incomplete information, concurrency and uncertain duration. Knowl. Based Syst., 112:67–79, 2016.
  68. Advanced real-time hierarchical task network: Long-term behavior in real-time games. In Proc. of the 17th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, volume 17, pages 208–212, 2021.
  69. Sparsity: Graphs, Structures, and Algorithms, volume 28 of Algorithms and combinatorics. Springer, 2012.
  70. Revealing hidden preconditions and effects of compound HTN planning tasks – A complexity analysis. In Proc. of the 35th AAAI Conference on Artificial Intelligence, volume 35, pages 11903–11912, 2021.
  71. Adversarial hierarchical-task network planning for complex real-time games. In Proc. of the 24th International Joint Conference on Artificial Intelligence, pages 1652–1658, 2015.
  72. Parameterized complexity results for exact Bayesian network structure learning. J. Artif. Intel. Res., 46:263–302, 2013.
  73. A system for generating storyline visualizations using hierarchical task network planning. Comput. Graph., 78:64–75, 2019.
  74. Stigmergic reasoning over hierarchical task networks. In Proc. of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems, volume 2, pages 1195–1196, 2009.
  75. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7(3):309–322, 1986.
  76. Dennis J. N. J. Soemers and Mark H. M. Winands. Hierarchical task network plan reuse for video games. In Proc. of the IEEE Conference on Computational Intelligence and Games, pages 1–8, 2016.
  77. HTN planning with preferences. In Proc. of the 21st International Joint Conference on Artificial Intelligence, pages 1790–1797, 2009.
  78. Towards we-intentional human-robot interaction using theory of mind and hierarchical task network. In Proc. of the 5th International Conference on Computer-Human Interaction Research and Applications, pages 291–299. SCITEPRESS, 2021.
  79. Commitment strategies in hierarchical task network planning. In Proc. of the 13th National Conference on Artificial Intelligence, volume 1, pages 536–542, 1996.
  80. Two-layer planarization parameterized by feedback edge set. Theor. Comput. Sci., 494:99–111, 2013.
  81. Precedence-constrained scheduling problems parameterized by partial order width. In Discrete Optimization and Operations Research, volume 9869 of LNCS, pages 105–120, 2016.
  82. On the complexity of iterated shuffle. J. Comput. Syst. Sci., 28(3):345–358, 1984.
  83. Hierarchical task network planning with task insertion and state constraints. In Proc. of the 26th International Joint Conference on Artificial Intelligence, pages 4463–4469, 2017.
  84. Resource-constrained hierarchical task network planning under uncontrollable durations for emergency decision-making. J. Intel. Fuzzy Syst., 33(6):3819–3834, 2017.

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now