April 1998
Beginner
513 pages
14h 32m
English
Now that we have explored several techniques for finding paths in graphs, it is time to show how these methods can be used by agents in realistic settings. I first revisit the assumptions made when I first considered graph-search planning methods in Chapter 7 and propose an agent architecture that tolerates these idealized assumptions. Next, I show how some of the search methods can be modified to lessen their time and space requirements—thus making them more usable in the proposed architecture. Finally, I show how heuristic functions and models of actions can be learned.
As mentioned in Chapter 7, the efficacy of search-based planning methods depends on several strong assumptions. ...
Read now
Unlock full access