Classifying the multi robot path finding problem into a quadratic competitive complexity class (Q1022454): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10472-009-9122-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088502025 / rank | |||
Normal rank | |||
Revision as of 02:11, 20 March 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
