Practice Deterministic Search-based Motion Planning (5.1) - Chapter 5: Motion Planning and Path Optimization

Practice: Deterministic Search-Based Motion Planning

Lesson 5.1Motion Planning and Path Optimization

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What does the A* algorithm use to optimize pathfinding?
Show hintHide hint
Think about the components of the total cost function in A*.
Question 2.
Name one application of the D* algorithm.
Show hintHide hint
Consider environments with moving obstacles.
3Question 3.
What does A* guarantee if its heuristic is admissible?
- It will find a path
- It will find the optimal path
- It will never find a path
Show hintHide hint
Recall the definition of admissibility.
4Question 4.
True or False: D* is specifically designed for static environments.
- True
- False
Show hintHide hint
Consider the applications of D* in robotics.
Question 5.
Design a maze and analyze how the A* algorithm would find the path from the start to the goal. Then modify the maze by adding an obstacle and describe how D* would help.
Show hintHide hint
Consider node revisiting and path optimization.
Question 6.
In a grid-based game, create a scenario where a player moves through a field that has both static and dynamic obstacles. How would A* and D* be utilized in such a game?
Show hintHide hint
Think about the game mechanics and pathfinding needs.

4 more questions in this section. Enroll free to practise them all.