Probabilistic roadmap methods are embarrassingly parallel

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 1999, Pages 688-694

  Amato, Nancy M ^a   Dale, Lucia K ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DEGREES OF FREEDOM (MECHANICS); MOBILE ROBOTS; PARALLEL ALGORITHMS; PROBABILITY;

PROBABILISTIC ROADMAP METHOD; RANDOMIZED PATH PLANNER;

MOTION PLANNING;

EID: 0032651794     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (25)