2013
DOI: 10.1109/tro.2012.2222272
|View full text |Cite
|
Sign up to set email alerts
|

Path Planning Under Kinematic Constraints by Rapidly Exploring Manifolds

Abstract: Abstract-The situation arising in path planning under kinematic constraints, where the valid configurations define a manifold embedded in the joint ambient space, can be seen as a limit case of the well-known narrow corridor problem. With kinematic constraints the probability of obtaining a valid configuration by sampling in the joint ambient space is not low but null, which complicates the direct application of sampling-based path planners. This paper presents the AtlasRRT algorithm, a planner specially tailo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
118
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
3

Relationship

3
6

Authors

Journals

citations
Cited by 123 publications
(118 citation statements)
references
References 45 publications
0
118
0
Order By: Relevance
“…To deal with higher-dimensional problems, however, we could adapt the approach in [40], which trades off resolution completeness by efficiency and probabilistic completeness, or the approach in [41] which, additionally, guarantees asymptotic optimality. The evaluation of these variants of the planner in the context of singularityfree path planning certainly deserves further attention.…”
Section: Discussionmentioning
confidence: 99%
“…To deal with higher-dimensional problems, however, we could adapt the approach in [40], which trades off resolution completeness by efficiency and probabilistic completeness, or the approach in [41] which, additionally, guarantees asymptotic optimality. The evaluation of these variants of the planner in the context of singularityfree path planning certainly deserves further attention.…”
Section: Discussionmentioning
confidence: 99%
“…To avoid these weaknesses, the CUIK suite includes the cuikatlasrrt tool, which implements a sampling method where a partial atlas is used to extend a rapidly-exploring random tree (RRT), which in turn is exploited to decide expansion directions for the atlas [13]. For instance, after specifying the start and goal configurations in the joints file, the sequence of commands > cuikatlasrrt welding2D > cuikplotatlas welding2D 0 9 18 > cuikplotrrt welding2D 0 9 18 > geomview welding2D rrt.gcl welding2D atlas.gcl produces an RRT and an atlas like those shown in Fig.…”
Section: Continuation Methodsmentioning
confidence: 99%
“…To avoid these weaknesses, the CUIK suite implements a sampling method where a partial atlas is used to extend a rapidly-exploring random tree (RRT), which in turn is exploited to decide extension directions for the atlas [9]. Using this technique it is possible to solve problems in pretty high dimensions in a few seconds.…”
Section: Continuation Methodsmentioning
confidence: 99%