|
Volumn , Issue , 2004, Pages 786-791
|
A fast algorithm to plan a collision-free path in cluttered 2D environments
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COLLISION AVOIDANCE;
COMPUTATIONAL COMPLEXITY;
HEURISTIC METHODS;
MATHEMATICAL TRANSFORMATIONS;
MOBILE ROBOTS;
ARRAYS;
CONSTRAINT THEORY;
DATA STRUCTURES;
GRAPH THEORY;
MOTION PLANNING;
PROBABILITY;
PROBLEM SOLVING;
ROBOTICS;
COLLISION-FREE PATH;
FAST ALGORITHM;
PROBABILISTIC ROADMAP METHOD (PRM);
RAPIDLY-EXPLORING RANDOM TREES (RRT);
PROBABLISTIC ROADMAP METHOD (PRM);
VORONOI GRAPH;
MOTION PLANNING;
ALGORITHMS;
|
EID: 11244278194
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (2)
|
References (7)
|