[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fyVZ_labue4nR9NUFLG011nzgylVii3a4RITkbVSSkmk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2023-09-06 12:44:16",96331069,[8,9,10,11],"框架网络","语义图","博亦图","状态图",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},6,"3b6d373cb10d6db350059d75c99c7599","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e2d5ad53be3d12aacc56ee37db405b7.jpg","知识表示与推理（人工智能）","0f78b19097ba42cc9af144099d0aaff5","搜索章末测试","或图通常称为",[21,26,35,46,55,64],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":34,"source":24,"type":25},[],96331070,[30,31,32,33],"宽度优先搜索","深度优先搜索","有界深度搜索","启发式搜索","如果问题存在最优解,则下面几种搜索算法中,( )可以认为是"智能程度相对比较高"的算法",{"answer":36,"createTime":37,"id":38,"options":39,"question":44,"source":24,"type":45},[],"2023-09-16 12:22:14",96331071,[40,41,42,43],"g(x)是从初始节点到节点x的实际代价","h(x)是从初始节点x到目标节点的实际代价","g(x)是从初始节点到节点x的最优路径的估价代价","h(x)是从节点x到目标节点的最优路径的估价代价","在估价函数中,对与g(x)和h(x)下面描述正确的是( )",1,{"answer":47,"createTime":37,"id":48,"options":49,"question":54,"source":24,"type":25},[],96850265,[50,51,52,53],"h(x)≤h*(x)","h(x)≠h*(x)","h(x)≥h*(x)","h(x)>h*(x)","依据估价函数f(x)=g(x)+h(x) (其中g(x)为初始节点到节点x已实际付出的代价,h(x)是节点x到目标节点的最优路径的估计代价)对OPEN表中的节点进行排序,并且要求启发函数满足( ),则称这种状态空间图的搜索算法为A*算法",{"answer":56,"createTime":37,"id":57,"options":58,"question":63,"source":24,"type":25},[],96850272,[59,60,61,62],"closed表用于存放已扩展的节点","open表用于存放已扩展的节点","open表用于存放所有已生成的节点","closed表用于存放所有已生成而未扩展的节点","在启发式图搜索策略中,下面描述正确的是( )",{"answer":65,"createTime":66,"id":67,"options":68,"question":71,"source":24,"type":72},[],"2024-10-02 09:30:22",160655176,[69,70],"正确","错误","在图搜索算法中,如果按估价函数\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9d6f17046da938067a9298a3d7aacc71.png\"> 作为OPEN表中的结点排序的依据,则该算法就是深度优先算法",3]