Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

The methods for predicting the performance of any formulation of randomized parallel search were discussed. A prediction method based on obtaining an accurate estimate of the k-processor run-time distribution was proposed. The estimation methods were useful for determining the parallel resources required by the robot motion planning system.

Original languageEnglish (US)
Pages (from-to)31-53
Number of pages23
JournalJournal of Intelligent and Robotic Systems: Theory and Applications
Volume38
Issue number1
DOIs
StatePublished - Sep 1 2003

Keywords

  • Parallel computers
  • Performance evaluation
  • Randomized parallel search
  • Randomized path planning

Fingerprint Dive into the research topics of 'Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning'. Together they form a unique fingerprint.

Cite this