Solving Multi-agent Path Finding on Strongly Biconnected Digraphs

Adi Botea, Davide Bonusi, Pavel Surynek. Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. J. Artif. Intell. Res. (JAIR), 62:273-314, 2018. [doi]

Authors

Adi Botea

This author has not been identified. Look up 'Adi Botea' in Google

Davide Bonusi

This author has not been identified. Look up 'Davide Bonusi' in Google

Pavel Surynek

This author has not been identified. Look up 'Pavel Surynek' in Google