Classifying the multi robot path finding problem into a quadratic competitive complexity class (Q1022454): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:53, 30 January 2024
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
22 June 2009
0 references
motion planning
0 references
mobile robots
0 references
competitive complexity class
0 references
