Classifying the multi robot path finding problem into a quadratic competitive complexity class (Q1022454): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Searching in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4704221 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanning-tree based coverage of continuous areas by a mobile robot / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Competitive on-line coverage of grid environments by a mobile robot / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4736555 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape / rank | |||
Normal rank | |||
Latest revision as of 17:16, 1 July 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
