arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.0047cs.AI
收藏

合作系统的分散控制:分类与复杂性分析

Decentralized Control of Cooperative Systems: Categorization and Complexity Analysis

University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校)

C. V. Goldman, S. Zilberstein

摘要:

协作系统的分散控制捕获了共享单个全局目标的一组决策者的操作。在最佳解决这些问题的困难出现时,代理商缺乏充分的观察系统的全局状态,当他们操作。一般问题已被证明是NEXP完全的。在本文中,我们确定类的分散控制问题,其复杂性范围之间NEXP和P。特别是,我们研究的问题,其特征在于独立的过渡,独立的意见,和面向目标的目标函数。两个算法,以解决最佳有用类的目标为导向的分散过程在多项式时间。本文还研究了决策者之间的信息共享,以提高他们的绩效。我们区分代理可以交换信息的三种方式:间接通信,直接通信和共享状态功能,不受代理控制。我们的分析表明,对于我们考虑的每一类问题,引入直接或间接的通信不会改变最坏情况的复杂性。结果提供了一个更好的理解,在实践中出现的分散控制问题的复杂性,并促进这些问题的规划算法的发展。

英文摘要:

Decentralized control of cooperative systems captures the operation of a group of decision makers that share a single global objective. The difficulty in solving optimally such problems arises when the agents lack full observability of the global state of the system when they operate. The general problem has been shown to be NEXP-complete. In this paper, we identify classes of decentralized control problems whose complexity ranges between NEXP and P. In particular, we study problems characterized by independent transitions, independent observations, and goal-oriented objective functions. Two algorithms are shown to solve optimally useful classes of goal-oriented decentralized processes in polynomial time. This paper also studies information sharing among the decision-makers, which can improve their performance. We distinguish between three ways in which agents can exchange information: indirect communication, direct communication and sharing state features that are not controlled by the agents. Our analysis shows that for every class of problems we consider, introducing direct or indirect communication does not change the worst-case complexity. The results provide a better understanding of the complexity of decentralized control problems that arise in practice and facilitate the development of planning algorithms for these problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑