zbMATH — the first resource for mathematics

On hierarchical task networks. (English) Zbl 06658186
Michael, Loizos (ed.) et al., Logics in artificial intelligence. 15th European conference, JELIA 2016, Larnaca, Cyprus, November 9–11, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10021, 551-557 (2016).
Summary: In planning based on hierarchical task networks (HTN), plans are generated by refining high-level actions (“compound tasks”) into lower-level actions, until primitive actions are obtained that can be sent to execution. While a primitive action is defined by its precondition and effects, a high-level action is defined by zero, one or several methods: sets of (high-level or primitive) actions decomposing it together with a constraint. We give a semantics of HTNs in terms of dynamic logic with program inclusion. We propose postulates guaranteeing soundness and completeness of action refinement. We also show that hybrid planning can be analysed in the same dynamic logic framework.
For the entire collection see [Zbl 1350.68015].

68T27 Logic in artificial intelligence
Full Text: DOI
[1] Baral, C., Son, T.C.: Extending ConGolog to allow partial ordering. In: Jennings, N.R., Lespérance, Y. (eds.) ATAL 1999. LNCS (LNAI), vol. 1757, pp. 188–204. Springer, Heidelberg (2000). doi: 10.1007/10719619_14 · Zbl 0970.68634
[2] del Cerro, L.F., Penttonen, M.: Grammar logics. Logique Et Analyse 31(121–122), 123–134 (1988) · Zbl 0728.03025
[3] De Silva, L., Sardina, S., Padgham, L.: First principles planning in BDI systems. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), vol. 2, pp. 1105–1112. International Foundation for Autonomous Agents and Multiagent Systems (2009)
[4] Demri, S.: The complexity of regularity in grammar logics and related modal logics. J. Log. Comput. 11(6), 933–960 (2001). http://dx.doi.org/10.1093/logcom/11.6.933 · Zbl 1002.03018
[5] Erol, K., Hendler, J., Nau, D.S.: HTN planning: complexity and expressivity. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI), vol. 94, pp. 1123–1128 (1994)
[6] Gabaldon, A.: Programming hierarchical task networks in the situation calculus. In: Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling Systems Workshop on On-line Planning and Scheduling (2002) · Zbl 1341.68200
[7] Goldman, R.P.: A semantics for HTN methods. In: Gerevini, A., Howe, A.E., Cesta, A., Refanidis, I. (eds.) Proceedings of the 19th International Conference on Automated Planning and Scheduling, (ICAPS). AAAI (2009)
[8] Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000) · Zbl 0976.68108
[9] Herzig, A., Lorini, E., Perrussel, L., Xiao, Z.: BDI logics for BDI architectures: old problems, new perspectives. Künstliche Intelligenz (to appear)
[10] Herzig, A., Perrussel, L., Xiao, Z., Zhang, D.: Refinement of intentions. In: Michael, L., Kakas, A.C. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. xx–yy. Springer, Heidelberg (2016) · Zbl 06658187
[11] Kambhampati, S., Cutkosky, M.R., Tenenbaum, J.M., Lee, S.H.: Integrating general purpose planners and specialized reasoners: case study of a hybrid planning architecture. IEEE Trans. Syst. Man Cybern. 23(6), 1503–1518 (1993)
[12] Kambhampati, S., Mali, A., Srivastava, B.: Hybrid planning for partially hierarchical domains. In: Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI), pp. 882–888 (1998)
[13] Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004) · Zbl 1074.68613
[14] Sardina, S., de Silva, L., Padgham, L.: Hierarchical planning in BDI agent programming languages: a formal approach. In: Proceedings of the 5th International Conference on Autonomous Agents and Multiagent Systems, pp. 1001–1008. ACM (2006)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.