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

DOI10.1016/J.TCS.2019.01.034zbMath1411.68141OpenAlexW2912661944WikidataQ128450605 ScholiaQ128450605MaRDI QIDQ1727994

Lin Padgham, Lavindra de Silva, Sebastian Sardiña

Publication date: 21 February 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://www.repository.cam.ac.uk/handle/1810/290124

zbMATH Keywords

classical planningabstract solutionsHTN planning

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Uses Software

• AgentSpeak
• SHOP2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity results for HTN planning
• Complexity, decidability and undecidability results for domain-independent planning
• IMPACTing SHOP: Putting an AI planner into a multi-agent environment
• A verification framework for agent programming with declarative goals
• STRIPS: A new approach to the application of theorem proving to problem solving
• Planning and reacting in uncertain and dynamic environments

This page was built for publication: HTN-like solutions for classical planning problems: an application to BDI agent systems