Classifying the multi robot path finding problem into a quadratic competitive complexity class (Q1022454)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Classifying the multi robot path finding problem into a quadratic competitive complexity class |
scientific article; zbMATH DE number 5567081
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classifying the multi robot path finding problem into a quadratic competitive complexity class |
scientific article; zbMATH DE number 5567081 |
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
