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 language | English (US) |
|---|---|
| Pages (from-to) | 31-53 |
| Number of pages | 23 |
| Journal | Journal of Intelligent and Robotic Systems: Theory and Applications |
| Volume | 38 |
| Issue number | 1 |
| DOIs | |
| State | Published - Sep 2003 |
Bibliographical note
Funding Information:★ Work supported in part by ARO grant DA/DAAG55-98-1-0441, ARO grant DA/DAAG55-97-1-021, and NSF grant NSF CCR-9972519.
Keywords
- Parallel computers
- Performance evaluation
- Randomized parallel search
- Randomized path planning