资源分类
》 资源 》论文》Multi-Agent Coordination: DCOPs and Beyond

Multi-Agent Coordination: DCOPs and Beyond

2019-11-12 | |  71 |   48 |   0

Abstract Distributed constraint optimization problems (DCOPs) are a model for representing multi-agent systems in which agents cooperate to optimize a global objective. The DCOP model has two main advantages: it can represent a wide range of problem domains, and it supports the development of generic algorithms to solve them. Firstly, this paper presents some advances in both complete and approximate DCOP algorithms. Secondly, it explains that the DCOP model makes a number of unrealistic assumptions that severely limit its range of application. Finally, it points out hints on how to tackle such limitations.

上一篇：Temporal Defeasible Argumentation in Multi-Agent Planning

下一篇：Bayesian Abductive Logic Programs: A Probabilistic Logic for Abductive Reasoning

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...