人工智能与神经网络(AI-NN)(钟义信)(北京邮电大学讲义)AI-NN-01,02,03,04.pptVIP

人工智能与神经网络(AI-NN)(钟义信)(北京邮电大学讲义)AI-NN-01,02,03,04.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Situation Representation 1) AT (ROBOT, ALCOVE) EMPTYHANDED (ROBOT) ON (BOX, A) TABLE (A) TABLE (B) 2) AT (ROBOT, A) HOLDS (ROBOT, BOX) TABLE (A) TABLE (B) Operation Representation Pick up Box from A Condition: ON (BOX, A) AT (ROBOT, A) EMPTYHANDED (ROBOT) Delete: EMPTYHANDED (ROBOT) ON (BOX, A) Add: HOLDS (BOX) Action Series (Plan) Representation “Asking robot at alcove to move box from A” Homework Represent solve the problem below by logic approach: The Monkey Bananas Problem A hungry monkey finds himself in a room in which a bunch of bananas is hanging from the ceiling. The monkey, unfortunately, cannot reach the bananas. However, in the room there is also a desk. The ceiling is just the right height so that a monkey standing on a desk could knock the bananas down. What is the best sequence of actions for the monkey to take the bananas ? Section 2 State Space, Graph, Semantic Net 2-1 State Space Examples The health information can be represented by body temperature, blood pressure, complexion, number of white-blood-cell, … The nation development can be represented by output of industry, output of agriculture, education index, expenses index, … A General form of state-space-mapping {S}, F, {G} Example: The game of coins turning-over Suppose that one has 3 coins with S and G given. It is allowed to turn 1 piece of the coins over at a time. Is it possible to transform the coins from S to G in 3 turnings ? + - - + + + - - - Start State S Goal States G 001 101 111 011 010 110 100 000 f1 f2 f1 f3 f1 f2 f1 f3 f2 f2 f3 f3 2#=S 7# =G 0#=G 1# 5# 3# 6# 4# fn: the operation of turning over the n-th coin. * Welcome to The Course Artificial Intelligence Neural Networks Y. X. ZHONG Resea

文档评论(0)

ranfand + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档