Abstract

This paper deals with the possibility of solving a collective task by a group of intelligent agents with the BDI architecture using three different methods: planning using a global announcement board, coordination through local boards, and the exchange method. The new method proposed in the article is a local boards method based on the modification of the global-board method. As well, the analysis of the exchange method with the proposed formalization and application of the polynomial reduction method was conducted. All three methods were used on a simple simulation of the task of assisted movement on a grid, which explored the applicability of the architecture and methods for a real mobile multi-agent system. The special features of the task are the difficulty of maintaining a common communication channel and the limited computational resources. It was shown that this problem can be solved by introducing local announcement boards, when each agent makes a decision based on access to the advertisements of its neighbors. An analysis of the method based on exchanges has shown that it can be reduced to the formulation of the STRIPS problem. The exchange method allows one to make a search on a smaller graph in comparison to the STRIPS method.

中文翻译：

---

具有BDI体系结构的代理程序的本地行为计划方法

摘要

本文探讨了使用BDI体系结构的一组智能代理通过三种不同方法解决集体任务的可能性：使用全局公告板进行计划，通过本地板进行协调以及交换方法。本文提出的新方法是基于对全局板方法的修改的局部板方法。同时，对交换方法进行了分析，并提出了多项式约简方法。这三种方法都用于对网格上辅助移动任务的简单模拟，从而探索了该体系结构和方法在实际移动多智能体系统中的适用性。该任务的特殊之处在于难以维护公用的通信通道以及有限的计算资源。结果表明，当每个代理基于对邻居广告的访问权做出决定时，可以通过引入本地公告板来解决此问题。对基于交换的方法的分析表明，它可以简化为STRIPS问题的表述。与STRIPS方法相比，这种交换方法允许在较小的图上进行搜索。