2017 IEEE International Conference on Robotics and Automation (ICRA) 2017
DOI: 10.1109/icra.2017.7989581
|View full text |Cite
|
Sign up to set email alerts
|

Sampling-based algorithms for optimal motion planning using closed-loop prediction

Abstract: Motion planning under differential constraints, kinodynamic motion planning, is one of the canonical problems in robotics. Currently, state-of-the-art methods evolve around kinodynamic variants of popular sampling-based algorithms, such as Rapidly-exploring Random Trees (RRTs). However, there are still challenges remaining, for example, how to include complex dynamics while guaranteeing optimality. If the openloop dynamics are unstable, exploration by random sampling in control space becomes inefficient. We de… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 56 publications
(20 citation statements)
references
References 18 publications
0
20
0
Order By: Relevance
“…Future works will extend the current algorithm to solve a three-dimensional motion planning problem. The proposed MP-RRT # strategy will be adapted for real-time motion planning problems like the one described in [1,20]. In addition to that, experimental tests will be conducted on a physical robotic platform to evaluate the performance under realistic conditions.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Future works will extend the current algorithm to solve a three-dimensional motion planning problem. The proposed MP-RRT # strategy will be adapted for real-time motion planning problems like the one described in [1,20]. In addition to that, experimental tests will be conducted on a physical robotic platform to evaluate the performance under realistic conditions.…”
Section: Discussionmentioning
confidence: 99%
“…The sampled reference is then used to compute a trajectory using the closed-loop model of the robot. A similar approach is also used in [1] with the RRT # algorithm. Similarly, in [16] a kinodynamic RRT * is realized using Dubins curves as a primitive curve defining the reference path between the new sample and the existing tree, whereas an LQR controller is used in [33] to compute the cost of tracking the reference path.…”
Section: Introductionmentioning
confidence: 99%
“…The algorithm was further extended to combine the closed-loop control by [15]. Recently, the vehicle model prediction was also integrated into the algorithm [1]. Sampling-based path planning methods can find a path in high dimensional space efficiently.…”
Section: A Search-based and Sampling-based Path Planningmentioning
confidence: 99%
“…It is asymptotically complete, i.e., as the number of samples goes to infinity, the probability of finding a solution if one exists approaches 1. RRT* is an extension of RRT that finds the shortest feasible path and has been widely used recently, e.g., by [21], [22], where the latter used RRT* in an off-road scenario. Another samplingbased approach to terrain driving was presented in [23].…”
Section: Introductionmentioning
confidence: 99%