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

Daniel J. Challou; Maria Gini; Vipin Kumar; George Karypis

doi:10.1023/A:1026283627113

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

Daniel J. Challou, Maria Gini, Vipin Kumar, George Karypis

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-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 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	https://doi.org/10.1023/A:1026283627113
State	Published - Sep 1 2003

Keywords

Parallel computers
Performance evaluation
Randomized parallel search
Randomized path planning

Access

10.1023/A:1026283627113

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

@article{a35454db42ba4cc4aa8201637b8151eb,

title = "Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning",

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.",

keywords = "Parallel computers, Performance evaluation, Randomized parallel search, Randomized path planning",

author = "Challou, {Daniel J.} and Maria Gini and Vipin Kumar and George Karypis",

year = "2003",

month = sep,

day = "1",

doi = "10.1023/A:1026283627113",

language = "English (US)",

volume = "38",

pages = "31--53",

journal = "Journal of Intelligent and Robotic Systems: Theory and Applications",

issn = "0921-0296",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Predicting the Performance of Randomized Parallel Search

T2 - An Application to Robot Motion Planning

AU - Challou, Daniel J.

AU - Gini, Maria

AU - Kumar, Vipin

AU - Karypis, George

PY - 2003/9/1

Y1 - 2003/9/1

N2 - 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.

AB - 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.

KW - Parallel computers

KW - Performance evaluation

KW - Randomized parallel search

KW - Randomized path planning

UR - http://www.scopus.com/inward/record.url?scp=0242551583&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242551583&partnerID=8YFLogxK

U2 - 10.1023/A:1026283627113

DO - 10.1023/A:1026283627113

M3 - Article

AN - SCOPUS:0242551583

VL - 38

SP - 31

EP - 53

JO - Journal of Intelligent and Robotic Systems: Theory and Applications

JF - Journal of Intelligent and Robotic Systems: Theory and Applications

SN - 0921-0296

IS - 1

ER -