The computational complexity of multi-agent pathfinding on directed graphs (Q6494349)

From MaRDI portal
scientific article; zbMATH DE number 7840008
Language Label Description Also known as
English
The computational complexity of multi-agent pathfinding on directed graphs
scientific article; zbMATH DE number 7840008

    Statements

    The computational complexity of multi-agent pathfinding on directed graphs (English)
    0 references
    0 references
    30 April 2024
    0 references
    multi-agent pathfinding
    0 references
    diMAPF
    0 references
    MAPF
    0 references
    pebble motion on graphs
    0 references
    cooperative pathfinding
    0 references
    motion planning on graphs
    0 references
    computational complexity
    0 references
    permutation group theory
    0 references

    Identifiers