2. [2+4]Consider the problem of finding the shortest path between two points on a plane that...

 

Transcribed Image Text:

2. [2+4]Consider the problem of finding the shortest path between two points on a plane that has convex polygonal obstacles as shown in Figure below. a) Suppose the state space consists of all positions (x,y) in the plane. How many states are there? How many paths are there to the goal? b) Explain briefly why the shortest path from one polygon vertex to any other in the scene must consist of straight- line segments joining some of the vertices of the polygons. Define a good state space now. How large is this state space? OPON G 2. [2+4]Consider the problem of finding the shortest path between two points on a plane that has convex polygonal obstacles as shown in Figure below. a) Suppose the state space consists of all positions (x,y) in the plane. How many states are there? How many paths are there to the goal? b) Explain briefly why the shortest path from one polygon vertex to any other in the scene must consist of straight- line segments joining some of the vertices of the polygons. Define a good state space now. How large is this state space? OPON G

Answer rating: 100% (QA)

x y possible states Infinite because you can have loops Because the shortest distance between two po... View the full answer