Next:
14.6.1 Different Ways to
Up:
14. Sampling-Based Planning Under
Previous:
14.5.2 Dynamic Programming with
14
.
6
Decoupled Planning Approaches
Subsections
14
.
6
.
1
Different Ways to Decouple the Big Problem
14
.
6
.
2
Plan and Transform
14
.
6
.
3
Path-Constrained Trajectory Planning
14
.
6
.
3
.
1
Expressing systems in terms of
,
, and
14
.
6
.
3
.
2
Determining the allowable accelerations
14
.
6
.
3
.
3
The path-constrained phase space
14
.
6
.
3
.
4
Computing optimal solutions via dynamic programming
14
.
6
.
3
.
5
A bang-bang approach for time optimality
Steven M LaValle 2012-04-20
