资源分类
》 资源 》论文》Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs? (Extended Abstract)

Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs? (Extended Abstract)

2019-11-06 | |  64 |   52 |   0
Abstract We present and evaluate diBOX, an algorithm for multi-agent path finding on strongly biconnected directed graphs. diBOX runs in polynomial time, computes suboptimal solutions and is complete for instances on strongly biconnected digraphs with at least two unoccupied positions. A detailed empirical analysis shows a good scalability for diBOX.

上一篇：On the Logical Properties of the Description Logic DLN (Extended abstract)? Piero A. Bonatti and Luigi Sauro

下一篇：Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents (Extended Abstract)?

用户评价
全部评价

热门资源

  • 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 ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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