Automatically generating abstractions for planning
Artificial Intelligence
Hybrid planning for partially hierarchical domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent Environment
Annals of Mathematics and Artificial Intelligence
Propice-Plan: Toward a Unified Framework for Planning and Execution
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Propositional planning in BDI agents
Proceedings of the 2004 ACM symposium on Applied computing
Hierarchical planning in BDI agent programming languages: a formal approach
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Making a strong business case for multiagent technology
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
Abstract reasoning for planning and coordination
Journal of Artificial Intelligence Research
On the Life-Cycle of BDI Agent Goals
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Discovering Semantic Web services using SPARQL and intelligent agents
Web Semantics: Science, Services and Agents on the World Wide Web
ISReal: an open platform for semantic-based 3D simulations in the 3D internet
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part II
A BDI agent programming language with failure handling, declarative goals, and planning
Autonomous Agents and Multi-Agent Systems
Operational behaviour for executing, suspending, and aborting goals in BDI agent systems
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Autonomous Agents and Multi-Agent Systems
Argonauts: a working system for motivated cooperative agents
Annals of Mathematics and Artificial Intelligence
Temporal planning in dynamic environments for P-CLAIM agents
LADS'09 Proceedings of the Second international conference on Languages, Methodologies, and Development Tools for Multi-Agent Systems
Measuring plan coverage and overlap for agent reasoning
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Hierarchical planning about goals and commitments
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Declarative planning in procedural agent architectures
Expert Systems with Applications: An International Journal
An operational semantics for the goal life-cycle in BDI agents
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
BDI (Belief, Desire, Intention) agent systems are very powerful, but they lack the ability to incorporate planning. There has been some previous work to incorporate planning within such systems. However, this has either focussed on producing low-level plan sequences, losing much of the domain knowledge inherent in BDI systems, or has been limited to HTN (Hierarchical Task Network) planning, which cannot find plans other than those specified by the programmer. In this work, we incorporate classical planning into a BDI agent, but in a way that respects and makes use of the procedural domain knowledge available, by producing abstract plans that can be executed using such knowledge. In doing so, we recognize an intrinsic tension between striving for abstract plans and, at the same time, ensuring that unnecessary actions, unrelated to the specific goal to be achieved, are avoided. We explore this tension, by first characterizing the set of "ideal" abstract plans that are non-redundant while maximally abstract, and then developing a more limited but feasible account in which an abstract plan is "specialized" into a new abstract plan that is non-redundant and preserves abstraction as much as possible. We describe an algorithm to compute such a plan specialization, as well as algorithms for the production of a valid high level plan, by deriving abstract planning operators from the BDI program.