计算机科学概论原版课件第九版10_第1页
计算机科学概论原版课件第九版10_第2页
计算机科学概论原版课件第九版10_第3页
计算机科学概论原版课件第九版10_第4页
计算机科学概论原版课件第九版10_第5页
已阅读5页,还剩38页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

1、chapter 10artificial intelligence 2007 pearson addison-wesley.all rights reserved 2007 pearson addison-wesley. all rights reserved0-0-2 2chapter 10: artificial intelligence 10.1 intelligence and machines 10.2 perception 10.3 reasoning 10.4 additional areas of research 10.5 artificial neural networks

2、 10.6 robotics 10.7 considering the consequences 2007 pearson addison-wesley. all rights reserved0-0-3 3intelligent agents agent: a “device” that responds to stimuli from its environment sensors actuators the goal of artificial intelligence is to build agents that behave intelligently 2007 pearson a

3、ddison-wesley. all rights reserved0-0-4 4levels of intelligent behavior reflex: actions are predetermined responses to the input data intelligent response: actions affected by knowledge of the environment goal seeking learning 2007 pearson addison-wesley. all rights reserved0-0-5 5figure 10.1 the ei

4、ght-puzzle in its solved configuration 2007 pearson addison-wesley. all rights reserved0-0-6 6figure 10.2 our puzzle-solving machine 2007 pearson addison-wesley. all rights reserved0-0-7 7approaches to research in artificial intelligence performance oriented: researcher tries to maximize the perform

5、ance of the agents. simulation oriented: researcher tries to understand how the agents produce responses. 2007 pearson addison-wesley. all rights reserved0-0-8 8turing test proposed by alan turing in 1950 benchmark for progress in artificial intelligence test setup: human interrogator communicates w

6、ith test subject by typewriter. test: can the human interrogator distinguish whether the test subject is human or machine? 2007 pearson addison-wesley. all rights reserved0-0-9 9techniques for understanding images template matching image processing edge enhancement region finding smoothing image ana

7、lysis 2007 pearson addison-wesley. all rights reserved0-0-1010language processing syntactic analysis semantic analysis contextual analysis 2007 pearson addison-wesley. all rights reserved0-0-1111figure 10.3 a semantic net 2007 pearson addison-wesley. all rights reserved0-0-1212components of a produc

8、tion systems1. collection of states start (or initial) state goal state (or states)2. collection of productions: rules or moves each production may have preconditions3. control system: decides which production to apply next 2007 pearson addison-wesley. all rights reserved0-0-1313reasoning by searchi

9、ng state graph: all states and productions search tree: a record of state transitions explored while searching for a goal state breadth-first search depth-first search 2007 pearson addison-wesley. all rights reserved0-0-1414figure 10.4 a small portion of the eight-puzzles state graph 2007 pearson ad

10、dison-wesley. all rights reserved0-0-1515figure 10.5 deductive reasoning in the context of a production system 2007 pearson addison-wesley. all rights reserved0-0-1616figure 10.6 an unsolved eight-puzzle 2007 pearson addison-wesley. all rights reserved0-0-1717figure 10.7 a sample search tree 2007 pe

11、arson addison-wesley. all rights reserved0-0-1818figure 10.8 productions stacked for later execution 2007 pearson addison-wesley. all rights reserved0-0-1919heuristic strategies heuristic: a quantitative estimate of the distance to a goal requirements for good heuristics must be much easier to compu

12、te than a complete solution must provide a reasonable estimate of proximity to a goal 2007 pearson addison-wesley. all rights reserved0-0-2020figure 10.9 an unsolved eight-puzzle 2007 pearson addison-wesley. all rights reserved0-0-2121figure 10.10 an algorithm for a control system using heuristics 2

13、007 pearson addison-wesley. all rights reserved0-0-2222figure 10.11 the beginnings of our heuristic search 2007 pearson addison-wesley. all rights reserved0-0-2323figure 10.12 the search tree after two passes 2007 pearson addison-wesley. all rights reserved0-0-2424figure 10.13 the search tree after

14、three passesfigure 10.14 the complete search tree formed by our heuristic system 2007 pearson addison-wesley. all rights reserved0-0-2626handling real-world knowledge representation and storage accessing relevant information meta-reasoning closed-world assumption frame problem 2007 pearson addison-w

15、esley. all rights reserved0-0-2727learning imitation supervised training reinforcement evolutionary techniques 2007 pearson addison-wesley. all rights reserved0-0-2828artificial neural networks artificial neuron each input is multiplied by a weighting factor. output is 1 if sum of weighted inputs ex

16、ceeds the threshold value; 0 otherwise. network is programmed by adjusting weights using feedback from examples. 2007 pearson addison-wesley. all rights reserved0-0-2929figure 10.15 a neuron in a living biological system 2007 pearson addison-wesley. all rights reserved0-0-3030figure 10.16 the activi

17、ties within a processing unit 2007 pearson addison-wesley. all rights reserved0-0-3131figure 10.17 representation of a processing unit 2007 pearson addison-wesley. all rights reserved0-0-3232figure 10.18 a neural network with two different programs 2007 pearson addison-wesley. all rights reserved0-0

18、-3333figure 10.19 an artificial neural network 2007 pearson addison-wesley. all rights reserved0-0-3434figure 10.20 training an artificial neural network 2007 pearson addison-wesley. all rights reserved0-0-3535figure 10.20 training an artificial neural network (continued) 2007 pearson addison-wesley

19、. all rights reserved0-0-3636figure 10.20 training an artificial neural network (continued) 2007 pearson addison-wesley. all rights reserved0-0-3737figure 10.20 training an artificial neural network (continued) 2007 pearson addison-wesley. all rights reserved0-0-3838figure 10.21 the structure of alv

20、inn 2007 pearson addison-wesley. all rights reserved0-0-3939associative memory associative memory: the retrieval of information relevant to the information at hand one direction of research seeks to build associative memory using neural networks that when given a partial pattern, transition themselves to a completed pattern. 2007 pearson addison-wesley. all rights reserved0-0-4040figure 10.22 an artificial neural network implementing an associative memory

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论