Improving domain-independent intention selection in BDI systems
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605514755 | ||
| 003 | CHVBK | ||
| 005 | 20210128100706.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150701xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10458-015-9293-5 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10458-015-9293-5 | ||
| 245 | 0 | 0 | |a Improving domain-independent intention selection in BDI systems |h [Elektronische Daten] |c [Max Waters, Lin Padgham, Sebastian Sardina] |
| 520 | 3 | |a The Belief Desire Intention (BDI) agent paradigm provides a powerful basis for developing complex systems based on autonomous intelligent agents. These agents have, at any point in time, a set of intentions encoding the various tasks the agent is working on. Despite its importance, the problem of selecting which intention to progress at any point in time has received almost no attention and has been mostly left to the programmer to resolve in an application-dependent manner. In this paper, we implement and evaluate two domain-independent intention selection mechanisms based on the ideas of enablement checking and low coverage prioritisation. Through a battery of automatically generated synthetic tests and one real program, we compare these with the commonly used intention selection mechanisms of First-In-First-Out (FIFO) and Round Robin (RR). We found that enablement checking, which is incorporated into low coverage prioritisation, is never detrimental and provides substantial benefits when running vulnerable programs in dynamic environments. This is a significant finding as such a check can be readily applied to FIFO and RR, giving an extremely simple and effective mechanism to be added to existing BDI frameworks. In turn, low coverage prioritisation provides a significant further benefit. | |
| 540 | |a The Author(s), 2015 | ||
| 690 | 7 | |a BDI Agent Programming |2 nationallicence | |
| 690 | 7 | |a Intention selection |2 nationallicence | |
| 700 | 1 | |a Waters |D Max |u School of Computer Science & Information Technology, RMIT University, Melbourne, Australia |4 aut | |
| 700 | 1 | |a Padgham |D Lin |u School of Computer Science & Information Technology, RMIT University, Melbourne, Australia |4 aut | |
| 700 | 1 | |a Sardina |D Sebastian |u School of Computer Science & Information Technology, RMIT University, Melbourne, Australia |4 aut | |
| 773 | 0 | |t Autonomous Agents and Multi-Agent Systems |d Springer US; http://www.springer-ny.com |g 29/4(2015-07-01), 683-717 |x 1387-2532 |q 29:4<683 |1 2015 |2 29 |o 10458 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10458-015-9293-5 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10458-015-9293-5 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Waters |D Max |u School of Computer Science & Information Technology, RMIT University, Melbourne, Australia |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Padgham |D Lin |u School of Computer Science & Information Technology, RMIT University, Melbourne, Australia |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Sardina |D Sebastian |u School of Computer Science & Information Technology, RMIT University, Melbourne, Australia |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Autonomous Agents and Multi-Agent Systems |d Springer US; http://www.springer-ny.com |g 29/4(2015-07-01), 683-717 |x 1387-2532 |q 29:4<683 |1 2015 |2 29 |o 10458 | ||