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

From MaRDI portal
Revision as of 03:11, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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