|
Volumn , Issue , 2006, Pages 18-25
|
A comparison of path planning algorithms for omni-directional robots in dynamic environments
|
Author keywords
A* algorithm; Bug algorithm; Local multiresolution; Obstacle avoidance; Path planning; Potential fields
|
Indexed keywords
AUTOMATION;
BOOLEAN FUNCTIONS;
MOTION PLANNING;
PLANNING;
ROBOTICS;
ROBOTS;
STANDARDS;
BUG ALGORITHM;
COMPUTATIONAL COSTS;
DYNAMIC ENVIRONMENTS;
LATIN AMERICAN (LA);
MINIMUM COSTS;
MULTI ROBOTS;
MULTIRESOLUTION (MR);
OMNI DIRECTIONAL ROBOTS;
PATH LENGTHS;
PATH PLANNERS;
PATH PLANNING ALGORITHMS;
PATH PLANNING METHODS;
POTENTIAL FIELDS;
ALGORITHMS;
|
EID: 46149107289
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/LARS.2006.334319 Document Type: Conference Paper |
Times cited : (24)
|
References (11)
|