Abstract
Task networks are a powerful tool for AI planning. Classical approaches like forward STN planning and SHOP typically devise non-deterministic algorithms that can be operationalized using classical graph search techniques such as A*. For two reasons, however, this strategy is sometimes inefficient. First, identical tasks might be resolved several times within the search process, i.e., the same subproblem is solved repeatedly instead of being reused. Second, large parts of the search space might be redundant if some of the objects in the planning domain are substitutable.
In this paper, we present an extension of simple task networks that avoid these problems and enable a much more efficient planning process. Our main innovation is the creation of new constants during planning combined with AND-OR-graph search. To demonstrate the advantages of these techniques, we present a case study in the field of automated service composition, in which search space reductions of several magnitudes can be achieved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Sources are available at http://www.felixmohr.de/en/research/crc901/itn.
References
Alford, R., Shivashankar, V., Roberts, M., Frank, J., Aha, D.W.: Hierarchical planning: relating task and goal decomposition with task sharing. In: Proceedings of IJCAI, pp. 3022–3029 (2016)
Castillo, L., Fdez-Olivares, J., García-Pérez, Ó., Palao, F.: Temporal enhancements of an HTN planner. In: Marín, R., Onaindía, E., Bugarín, A., Santos, J. (eds.) CAEPIA 2005. LNCS, vol. 4177, pp. 429–438. Springer, Heidelberg (2006). doi:10.1007/11881216_45
Erol, K., Hendler, J.A., Nau, D.S.: UMCP: a sound and complete procedure for hierarchical task-network planning. In: Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, University of Chicago, Chicago, Illinois, USA, pp. 249–254, 13–15 June 1994
Feurer, M., Klein, A., Eggensperger, K., Springenberg, J., Blum, M., Hutter, F.: Efficient and robust automated machine learning. In: Advances in Neural Information Processing Systems, pp. 2962–2970 (2015)
Frank, E., Kramer, S.: Ensembles of nested dichotomies for multi-class problems. In: Proceedings of the Twenty-First International Conference on Machine Learning (ICML 2004), Banff, Alberta, Canada, 4–8 July 2004
Georgievski, I., Aiello, M.: HTN planning: overview, comparison, and beyond. Artif. Intell. 222, 124–156 (2015)
Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning - Theory and Practice. Elsevier, Amsterdam (2004)
Klusch, M., Gerber, A., Schmidt, M.: Semantic web service composition planning with OWLS-XPlan. In: Proceedings of the 1st International AAAI Fall Symposium on Agents and the Semantic Web, pp. 55–62 (2005)
Mohr, F.: Issues of automated software composition in AI planning. In: ACM/IEEE International Conference on Automated Software Engineering, ASE 2014, Vasteras, Sweden, pp. 895–898, 15–19 September 2014
Mohr, F.: Automated Software and Service Composition - A Survey and Evaluating Review. Springer Briefs in Computer Science. Springer, Heidelberg (2016). doi:10.1007/978-3-319-34168-2
Mohr, F.: Towards automated service composition under quality constraints. Ph.D. thesis, Paderborn University (2017)
Mohr, F., Jungmann, A., Kleine Büning, H.: Automated online service composition. In: 2015 IEEE International Conference on Services Computing, SCC, pp. 57–64 (2015)
Nau, D.S., Au, T., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D., Yaman, F.: SHOP2: an HTN planning system. J. Artif. Intell. Res. (JAIR) 20, 379–404 (2003)
Shivashankar, V., Kuter, U., Nau, D.S., Alford, R.: A hierarchical goal-based formalism and algorithm for single-agent planning. In: Proceedings of AAMAS, pp. 981–988 (2012)
Sirin, E., Parsia, B., Wu, D., Hendler, J.A., Nau, D.S.: HTN planning for web service composition using SHOP2. J. Web Semant. 1(4), 377–396 (2004)
Smith, D.E., Frank, J., Cushing, W.: The ANML language. In: Proceedings of KEPS (2008)
Weber, I.M.: Semantic Methods for Execution-level Business Process Modeling: Modeling Support Through Process Verification and Service Composition. LNBIP, vol. 40. Springer, Heidelberg (2009). doi:10.1007/978-3-642-05085-5
Wilkins, D.E.: Can AI planners solve practical problems? Comput. Intell. 6(4), 232–246 (1990)
Wu, D., Parsia, B., Sirin, E., Hendler, J., Nau, D.: Automating DAML-S web services composition using SHOP2. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 195–210. Springer, Heidelberg (2003). doi:10.1007/978-3-540-39718-2_13
Acknowledgements
This work was supported by the German Research Foundation (DFG) within the Collaborative Research Center “On-The-Fly Computing” (SFB 901).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Mohr, F., Lettmann, T., Hüllermeier, E. (2017). Planning with Independent Task Networks. In: Kern-Isberner, G., Fürnkranz, J., Thimm, M. (eds) KI 2017: Advances in Artificial Intelligence. KI 2017. Lecture Notes in Computer Science(), vol 10505. Springer, Cham. https://doi.org/10.1007/978-3-319-67190-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-67190-1_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67189-5
Online ISBN: 978-3-319-67190-1
eBook Packages: Computer ScienceComputer Science (R0)