2005
DOI: 10.1007/10991541_25
|View full text |Cite
|
Sign up to set email alerts
|

A Machine Learning Approach for Feature-Sensitive Motion Planning

Abstract: Abstract. Although there are many motion planning techniques, there is no method that outperforms all others for all problem instances. Rather, each technique has different strengths and weaknesses which makes it best-suited for certain types of problems. Moreover, since an environment can contain vastly different regions, there may not be a single planner that will perform well in all its regions. Ideally, one would use a suite of planners in concert and would solve the problem by applying the best-suited pla… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
63
0

Year Published

2007
2007
2022
2022

Publication Types

Select...
5
4
1

Relationship

1
9

Authors

Journals

citations
Cited by 71 publications
(63 citation statements)
references
References 25 publications
0
63
0
Order By: Relevance
“…This implies that a set of metrics, each suitable for a different setting, can be combined in order to solve more diverse settings that consist of smaller, specific, (sub)settings. Morales et al [35] have the same observation that different portions of the C-space may behave differently. In our work we will also refer to the case where different metrics are more effective than others in different portions of the C-space.…”
Section: B Metricsmentioning
confidence: 87%
“…This implies that a set of metrics, each suitable for a different setting, can be combined in order to solve more diverse settings that consist of smaller, specific, (sub)settings. Morales et al [35] have the same observation that different portions of the C-space may behave differently. In our work we will also refer to the case where different metrics are more effective than others in different portions of the C-space.…”
Section: B Metricsmentioning
confidence: 87%
“…Another recent adaptive approach is to construct a meta-planner with several tools at its disposal; such planners employ multiple sampling strategies (Hsu et al, 2005) or multiple randomized roadmap planners (Morales et al, 2004), based on a prediction of which approach is most effective in a given setting.…”
Section: Adaptive Sampling Strategiesmentioning
confidence: 99%
“…The adaptive algorithm selection framework in STAPL is a generalization of previous work done by our group for the adaptive selection among multiple algorithmic options for parallel sorting [49,2], for selecting among different motion planning methods [33,35], and for performing parallel reduction operations [83,84]. To the best of our knowledge, our framework provides the first general methodology for automatically developing a model for selecting among multiple algorithmic options.…”
Section: Algorithmic Adaptation In Staplmentioning
confidence: 99%