Classifying the multi robot path finding problem into a quadratic competitive complexity class (Q1022454)

From MaRDI portal
Revision as of 17:16, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Classifying the multi robot path finding problem into a quadratic competitive complexity class
scientific article

    Statements

    Classifying the multi robot path finding problem into a quadratic competitive complexity class (English)
    0 references
    0 references
    0 references
    22 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    motion planning
    0 references
    mobile robots
    0 references
    competitive complexity class
    0 references
    0 references