![](https://img.haomeiwen.com/i11683600/fc427a0c6772de9c.png)
![](https://img.haomeiwen.com/i11683600/86b749e210faef6b.png)
perception (+ memory)
no consideration of the consequences
quick response
not rational (optimal)
![](https://img.haomeiwen.com/i11683600/5b8077fecc5a9408.png)
![](https://img.haomeiwen.com/i11683600/b7d251b854b17b5e.png)
![](https://img.haomeiwen.com/i11683600/3416c283e98c223b.png)
![](https://img.haomeiwen.com/i11683600/b9818fd7f8d96a08.png)
the space is too large!
![](https://img.haomeiwen.com/i11683600/6ec58cf11f353264.png)
![](https://img.haomeiwen.com/i11683600/6fcad1475e8e5f30.png)
![](https://img.haomeiwen.com/i11683600/03a9b9b6a15f1239.png)
![](https://img.haomeiwen.com/i11683600/94291badb0871c3c.png)
![](https://img.haomeiwen.com/i11683600/ce983e6b7c883965.png)
we want to search as small as possible, yet find the destination
![](https://img.haomeiwen.com/i11683600/80928a6e59b9b2dc.png)
fringe: frontier nodes to be explored
![](https://img.haomeiwen.com/i11683600/8baaea9cfd18d8c5.png)
![](https://img.haomeiwen.com/i11683600/0659746d318299ac.png)
actual search tree is too large!
(note: the graph has no circle)
next: the direction of search
![](https://img.haomeiwen.com/i11683600/94b49d022279f69a.png)
![](https://img.haomeiwen.com/i11683600/788fccde23b5c31d.png)
![](https://img.haomeiwen.com/i11683600/ff29110dd91d1b62.png)
![](https://img.haomeiwen.com/i11683600/6c92b48084af271b.png)
![](https://img.haomeiwen.com/i11683600/995904d40b6f4feb.png)
DFS: better memory properties (much less memory usage)
BFS: good at finding an optimal solution
![](https://img.haomeiwen.com/i11683600/e4085e415262ca10.png)
The last layer of BFS is too large!
![](https://img.haomeiwen.com/i11683600/fed968c78fc5d5ef.png)
![](https://img.haomeiwen.com/i11683600/3f0e17305f7cc39b.png)
~> optimal cost
~> minimal cost for each step
![](https://img.haomeiwen.com/i11683600/f2e5471f3a35e434.png)
![](https://img.haomeiwen.com/i11683600/bb8c643fc201782f.png)
网友评论