scholarly journals HTN-like solutions for classical planning problems: An application to BDI agent systems

2019 ◽  
Vol 763 ◽  
pp. 12-37 ◽  
Author(s):  
Lavindra de Silva ◽  
Lin Padgham ◽  
Sebastian Sardina
2014 ◽  
Vol 51 ◽  
pp. 71-131 ◽  
Author(s):  
M. Winikoff ◽  
S. Cranefield

Before deploying a software system we need to assure ourselves (and stakeholders) that the system will behave correctly. This assurance is usually done by testing the system. However, it is intuitively obvious that adaptive systems, including agent-based systems, can exhibit complex behaviour, and are thus harder to test. In this paper we examine this "obvious intuition" in the case of Belief-Desire-Intention (BDI) agents. We analyse the size of the behaviour space of BDI agents and show that although the intuition is correct, the factors that influence the size are not what we expected them to be. Specifically, we found that the introduction of failure handling had a much larger effect on the size of the behaviour space than we expected. We also discuss the implications of these findings on the testability of BDI agents.


Author(s):  
Alexander Pokahr ◽  
Lars Braubach ◽  
Winfried Lamersdorf
Keyword(s):  

Author(s):  
Shung-Bin Yan ◽  
Zu-Nien Lin ◽  
Hsun-Jen Hsu ◽  
Feng-Jian Wang
Keyword(s):  

1999 ◽  
Vol 08 (01) ◽  
pp. 1-14 ◽  
Author(s):  
PETER GOMBER ◽  
CLAUDIA SCHMIDT ◽  
CHRISTOF WEINHARDT

This paper focuses on market-like coordination mechanisms in multi-agent systems, with applications to business planning. Several fundamental criteria are derived in order to evaluate market-like coordination mechanisms. The central criterion is the efficient allocation of jobs to agents. Assuming a relationship between classes of operational planning problems and certain coordination mechanisms, business planning problems are classified on the basis of their relevant attributes. Coordination mechanisms for each of the classes are then introduced on the basis of auction theory and investigated with respect to the trade-off between efficiency and computational tractability. All of the mechanisms prove to have a common basis: the Vickrey Auction.


Author(s):  
Nitin Yadav ◽  
John Thangarajah ◽  
Sebastian Sardina

In this work we present a novel approach to check the consistency of agent designs (prior to any implementation) with respect to the requirements specifications via automated planning. This checking is essentially a search problem which makes planning technology an appropriate solution. We focus our work on BDI agent systems and the Prometheus design methodology in order to directly compare our approach to previous work. Our experiments in more than 16K random instances prove that the approach is more effective than previous ones proposed: it achieves higher coverage, lower run-time, and importantly, can handle loops in the agent detailed design and unbounded subgoal reasoning.


Sign in / Sign up

Export Citation Format

Share Document