Solving multi-agent path finding on strongly biconnected digraphs (Q4580265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6917508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving multi-agent path finding on strongly biconnected digraphs |
scientific article; zbMATH DE number 6917508 |
Statements
Solving Multi-agent Path Finding on Strongly Biconnected Digraphs (English)
0 references
14 August 2018
0 references
0.7950242161750793
0 references
0.7645090222358704
0 references
0.7587582468986511
0 references
0.7303395867347717
0 references
