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