|
Volumn 1, Issue , 2002, Pages 102-109
|
Choosing good paths for fast distributed reconfiguration of hexagonal metamorphic robots
a b c |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COLLISION AVOIDANCE;
GRAPH THEORY;
HEURISTIC METHODS;
MOBILE ROBOTS;
MOTION PLANNING;
ROBOTICS;
TWO DIMENSIONAL;
DIRECTED ACYCLIC GRAPH;
DISTRIBUTED RECONFIGURATION;
METAMORPHIC ROBOTS;
SUBSTRATE PATH;
TRAVERSAL WEIGHTING ALGORITHM;
MODULAR ROBOTS;
|
EID: 0036057629
PISSN: 10504729
EISSN: None
Source Type: Journal
DOI: 10.1109/ROBOT.2002.1013346 Document Type: Article |
Times cited : (24)
|
References (17)
|