Abstract
We propose a new approach to intention progression in multi-agent settings where other agents are effectively black boxes. That is, while their goals are known, the precise programs used to achieve these goals are not known. In our approach, agents use an abstraction of their own program called a partially-ordered goal-plan tree (pGPT) to schedule their intentions and predict the actions of other agents. We show how a pGPT can be derived from the program of a BDI agent, and present an approach based on Monte Carlo Tree Search (MCTS) for scheduling an agent's intentions using pGPTs. We evaluate our pGPT-based approach in cooperative, selfish and adversarial multi-agent settings, and show that it out-performs MCTS-based scheduling where agents assume that other agents have the same program as themselves
Original language | English |
---|---|
Title of host publication | Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence |
Editors | Zhi-Hua Zhou |
Publisher | ijcai.org |
Pages | 132-138 |
Number of pages | 7 |
DOIs | |
Publication status | Published - Aug 2021 |
Bibliographical note
DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.Keywords
- Agent-based and Multi-agent Systems: Agent Theories and Models
- Agent-based and Multi-agent Systems: Engineering Methods, Platforms, Languages and Tools