|
Volumn , Issue , 2011, Pages 76-83
|
A polynomial-time algorithm for non-optimal multi-agent pathfinding
|
Author keywords
[No Author keywords available]
|
Indexed keywords
CONSTRUCTIVE PROOF;
LINEAR-TIME;
MULTIPLE AGENTS;
PATHFINDING;
POLYNOMIAL-TIME ALGORITHMS;
SUB-OPTIMAL ALGORITHMS;
TREE-BASED;
ALGORITHMS;
MULTI AGENT SYSTEMS;
OPTIMIZATION;
PROBLEM SOLVING;
|
EID: 84875584389
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (63)
|
References (10)
|