[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fAMnDziKXXtuzURMMQcqKD17LIkUbDxEm1sw9FnYN13E":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":15,"related":16,"source":26,"type":27},[],"2025-05-11 08:18:03",1060770085,[8,9,10,11],"宽度优先搜索的特点是先生成的节点先扩展","深度优先搜索的特点是先生成的节点先扩展","深度优先搜索的特点是先扩展最新产生的节点","宽度优先搜索的特点是先扩展最新产生的节点",{"courseImg":13,"courseName":14},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcf3bb414b5ea2367f316b2d3561124c7.jpg","[共享课]人工智能","宽度优先搜索与深度优先搜索有何区别是( )",[17,28,37,45,54,62,67,76,85,90],{"answer":18,"createTime":5,"id":19,"options":20,"question":25,"source":26,"type":27},[],1060768783,[21,22,23,24],"BFS","DFS","UCS","无","若一搜索树的树高有限且所有单步损耗均非负,则为每条边增加一正损耗c>0,以下树搜索算法中( )所得搜索路径保持不变","v2",1,{"answer":29,"createTime":5,"id":30,"options":31,"question":35,"source":26,"type":36},[],1060768829,[32,33,34],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F97b167f3818a90dea33605a6ed34d7a7.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcedeec654add2b9a6a5a787694ce6f00.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fb6e7c89a3f5b337c14d00444d8e0b40d.png\">","使用\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F29311cf92ac2797226068a7e6ae0bde8.png\">-贪心Q-learning算法得到的最优策略是( )",0,{"answer":38,"createTime":5,"id":39,"options":40,"question":44,"source":26,"type":36},[],1060768923,[41,42,43],"-1","-2","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0667569d70d702a708ffd70eafae0159.png\">","一个MDP问题中有A,B,C这三个状态,智能体可以执行的动作是向右(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F314a42688fdce41a09ed9f49b8584a7e.png\">),转移模型如下.我们据此完成无限次迭代的Q-learning.若衰减因子为1,学习率为1,则\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1689b9d180a8ea9f0638df278b32f729.png\">( )\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a647b1f55e3d7f0768ba11068dbf8f.png\">",{"answer":46,"createTime":5,"id":47,"options":48,"question":53,"source":26,"type":27},[],1060769090,[49,50,51,52],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9b90370e5ec69b2b59be48507b6e3572.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1d4d44977437618fde6664aceef8a95d.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff33327ccda535f9d90f8b9f6c47ef6d7.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F13d08f20bd847d79a33137bb55671741.png\">","下列公式正确的有( )",{"answer":55,"createTime":5,"id":56,"options":57,"question":60,"source":26,"type":61},[],1060769135,[58,59],"对","错","基于模型的强化学习涉及纯离线计算,而模型无关的强化学习需要与环境进行在线交互.( )",3,{"answer":63,"createTime":5,"id":64,"options":65,"question":66,"source":26,"type":61},[],1060769164,[58,59],"广度优先搜索可以找到步数最短的搜索路径,并且能保证路径的代价最小.( )",{"answer":68,"createTime":5,"id":69,"options":70,"question":75,"source":26,"type":27},[],1060769641,[71,72,73,74],"值迭代方法","状态迭代方法","策略迭代方法","回报迭代方法","在有模型的强化学习中,属于动态规划求解的是( )",{"answer":77,"createTime":5,"id":78,"options":79,"question":84,"source":26,"type":36},[],1060769751,[80,81,82,83],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F337926b18a7ceaabdfad5b2639b7f157.jpg\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4380e14a56df3bb7de25cefb3358a2f9.jpg\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc960c31c4270d294fcb0f674bb6fc0af.jpg\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F5f869f433b69cf3430fc9bb56d268ccd.jpg\">","在强化学习值函数近似中,蒙特卡罗方法对参数的更新公式是( )",{"answer":86,"createTime":5,"id":87,"options":88,"question":89,"source":26,"type":61},[],1060769796,[58,59],"贪心搜索算法一定能找到最优解,因为它总是朝着离目标状态靠近的方向生成和扩展节点.( )",{"answer":91,"createTime":5,"id":6,"options":92,"question":15,"source":26,"type":27},[],[8,9,10,11]]