资源分类
》 资源 》论文》Continuous Time Planning for Multiagent Teams with Temporal Constraints

Continuous Time Planning for Multiagent Teams with Temporal Constraints

2019-11-12 | |  112 |   114 |   0
Abstract Continuous state DEC-MDPs are critical for agent teams in domains involving resources such as time, but scaling them up is a signi?cant challenge. To meet this challenge, we ?rst introduce a novel continuous-time DEC-MDP model that exploits transition independence in domains with temporal constraints. More importantly, we present a new locally optimal algorithm called SPAC. Compared to the best previous algorithm, SPAC ?nds solutions of comparable quality substantially faster; SPAC also scales to larger teams of agents.

上一篇：Improving Resource Allocation Strategy Against Human Adversaries in Security Games

下一篇：Mechanism Design for Double Auctions with Temporal Constraints ?

用户评价
全部评价

热门资源

  • Regularizing RNNs...

    Recently, caption generation with an encoder-de...

  • Deep Cross-media ...

    Cross-media retrieval is a research hotspot in ...

  • Learning Expressi...

    Facial expression is temporally dynamic event w...

  • Compact MDDs for ...

    Pseudo-Boolean (PB) constraints are usually en...

  • Attributed Graph ...

    Graph clustering is a fundamental task which di...