|
|
|
Volumn 2, Issue , 1999, Pages 1011-1017
|
|
Shortest path planning for a tethered robot or an anchored cable
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL GEOMETRY;
CONSTRAINT THEORY;
MOBILE ROBOTS;
TETHERLINES;
TWO DIMENSIONAL;
POLYGONAL OBSTACLES;
TETHERED ROBOT;
MOTION PLANNING;
|
|
EID: 0032651821
PISSN: 10504729
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Article |
|
Times cited : (31)
|
|
References (19)
|
