HTN-like solutions for classical planning problems: An application to BDI agent systems
- 1 April 2019
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 763, 12-37
Abstract
No abstract availableKeywords
Funding Information
- Australian Research Council (LP0882234)
This publication has 13 references indexed in Scilit:
- Declarative planning in procedural agent architecturesExpert Systems with Applications, 2013
- Planning in BDI agents: a survey of the integration of planning algorithms and agent reasoningThe Knowledge Engineering Review, 2013
- A BDI agent programming language with failure handling, declarative goals, and planningAutonomous Agents and Multi-Agent Systems, 2010
- A verification framework for agent programming with declarative goalsJournal of Applied Logic, 2007
- IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent EnvironmentAnnals of Mathematics and Artificial Intelligence, 2003
- An Architecture for AutonomyThe International Journal of Robotics Research, 1998
- Complexity results for HTN planningAnnals of Mathematics and Artificial Intelligence, 1996
- Complexity, decidability and undecidability results for domain-independent planningArtificial Intelligence, 1995
- Planning and reacting in uncertain and dynamic environmentsJournal of Experimental & Theoretical Artificial Intelligence, 1995
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971