Next: General algorithms Up: 6.5 Complexity of Motion Previous: 6.5.2 Davenport-Schinzel Sequences
The upper bounds for motion planning problems arise from the existence of complete algorithms that solve them. This section proceeds by starting with the most general bounds, which are based on the methods of Section 6.4, and concludes with bounds for simpler motion planning problems.