2012
DOI: 10.1177/0278364912456444
|View full text |Cite
|
Sign up to set email alerts
|

Real-time informed path sampling for motion planning search

Abstract: Mobile robot motions often originate from an uninformed path sampling process such as random or low-dispersion sampling. We demonstrate an alternative approach to path sampling that closes the loop on the expensive collision-testing process. Although all necessary information for collision-testing a path is known to the planner, that information is typically stored in a relatively unavailable form in a costmap or obstacle map. By summarizing the most salient data in a more accessible form, our process delivers… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
12
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(13 citation statements)
references
References 49 publications
1
12
0
Order By: Relevance
“…Waypoint positions are planned in a continuous domain, while state constraints and curvature constraints are checked exactly, i.e., without any approximations and using analytically derived conditions. This differentiates the proposed method from the ones available in the literature and is congruent with the ongoing trend of seeking more efficient constraint checking procedures (visible in works such as [22]), and with efforts to guarantee constraint satisfaction in a continuous domain, see e.g., [25]. The benefits and necessity of seeking feedback control policies as opposed to open-loop controls or parametric paths has been also argued extensively in [5,29,38,39,44].…”
Section: Related Worksupporting
confidence: 67%
“…Waypoint positions are planned in a continuous domain, while state constraints and curvature constraints are checked exactly, i.e., without any approximations and using analytically derived conditions. This differentiates the proposed method from the ones available in the literature and is congruent with the ongoing trend of seeking more efficient constraint checking procedures (visible in works such as [22]), and with efforts to guarantee constraint satisfaction in a continuous domain, see e.g., [25]. The benefits and necessity of seeking feedback control policies as opposed to open-loop controls or parametric paths has been also argued extensively in [5,29,38,39,44].…”
Section: Related Worksupporting
confidence: 67%
“…The utility-guided approach [4], maximizes the information gain of the next sample by predicting the sample utility with a probability distribution. Informed path sampling [5] learns a probability distribution to generate paths which are robust to obstacle uncertainties. These methods bias the sampling distribution of SMP but are not designed to include information from previous experiences.…”
Section: Related Workmentioning
confidence: 99%
“…Burns et al [13] introduce the utility-guided approach, learning a distribution to predict the next sample with the highest utility, maximizing the information gain. Informed path sampling [14] adapts the sampling distribution to find paths with high variability. Kobilarov et al [15] employ the cross-entropy method by learning a Gaussian Mixture Model and optimizing the sampling distribution of one query to converge towards an optimal path.…”
Section: R Wmentioning
confidence: 99%
“…The construction is detailed in Algorithm 1. The individual steps are 1) Extracting key configurations from the previous paths, learning a GMM based on the key configurations (steps 3-7) and 2) Connecting the components of the GMM based on the previous paths (steps [8][9][10][11][12][13][14][15][16].…”
Section: A Constructing the Repetition Roadmapmentioning
confidence: 99%