Question 1 (1 point) Which pathfinding algorithm is commonly used for solving problems…
- User
Question 1 (1 point) Which pathfinding algorithm is commonly used for solving problems involving continuous spaces and obstacles?
Question 1 options:
Dijkstra's
A*
RRT
Cell decomposition
Question 2 (1 point) What does the visibility graph represent in pathfinding?
Question 2 options:
Lines of sight between obstacles in the environment
Shortest paths between points in a continuous space
Connections between cells in a grid
Paths generated through random sampling
Question 3 (1 point) What technique involves dividing the search space into smaller cells to simplify pathfinding?
Question 3 options:
Voronoi diagram
Cell decomposition
RRT
Visibility graph
Question 4 (1 point) Which of the following algorithms is commonly used for finding the shortest path in a grid-based environment?
Question 4 options:
RRT
Visibility graph
A*
Voronoi diagram
Question 5 (1 point) What property distinguishes A* from Dijkstra's algorithm?
Question 5 options:
A* has a higher time complexity compared to Dijkstra's.
A* guarantees the shortest path without a heuristic.
A* uses a heuristic function to guide the search.
A* can handle negative edge weights.
- Assistant
Question 6 (1 point) In the A* algorithm, what does the heuristic function estimate?
Question 6 options:
The actual cost to reach the goal node from the current node
The cost of the path found so far
The distance from the current node to the goal node
The total cost of the path through the current node to the goal node
- User
Which pathfinding algorithm is commonly used for solving problems involving continuous spaces and obstacles?
Question 1 options:
Dijkstra's
A*
RRT
Cell decomposition
- Assistant
The correct answer is A*: A* is commonly used for solving problems involving continuous spaces and obstacles.
- User
What does the visibility graph represent in pathfinding?
Question 2 options:
Lines of sight between obstacles in the environment
Shortest paths between points in a continuous space
Connections between cells in a grid
Paths generated through random sampling
- Assistant
The correct answer is: Lines of sight between obstacles in the environment.
- User
What technique involves dividing the search space into smaller cells to simplify pathfinding?
Question 3 options:
Voronoi diagram
Cell decomposition
RRT
Visibility graph
- Assistant
The correct answer is: Cell decomposition.
- User
Which of the following algorithms is commonly used for finding the shortest path in a grid-based environment?
Question 4 options:
RRT
Visibility graph
A*
Voronoi diagram
- Assistant
The correct answer is: A*.
- User
What property distinguishes A* from Dijkstra's algorithm?
Question 5 options:
A* has a higher time complexity compared to Dijkstra's.
A* guarantees the shortest path without a heuristic.
A* uses a heuristic function to guide the search.
A* can handle negative edge weights.
- Assistant
The correct answer is: A* uses a heuristic function to guide the search.