确定性规范自动机的协同任务分配
Cooperative Tasking for Deterministic Specification Automata
AI总结：
针对多智能体系统，提出一种基于分治策略的全局规范分解方法，给出任意有限数量智能体任务可分解的充要条件，并证明局部规范满足可保证全局规范满足。
摘要：
在我们之前的工作[1]中，提出了一种用于多智能体系统协同任务分配的分治方法。基本思想是将请求的全局规范分解为各个智能体的子任务，使得每个智能体完成这些子任务后，团队整体满足全局规范。研究表明，并非所有任务都可分解。此外，针对两个协同智能体之间的任务自动机，提出了可分解性的充要条件。本文延续[1]的结果，提出了任意有限数量智能体任务可分解性的充要条件。进一步证明，局部规范的满足可以保证全局规范的满足。这项工作为设计者如何排除不可分解的任务自动机并强制实施可分解条件提供了提示。因此，该结果可能为多智能体系统的分散协同控制开辟新的视角。
英文摘要：
In our previous work [1], a divide-and-conquer approach was proposed for cooperative tasking among multi-agent systems. The basic idea is to decompose a requested global specification into subtasks for individual agents such that the fulfillment of these subtasks by each individual agent leads to the satisfaction of the global specification as a team. It was shown that not all tasks can be decomposed. Furthermore, a necessary and sufficient condition was proposed for the decomposability of a task automaton between two cooperative agents. The current paper continues the results in [1] and proposes necessary and sufficient conditions for task decomposability with respect to arbitrary finite number of agents. It is further shown that the fulfillment of local specifications can guarantee the satisfaction of the global specification. This work provides hints for the designers on how to rule out the indecomposable task automata and enforce the decomposability conditions. The result therefore may pave the way towards a new perspective for decentralized cooperative control of multi-agent systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
