HTN-like solutions for classical planning problems: An application to BDI agent systems

de Silva, L, Padgham, L and Sardina, S 2019, 'HTN-like solutions for classical planning problems: An application to BDI agent systems', Theoretical Computer Science, vol. 763, pp. 12-37.


Document type: Journal Article
Collection: Journal Articles

Title HTN-like solutions for classical planning problems: An application to BDI agent systems
Author(s) de Silva, L
Padgham, L
Sardina, S
Year 2019
Journal name Theoretical Computer Science
Volume number 763
Start page 12
End page 37
Total pages 26
Publisher Elsevier
Abstract In this paper we explore the question of what characterises a desirable plan of action and how such a plan could be computed, in the context of systems that already possess a certain amount of hierarchical domain knowledge. In contrast to past work in this setting, which focuses on generating low-level plans, losing much of the domain knowledge inherent in such systems, we argue that plans ought to be HTN-like or abstract, i.e., re-use and respect the user-supplied know-how in the underlying domain. In doing so, we recognise an intrinsic tension between striving for abstract plans but ensuring that unnecessary actions, not linked to the specific goal to be achieved, are avoided. We explore this tension by characterising the set of "ideal" abstract plans that are non-redundant but maximally abstract, and then develop a more limited yet feasible account in which a given (arbitrary) abstract plan is "specialised" into one such non-redundant plan that is as abstract as possible. We present an algorithm that can compute such specialisations, and analyse the theoretical properties of our proposal.
Subject Adaptive Agents and Intelligent Robotics
Keyword(s) Abstract Solutions
Classical Planning
HTN Planning
DOI - identifier 10.1016/j.tcs.2019.01.034
Copyright notice © 2019 Elsevier B.V. All rights reserved.
ISSN 0304-3975
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Altmetric details:
Access Statistics: 8 Abstract Views  -  Detailed Statistics
Created: Thu, 23 May 2019, 08:44:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us