Abstract
This paper aims to describe the relationship between propositional planning systems and the process of means-end reasoning used by BDI agents. To show such relationship, we define a mapping from BDI mental states to prepositional planning problems and from prepositional plans back to mental states. In order to test the viability of such mapping, we have implemented it in an extension of a BDI agent model through the use of Graphplan as the propositional planning algorithm. The implementation was applied to model a case study of an agent controlled production cell.
Original language | English |
---|---|
Title of host publication | Proceedings of the ACM Symposium on Applied Computing |
Pages | 58-63 |
Number of pages | 6 |
Volume | 1 |
Publication status | Published - 2004 |
Externally published | Yes |
Event | Applied Computing 2004 - Nicosia, Cyprus Duration: 14 Mar 2004 → 17 Mar 2004 |
Conference
Conference | Applied Computing 2004 |
---|---|
Country/Territory | Cyprus |
City | Nicosia |
Period | 14/03/04 → 17/03/04 |
Bibliographical note
Proceedings of the 2004 ACM Symposium on Applied Computing 14 March 2004 through 17 March 2004 Code 62941Keywords
- BDI
- Propositional Planning
- X-BDI