Integrating CP-Nets in Reactive BDI Agents
conference paper
Computational agents based upon the belief-desire-intention (BDI) architecture generally use reactive rules to trigger the execution of plans. For various reasons, certain plans might be preferred over others at design time. Most BDI agents platforms use hard-coding these preferences in some form of the static ordering of the reactive rules, but keeping the preferential structure implicit limits script reuse and generalization. This paper proposes an approach to add qualitative preferences over adoption/avoidance of procedural goals into an agent script, building upon the well-known notation of conditional ceteris paribus preference networks (CP-nets). For effective execution, the procedural knowledge and the preferential structure of the agent are mapped in an off-line fashion into a new reactive agent script. This solution contrasts with recent proposals integrating preferences as a rationale in the decision making cycle, and so overriding the reactive nature of BDI agents. © 2019, Springer Nature Switzerland AG.
Topics
TNO Identifier
871875
ISSN
03029743
ISBN
9783030337919
Publisher
Springer
Source title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019, 28 October 2019 through 31 October 2019
Pages
305-320
Files
To receive the publication files, please send an e-mail request to TNO Repository.