First principles planning in BDI systems

First principles planning in BDI systems

De Silva, L, Sardina, S and Padgham, L 2009, 'First principles planning in BDI systems', in Keith S. Decker (ed.) Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, Hungary, 10-15 May, 2009, pp. 1105-1112.

Document type:	Conference Paper
Collection:	Conference Papers

Attached Files
Name			Description	MIMEType		Size	Downloads
n2006013614.pdf			Published Version		application/pdf	659.54KB	37

Title	First principles planning in BDI systems
Author(s)	De Silva, L Sardina, S Padgham, L
Year	2009
Conference name	8th International Conference on Autonomous Agents and Multiagent Systems
Conference location	Hungary
Conference dates	10-15 May, 2009
Proceedings title	Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems
Editor(s)	Keith S. Decker
Publisher	International Foundation for Autonomous Agents and Multiagent Systems
Place of publication	Hungary
Start page	1105
End page	1112
Total pages	8
Abstract	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.
Subjects	Natural Language Processing
Keyword(s)	Distributed artificial intelligence intelligent agents Languages and structures General Terms Theory Algorithms

Access Statistics:	33 Abstract Views, 37 File Downloads - Detailed Statistics
Created:	Fri, 09 Sep 2011, 07:50:00 EST by Catalyst Administrator