HTN planning: Overview, comparison, and beyond

Georgievski, Ilche; Aiello, Marco

doi:10.1016/j.artint.2015.02.002

Cited by 108 publications

(66 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The problem of automatic Web service composition generation is closely related to the problem of Goal-Oriented Action Planning (GOAP) in artificial intelligence (AI) [37], [39]. In literature, several AI planning based techniques for automatic composition are available: STRIPS-based [39], PDDLbased [40], HTN-based [41], [42], etc. Though theoretically possible, they present a number of complexities in practical implementation, such as, generating and maintaining heavy amount of additional information (for instance, task library in [39]) hinders the automation process.…”

Section: Related Workmentioning

confidence: 99%

Web Service Interaction Modeling and Verification Using Recursive Composition Algebra

Gopal¹,

Gangadharan

Padmanabhan

et al. 2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

The design principle of composability among Web services is one of the most crucial reasons for the success and popularity of Web services. However, achieving error-free automatic Web service composition is still a challenge. In this paper, we propose a recursive composition based modeling and verification technique for Web service interaction. The application of recursive composition over a Web service with respect to a given set of Web services yields a recursive composition interaction graph (RCIG). In order to capture the requirement specifications of a Web service interaction scenario, we propose recursive composition specification language (RCSL) as a requirement specification language. Further, we employ the proposed RCIG as an interpretation model to interpret the semantics of a RCSL formula. Our verification technique is based on the generation and analysis of all possible interaction patterns. Performance evaluation results, provided in this paper, show that our proposition is implementable for the real world applications. The key advantages of the proposed approach are: (i) it does not require explicit system modeling as in model checking based approaches, (ii) it captures primitive characteristics of Web service interaction patterns, such as recursive composition, sequential and parallel flow, etc, and (iii) it supports automatic composition of services.

show abstract

Section: Related Workmentioning

confidence: 99%

Web Service Interaction Modeling and Verification Using Recursive Composition Algebra

Gopal¹,

Gangadharan

Padmanabhan

et al. 2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…For example people, hammers, matchsticks, fuel, and storage space can be resources in our model, but information or time can not. Georgievski and Aiello (2015) argue that time is a consumable resource. We argue that time cannot be regarded as a resource at all, because time lacks the exclusivity that is essential for something to be considered a resource.…”

Section: Tasks and Resourcesmentioning

confidence: 99%

Dynamic Resource and Task Management

Klinik¹,

Jansen

Bolderheij

2018

Nl Arms

View full text Add to dashboard Cite

Carrying out maritime missions comprises many phases from preparation to execution. In the long term, we would like to have an integrated toolchain that supports the crew at every phase. In this paper, we study concepts for resource and task management in the execution phase. When the tasks to be executed have been identified, the question arises who should be assigned to them. This is both a scheduling and an assignment problem. We narrow down what kind of problem we have at hand to get an understanding what a first step towards an integrated command and control system could look like. This also enables us to classify our problem with the existing literature on planning and scheduling. We develop a domain model for tasks and resources, their connection via capabilities, together with assessment functions to compare assignments. We study what kind of information would be needed to give useful scheduling advice.

show abstract

“…This is very powerful because the preconditions allow to prune quickly unpromising decompositions. A comprehensive comparison of these different works is proposed in [28] and a complexity analysis of HTN planning is available in [26,29]. Many works based on this approach were developed during the last decade.…”

Section: Related Workmentioning

confidence: 99%

Grounding of HTN Planning Domain

Ramoul

Pellier

Fiorino

et al. 2017

Int. J. Artif. Intell. Tools

View full text Add to dashboard Cite

Many Artificial Intelligence techniques have been developed for intelligent and autonomous systems to act and make rational decisions based on perceptions of the world state. Among these techniques, HTN (Hierarchical Task Network) planning is one of the most used in practice. HTN planning is based on expressive languages allowing to specify complex expert knowledge for real world domains. At the same time, many preprocessing techniques for classical planning were proposed to speed up the search. One of these technique, named grounding, consists in enumerating and instantiating all the possible actions from the planning problem descriptions. This technique has proven its effectiveness. Therefore, combining the expressiveness of HTN planning with the efficiency of the grounding preprocessing techniques used in classical planning is a very challenging issue. In this paper, we propose a generic algorithm to ground the domain representation for HTN planning. We show experimentally that grounding process improves the performances of state of the art HTN planners on a range of planning problems from the International Planning Competition (IPC).

show abstract

HTN planning: Overview, comparison, and beyond

Cited by 108 publications

References 38 publications

Web Service Interaction Modeling and Verification Using Recursive Composition Algebra

Web Service Interaction Modeling and Verification Using Recursive Composition Algebra

Dynamic Resource and Task Management

Grounding of HTN Planning Domain

Contact Info

Product

Resources

About