Consider the vacuum-world problem defined in Figure 2.2.

 

a. Which of the algorithms defined in this uninformed, partial informed, problem solving would be appropriate for this problem? Should the algorithm check for repeated states? 

b. Apply your chosen algorithm to compute an optimal sequence of actions for a 3 x 3 world whose initial state has dirt in the three top squares and the agent in the center.

  

Transcribed Image Text:

A Figure 2.2 A vacuum-cleaner world with just two locations. A Figure 2.2 A vacuum-cleaner world with just two locations.

Answer rating: 100% (QA)

Vacuum World problem a Depthfirst search algorithm is the appropriate for Vacuumworld problem In this iterative deepening search is an enhanced version of the depthfirst search This expansion is used ... View the full answer